论文信息 - An improved heuristic for two-machine flowshop scheduling with an availability constraint

An improved heuristic for two-machine flowshop scheduling with an availability constraint

In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 12 of the heuristic provided by Lee [4] is tight. We then develop an improved heuristic with a worst-case error bound of 13.

T. C. Edwin Cheng | Guoqing Wang | T. Cheng | Guoqing Wang

[1] T. C. Edwin Cheng,et al. Two-Machine Flowshop Scheduling with Consecutive Availability Constraints , 1999, Inf. Process. Lett..

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

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

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