Two-machine flow shop and open shop scheduling problems with a single maintenance window

Abstract The paper considers the two-machine flow shop and open shop scheduling problems to minimize the makespan, provided that one of the machines is subject to maintenance, which has to start within a prescribed time window. In the case of the flow shop, maintenance is performed on the second machine. A non-resumable setting is considered, i.e., if a job cannot be completed prior to the maintenance, it must restart from scratch after the maintenance. For each of these NP-hard problems we develop a 3/2–approximation algorithm.

[1]  Vitaly A. Strusevich,et al.  Scheduling with Time-Changing Effects and Rate-Modifying Activities , 2017 .

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

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

[4]  George Steiner,et al.  Single-machine scheduling with periodic maintenance to minimize makespan revisited , 2013, Journal of Scheduling.

[5]  Maw-Sheng Chern,et al.  MINIMIZING THE MAKESPAN IN A SINGLE MACHINE SCHEDULING PROBLEM WITH A FLEXIBLE MAINTENANCE , 2002 .

[6]  D. de Werra,et al.  Graph-theoretical models for preemptive scheduling , 1989 .

[7]  Vitaly A. Strusevich,et al.  Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance , 2015, J. Oper. Res. Soc..

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

[9]  J. S. Chen,et al.  Single-machine scheduling with flexible and periodic maintenance , 2006, J. Oper. Res. Soc..

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

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

[12]  Vitaly A. Strusevich,et al.  Combining time and position dependent effects on a single machine subject to rate-modifying activities , 2014 .

[13]  Dehua Xu,et al.  A note on "scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan" , 2009, Eur. J. Oper. Res..

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

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

[16]  Michael Pinedo,et al.  Stochastic Shop Scheduling: A Survey , 1982 .

[17]  Hans Kellerer,et al.  Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance , 2013, J. Sched..

[18]  Vitaly A. Strusevich,et al.  Approximation Algorithms for Three-Machine Open Shop Scheduling , 1993, INFORMS J. Comput..

[19]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

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

[21]  Jen-Shiang Chen,et al.  Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan , 2008, Eur. J. Oper. Res..

[22]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[23]  Vitaly A. Strusevich,et al.  Two-machine open shop scheduling with an availability constraint , 2001, Oper. Res. Lett..

[24]  Vitaly A. Strusevich,et al.  Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints , 2006 .

[25]  Chris N. Potts,et al.  Approximation results for flow shop scheduling problems with machine availability constraints , 2009, Comput. Oper. Res..

[26]  Dehua Xu,et al.  On single-machine scheduling with flexible maintenance activities , 2011 .

[27]  Vitaly A. Strusevich,et al.  Two-machine flow shop no-wait scheduling with machine maintenance , 2005, 4OR.

[28]  Alan J. Soper.  A cyclical search for the two machine flow shop and open shop to minimise finishing time , 2015, J. Sched..

[29]  C.-Y. Lee,et al.  Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[30]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[31]  Gur Mosheiov,et al.  Scheduling a deteriorating maintenance activity on a single machine , 2010, J. Oper. Res. Soc..

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

[33]  Hatem Hadda,et al.  An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs , 2010, 4OR.

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