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.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
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.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- 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