A PTAS for non-resumable open shop scheduling with an availability constraint

Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the makespan. This paper considers non-resumable scenario, i.e., if a job which starts before the maintenance period cannot be completed before the maintenance period, then it must be restarted after the interval from scratch. We only discuss the case that the maintenance period is performed on the first machine, while the case of the maintenance period on the second machine is symmetric. We obtain a polynomial time approximation scheme, which is better than the best previous result $$\frac{4}{3}$$ .

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

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

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

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

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

[6]  Hatem Hadda,et al.  A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints , 2011, Optimization Letters.

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

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

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

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

[11]  N. V. Shakhlevich,et al.  Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function , 1993 .

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

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

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

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

[16]  Jacek Blazewicz,et al.  Scheduling jobs in open shops with limited machine availability , 2002, RAIRO Oper. Res..

[17]  Lu Lu,et al.  An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity , 1993, Math. Oper. Res..

[18]  Gur Mosheiov,et al.  Two-machine flow shop and open shop scheduling problems with a single maintenance window , 2018, Eur. J. Oper. Res..

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

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

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

[22]  Hatem Hadda,et al.  A PTAS for a Particular Case of the Two-machine Flow Shop with Limited Machine Availability , 2014, J. Math. Model. Algorithms Oper. Res..

[23]  Vitaly A. Strusevich.  A greedy open shop heuristic with job priorities , 1998, Ann. Oper. Res..

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

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

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

[27]  J. Billaut,et al.  A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint , 2002, J. Oper. Res. Soc..