论文信息 - An improved algorithm for the two machine flow shop problem with several availability constraints

An improved algorithm for the two machine flow shop problem with several availability constraints

In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3. We then present a polynomially solvable case.

Hatem Hadda | Hatem Hadda

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

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

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

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

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

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

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

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

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