3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 161-165

  Cheng, T C Edwin ^a   Liu, Zhaohui ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Approximation algorithms; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; SCHEDULING;

FLOWSHOP SCHEDULING;

DATA PROCESSING;

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

References (5)

1. Cheng T.C.E., Liu Z. Approximability of two-machine no-wait flowshop scheduling with availability constraints. Oper. Res. Lett. 31:2003;319-322.
2. Espinouse M.L., Formanowicz P., Penz B. Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability. Comput. Indust. Engrg. 37:1999;497-500.
3. Gilmore P.C., Gomory R.E. Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 12:1964;655-679.
4. Hall N.G., Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44:1996;510-525.
5. Wang G., Cheng T.C.E. Heuristics for two-machine no-wait flowshop scheduling with an availability constraint. Inform. Process. Lett. 80:2001;305-309.