Abstract
In this paper, we deal with a special case of the two-machine flow shop scheduling problem with several availability constraints on the second machine, under the resumable scenario. We develop an improved algorithm with a relative worst-case error bound of 4/3.
Article PDF
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Avoid common mistakes on your manuscript.
References
Breit J.: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf. Process. Lett. 90, 273–278 (2004)
Breit J., Schmidt G., Strusevich V.A.: Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57, 217–234 (2003)
Cheng T.C.E., Wang G.: An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26, 223–229 (2000)
Cheng T.C.E., Wang G.: Two-machine flow shop scheduling with consecutive availability constraints. Inf. Process. Lett. 71, 49–54 (1999)
Johnson S.M.: Optimal two- and three-stage production schedules with setup times included. Res. Log. Q. 1, 61–68 (1954)
Kubiak W., Blazewicz J., Formanowicz P., Breit J., Schmidt G.: Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136, 528–540 (2002)
Kubzin M.A., Potts C.N., Strusevich V.A.: Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36, 379–390 (2009)
Lee C.Y.: Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper. Res. Lett. 20, 129–139 (1997)
Lee C.Y.: Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114, 420–429 (1999)
Ng C.T., Kovalyov M.Y.: An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Naval Res. Log. 51, 307–315 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hadda, H. A \({(\frac 4 3) -}\) approximation algorithm for a special case of the two machine flow shop problem with several availability constraints. Optim Lett 3, 583–592 (2009). https://doi.org/10.1007/s11590-009-0137-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-009-0137-6