Two-machine flow shop no-wait scheduling with machine maintenance

Abstract.We study a two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is subject to mandatory maintenance. The length of the maintenance period is defined by a non-decreasing function that depends on the starting time of that maintenance. The objective is to minimize the completion time of all activities. We present a polynomial-time approximation scheme for this problem.

[1]  Vitaly A. Strusevich,et al.  Approximation Algorithms for the Two-Machine Flow Shop No-Wait Scheduling with a Non-Availability Interval , 2002 .

[2]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[3]  T. C. Edwin Cheng,et al.  3/2-approximation for Two-machine No-wait Flowshop Scheduling with Availability Constraints , 2003, Inf. Process. Lett..

[4]  Celia A. Glass,et al.  The Scheduling of Maintenance Service , 1998, Discret. Appl. Math..

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

[6]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[7]  E. Lawler,et al.  Well-solved special cases , 1985 .

[8]  Marie-Laure Espinouse,et al.  Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability , 2001, J. Oper. Res. Soc..

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

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

[11]  Gerhard J. Woeginger,et al.  Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey , 1998, SIAM Rev..

[12]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[13]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[14]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[15]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .