Single machine scheduling when processing times are correlated normal random variables

Article Abstract:

A study presents a permutation policy of determining optimal uninterrupted single machine scheduling when processing times follow a normal distribution in an equicorrelation case. Weighted flow-time problems are likewise examined using the dynamic version of Smith's rule which modifies the mean processing times of uncompleted jobs. Results reveal a permutation policy that is optimal for general order-specific and job-specific costs.

Production Planning & Control, Manufacturing processes, Manufacturing, Production control, Stochastic processes, Combinatorial analysis

---

A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times

Article Abstract:

A study uses a search algorithm to examine job scheduling problems, which occus when there is only one machine.

United States, Search theory, Sequential machine theory

---

Similar abstracts:

• Abstracts: Single period, single product newsvendor model with random supply shock. An algorithm based on discrete response regression models suitable to correct the bias of non-response in surveys with several capture tries
• Abstracts: Hybrid flow-shop scheduling problems with multiprocessor task systems. Equity in international greenhouse gases abatement scenarios: a multicriteria approach
• Abstracts: Little ones feeling glum?. 10 brilliant uses for... clear packing tape
• Abstracts: Case study: Temple Bar. Time to stop the rot
• Abstracts: Dean tells his backers Wisconsin win is key: democratic hopeful says poor showing will put him out of the U.S. race. part 2

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.