Approximation results for flow shop scheduling problems with machine availability constraints

This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenario in which some portion of the processing is repeated but the job is otherwise resumable. For the problem with several non-availability intervals on the first machine under the resumable scenario, we present a fast (32)-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, a polynomial-time approximation scheme is developed.

[1]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[2]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  T. C. Edwin Cheng,et al.  An improved heuristic for two-machine flowshop scheduling with an availability constraint , 2000, Oper. Res. Lett..

[4]  Eric Sanlaville,et al.  Machine scheduling with availability constraints , 1998, Acta Informatica.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[7]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[8]  Chung-Yee Lee.  Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..

[9]  Vitaly A. Strusevich,et al.  Two‐machine flow shop no‐wait scheduling with a nonavailability interval , 2004 .

[10]  Joachim Breit,et al.  An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint , 2004, Inf. Process. Lett..

[11]  C. T. Ng,et al.  An FPTAS for scheduling a two‐machine flowshop with one unavailability interval , 2004 .

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

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

[14]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

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

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

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

[18]  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..

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

[20]  Joachim Breit,et al.  A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint , 2006, Comput. Oper. Res..

[21]  Vitaly A. Strusevich,et al.  Non-preemptive two-machine open shop scheduling with non-availability constraints , 2003, Math. Methods Oper. Res..

[22]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[23]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[24]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

[25]  T. C. Edwin Cheng,et al.  Two-Machine Flowshop Scheduling with Consecutive Availability Constraints , 1999, Inf. Process. Lett..