Non-bottleneck machines in three-machine flow shops

Journal of Scheduling

Volumn 3, Issue 4, 2000, Pages 209-223

  Kamburowski, Jerzy ^a  

^a UNIVERSITY OF TOLEDO   (United States)

Author keywords

Flow shop; Johnson's algorithm; Makespan; Non bottleneck machine; Sequencing; Worst case analysis

Indexed keywords

EID: 0345807582     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1425(200007/08)3:4<209::AID-JOS43>3.0.CO;2-W     Document Type: Article

References (26)

1. Graham RL, Lawler EL, Lenstra JK, Rinooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979; 5:287-326.
2. Johnson SM. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954; 1:61-68.
3. Panwalkar SS, Smith ML, Woolam CR. Counterexamples to optimal permutation schedules for certain flowshops problems. Naval Research Logistics Quarterly 1981; 28:339-340.
4. Garey MRD, Johnson DS, Sethi R. The complexity of flowshop and job shop scheduling. Mathematical Operations Research 1976; 1:117-129.
5. Kamburowski J. The nature of simplicity of Johnson's algorithm. Omega, International Journal of Management Science 1997; 25:581-584.
6. Monma CL, Rinnooy Kan AHG. A concise survey of efficiently solvable special cases of the permutation flow-shop problem. RAIRO Recherche Operationelle 1983; 17:105-119.
7. Ho JC, Gupta JND. Flowshop scheduling with dominant machines. Computers and Operations Research 1995; 22:237-246.
8. Van Den Nouweland A, Krabbenborg M, Potters J. Flow-shops with a dominant machine. European Journal of Operations Research 1992; 62:38-46.
9. Pinedo M. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall: Englewood Cliffs, NJ, 1995.
10. Burns F, Rooker J. Three-stage flow-shop with recessive second stage. Operations Research 1978; 26:207-208.
11. Nowicki E, Smutnicki C. Worst-case analysis of an approximation algorithm for flow shop scheduling. Operations Research Letters 1989; 10:473-480.
12. Cambell HG, Dudek RA, Smith ML. A heuristic algorithm for the n job m machine sequencing problem. Management Science 1970; 16:B630-637.
13. Arthanary TS, Mukhapadhyay AC. A note on a paper by W. Szwarc. Naral Research Logistics Quarterly 1971; 18:135-138.
14. Chen BO, Glass CA, Potts CN, Strusevich VA. A new heuristic for three-machine flow shop scheduling. Operations Research 1996; 44:891-898.
15. Johnson SM. Discussion: Sequencing n jobs on two machines with arbitrary lag times. Management Science 1959; 5:299-303.
16. Mitten LG. A scheduling problem. Journal of Industrial Engineering 1959; 10:131-135.
17. Morton TE, Pentico DW. Heuristic Scheduling Systems, With Applications to Production Systems and Project Management. Wiley: New York, 1993.
18. Sidney JB. The two-machine maximum flow time problem with series-parallel precedence relations. Operations Research 1979; 27:782-791.
19. Kubiak W, Lou SXC, Wang Y. Mean flow time minimization in reentrant job shops with a hub. Operations Research 1996; 44:764-776.
20. Monma CL, Sidney JB. Sequencing with series-parallel precedence constraints. Mathematics of Operations Research 1979; 4:215-224.
21. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity, In Handbooks in Operations Research and Management Science, Vol. 4, Graves SC et al. (eds). North-Holland: Amsterdam, 1993.
22. Dell'Amico M. Shop problems with two machines and time lags. Operations Research 1996; 44:777-787.
23. Burns F, Rooker J. Johnson's three-machine flow-shop conjecture. Operations Research 1976; 24:578-580.
24. Burns F, Rooker J. A special case of the 3 × n flow-shop problem. Naval Research Logistics Quarterly 1975; 22:811-817.
25. Szwarc W. Mathematical aspects of the 3 × n job shop sequencing problem. Naval Research Logistics Quarterly 1974; 21:145-153.
26. Lai TC. A note on heuristics of flow-shop scheduling. Operations Research 1996; 44:648-652.