Improved heuristic for two-machine flowshop scheduling with an availability constraint

Operations Research Letters

Volumn 26, Issue 5, 2000, Pages 223-229

  Cheng, T C Edwin ^a   Wang, Guoqing ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b JINAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; HEURISTIC METHODS; SCHEDULING;

FLOWSHOP SCHEDULING;

OPERATIONS RESEARCH;

EID: 0034206108     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00033-X     Document Type: Article

References (5)

1. Cheng T.C.E., Wang G. Two-machine flowshop scheduling with consecutive availability constraints. Inform. Process. Lett. 71:1999;49-54.
2. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1:1954;61-68.
3. Kubiak W., Blazewicz J., Formanowicz P., Schmidt G. A branch and bound algorithm for two machine flow shop with limited machine availability. The Abstracts of the Tenth Meeting of the European Chapter on Combinatorial Optimization. 38:1997.
4. Lee C.-Y. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Oper. Res. Lett. 20:1997;129-139.
5. Lee C.-Y. Two-machine flowshop scheduling with availability constraints. European J. Oper. Res. 114:1999;420-429.