论文信息 - Approximability of two-machine no-wait flowshop scheduling with availability constraints

Approximability of two-machine no-wait flowshop scheduling with availability constraints

We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap.

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

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

[2] Gerhard J. Woeginger,et al. Makespan minimization in open shops: A polynomial time approximation scheme , 1998, Math. Program..

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

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

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