A PTAS for a Particular Case of the Two-machine Flow Shop with Limited Machine Availability

In this paper we develop a polynomial-time approximation scheme for a particular case of the two-machine flow shop scheduling problem with several availability constraints on the second machine under the resumable scenario.

[1]  Hatem Hadda,et al.  An improved algorithm for the two machine flow shop problem with several availability constraints , 2010, 4OR.

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

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

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

[5]  Hatem Hadda,et al.  The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis , 2014, J. Math. Model. Algorithms Oper. Res..

[6]  Gerhard J. Woeginger,et al.  A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem , 2000, Theor. Comput. Sci..

[7]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[11]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

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

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

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

[15]  Hatem Hadda,et al.  A $${(\frac 4 3) -}$$ approximation algorithm for a special case of the two machine flow shop problem with several availability constraints , 2009, Optim. Lett..

[16]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

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