A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints

Optimization Letters

Volumn 3, Issue 4, 2009, Pages 583-592

  Hadda, Hatem ^a  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Approximation algorithms; Availability constraint; Error bound; Flow shop scheduling

Indexed keywords

AVAILABILITY CONSTRAINT; AVAILABILITY CONSTRAINTS; ERROR BOUND; FLOW SHOP SCHEDULING; FLOW SHOP SCHEDULING PROBLEM; IMPROVED ALGORITHM; TWO MACHINE FLOW SHOP PROBLEM; WORST-CASE ERRORS;

MACHINE SHOP PRACTICE; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 70350055183     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-009-0137-6     Document Type: Article

References (10)

1. Breit J.: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf. Process. Lett. 90, 273-278 (2004).
2. Breit J., Schmidt G., Strusevich V.A.: Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57, 217-234 (2003).
3. Cheng T.C.E., Wang G.: An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26, 223-229 (2000).
4. Cheng T.C.E., Wang G.: Two-machine flow shop scheduling with consecutive availability constraints. Inf. Process. Lett. 71, 49-54 (1999).
5. Johnson S.M.: Optimal two- and three-stage production schedules with setup times included. Res. Log. Q. 1, 61-68 (1954).
6. Kubiak W., Blazewicz J., Formanowicz P., Breit J., Schmidt G.: Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136, 528-540 (2002).
7. Kubzin M.A., Potts C.N., Strusevich V.A.: Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36, 379-390 (2009).
8. Lee C.Y.: Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper. Res. Lett. 20, 129-139 (1997).
9. Lee C.Y.: Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114, 420-429 (1999).
10. Ng C.T., Kovalyov M.Y.: An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Naval Res. Log. 51, 307-315 (2004).