论文信息 - 3/2-approximation for Two-machine No-wait Flowshop Scheduling with Availability Constraints

3/2-approximation for Two-machine No-wait Flowshop Scheduling with Availability Constraints

We consider in this paper the two-machine no-wait flowshop problem in which each machine may have an unavailable interval. We present 3/2-approximation algorithms for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. These algorithms improve on existing results.

T. C. Edwin Cheng | Zhaohui Liu | Zhaohui Liu | T.C.Edwin Cheng

[1] Marie-Laure Espinouse,et al. Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability , 1999 .

[2] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[3] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[4] T. C. Edwin Cheng,et al. Approximability of two-machine no-wait flowshop scheduling with availability constraints , 2003, Oper. Res. Lett..

[5] T. C. Edwin Cheng,et al. Heuristics for two-machine no-wait flowshop scheduling with an availability constraint , 2001, Inf. Process. Lett..