Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times

Journal of Scheduling

Volumn 5, Issue 1, 2002, Pages 71-92

  Cheng, Jinliang ^a   Steiner, George ^b   Stephenson, Paul ^c  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

^c ACADIA UNIVERSITY   (Canada)

Author keywords

Lateness; Makespan; Permutation flow shop; Release times

Indexed keywords

ALGORITHMS; MACHINERY; PROBLEM SOLVING;

LATENESS; MAKESPAN; PERMUTATION FLOW SHOPS; RELEASE TIMES;

SCHEDULING;

EID: 0345757591     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.94     Document Type: Article

References (19)

1. Johnson SM. Optimal two- and three-stage production schedules with setup times included. Naval Research and Logistics Quarterly 1954; 1:61-68.
2. 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.
3. Pinedo M. SCHEDULING: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ, 1995.
4. Lenstra JK, Rinnooy Kan AHG, Bnicker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1977; 1:343-362.
5. Potts CN. Analysis of heuristics for two-machine flow-shop sequencing subject to release dates. Mathematics of Operations Research 1985; 10:576-584.
6. Hall LA. A polynomial approximation scheme for a constrained flow shop scheduling problem. Mathematics of Operations Research 1994; 19:68-85.
7. max. Operations Research Letters 1997; 20:75-79.
8. Tadei R, Gupta JND, Della Croce F, Cortesi M. Minimising makespan in the two-machine flow-shop with release times. Journal of the Operational Research Society 1998; 49:77-85.
9. Lageweg BJ, Lenstra JK, Rinnooy Kan AHG. A general bounding scheme for the permutation flow-shop problem. Operations Research 1978; 26:53-67.
10. Carlier J, Rebai I. Two branch and bound algorithms for the permutation flow shop problem. European Journal of Operational Research 1996; 90:238-251.
11. Cheng J, Kise H, Matsumoto H. A branch and bound algorithm with fuzzy inference for a permutation flowshop scheduling problem. European Journal of Operational Research 1997; 96:578-590.
12. Cheng J, Steiner G, Stephenson P. A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. European Journal of Operational Research 2001; 130: 559-575.
13. Carlier J. The one machine sequencing problem. European Journal of Operational Research 1982; 11:42-47.
14. Grabowski J. On two-machine scheduling with release and due dates to minimize maximum lateness. Opsearch 1980; 17:133-154.
15. Grabowski J, Skubalska E, Smutnicki C. On flow shop scheduling with release and due dates to minimize maximum lateness. Journal of the Operational Research Society 1983; 34:615-620.
16. Potts CN. An adaptive branching rule for the permutation flow-shop problem. European Journal of Operational Research 1980; 5:19-25.
17. Cheng J, Steiner G, Stephenson P. Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. Advanced Optimization Laboratory Report No. 1/2001, McMaster University, Hamilton, Ontario, Canada, 2001. (Available at http://www.cas.mcmaster.ca/oplab/ publication/report/advo12001.1.pdf.)
18. Hariri AM, Potts CN. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics 1983; 5:99-109.
19. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64: 278-285.