An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

Information Processing Letters

Volumn 90, Issue 6, 2004, Pages 273-278

  Breit, J ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Flow shop scheduling; Worst case analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; DATA PROCESSING; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; FLOW SHOP SCHEDULING; SCHEDULING MODELS; WORST-CASE ANALYSIS;

MACHINE SHOPS;

EID: 2442429732     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.03.004     Document Type: Article

References (8)

1. Błažewicz J., Breit J., Formanowicz P., Kubiak W., Schmidt G. Heuristic algorithms for the two-machine flowshop with limited machine availability. Omega. 29:2001;599-608.
2. Cheng T.C.E., Wang G. Two-machine flowshop scheduling with consecutive availability constraints. Inform. Process. Lett. 71:1999;49-54.
3. Cheng T.C.E., Wang G. An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26:2000;223-229.
4. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Nav. Res. Log. Quarterly. 1:1954;61-68.
5. Kubiak W., Błažewicz J., Formanowicz P., Breit J., Schmidt G. Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136:2002;528-540.
6. Lee C.-Y. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Oper. Res. Lett. 20:1997;129-139.
7. Sanlaville E., Schmidt G. Machine scheduling with availability constraints. Acta Inform. 35:1998;795-811.
8. Schmidt G. Scheduling with limited machine availability. Eur. J. Oper. Res. 121:2000;1-15.