Johnson's problem with stochastic processing times and optimal service level

European Journal of Operational Research

Volumn 169, Issue 3, 2006, Pages 751-760

  Portougal, Victor ^a   Trietsch, Dan ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Customer service level; Due date setting; Scheduling; Stochastic processes

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; OPTIMAL SYSTEMS; PROBLEM SOLVING; SCHEDULING;

CUSTOMER SERVICE LEVELS; DISCRETE PROCESSING TIME DISTRIBUTIONS; DUE-DATE SETTING; JOHNSON'S PROBLEM;

RANDOM PROCESSES;

EID: 27144519968     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.09.056     Document Type: Article

References (17)

1. A. Allahverdi, T. Aldowaisan, and Y.N. Sotskov Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times International Journal of Mathematics and Mathematical Sciences 39 2003 2475 2486
2. A. Allahverdi, and J. Mittenthal Two-machine ordered flowshop scheduling under random breakdowns Mathematical and Computer Modelling 20 1994 9 17
3. A. Allahverdi, and J. Mittenthal Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function European Journal of Operational Research 81 1995 376 387
4. A. Allahverdi, and Y.N. Sotskov Two-machine flowshop minimum length scheduling problem with random and bounded processing times International Transactions in Operational Research 10 2003 65 76
5. C.E. Clark The greatest of a finite set of random variables Operations Research 9 1961 145 162
6. B. Dodin Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops Computers in Operations Research 23 1996 829 843
7. S.E. Elmaghraby, and K.A. Thoney The two-machine stochastic flowshop problem with arbitrary processing time distributions IIE Transactions 31 1999 467 477
8. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
9. J. Kamburowski Stochastically minimizing the makespan in two-machine flow shops without blocking European Journal of Operational Research 112 1999 304 309
10. P.-S. Ku, and S.-C. Niu On Johnson's two-machine flow shop with random processing times Operations Research 34 1986 130 136
11. H.J. Kushner Approximation and Weak Convergence Methods for Random Processes, with Applications to Random Systems Theory 1984 The MIT Press
12. M. Pinedo Minimizing the expected makespan in stochastic flow shops Operations Research 30 1982 148 162
13. M. Pinedo Scheduling: Theory, Algorithms, and Systems second ed. 2001 Prentice Hall
14. V. Portougal, and D. Trietsch Makespan-related criteria for comparing schedules in stochastic environments Journal of the Operational Research Society 49 1998 1188 1195
15. V. Portougal, and D. Trietsch Stochastic scheduling with optimal customer service Journal of the Operational Research Society 52 2001 226 233
16. H.M. Soroush Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs European Journal of Operational Research 113 1999 450 468
17. T.E. Vollman, W.L. Berry, and D.C. Whybark Manufacturing Planning and Control Systems forth ed. 1997 Irwin/McGraw-Hill