The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis

In this paper, we are interested in handling the limited availability of machines in the two-stage assembly flow shop scheduling problems. Emphasis is put on the semiresumable case with respect to the minimization of the makespan. We provide, when possible, heuristics with a tight worst-case ratio bound of 2.

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

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

[3]  Wieslaw Kubiak,et al.  Heuristic algorithms for the two-machine flowshop with limited machine availability ☆ , 2001 .

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

[5]  Xi Sun,et al.  Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling , 2003, Eur. J. Oper. Res..

[6]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

[7]  A.H.G. Rinnooy Kan,et al.  Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs , 1991 .

[8]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

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

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

[11]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..

[12]  W. J. Chen,et al.  Minimizing total flow time in the single-machine scheduling problem with periodic maintenance , 2006, J. Oper. Res. Soc..

[13]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

[14]  W. J. Chen,et al.  Single-machine scheduling with periodic maintenance and nonresumable jobs , 2003, Comput. Oper. Res..

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

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

[17]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

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

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

[21]  Jacek Blazewicz,et al.  An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints , 2005, Eur. J. Oper. Res..

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

[23]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..

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

[25]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

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

[27]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[28]  Mohamed Haouari,et al.  Optimal scheduling of the 3-machine assembly-type flow shop , 1999, RAIRO Oper. Res..

[29]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

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