Abstract
In this paper, we deal with the two-machine flow shop scheduling problem having an unavailability interval on the first machine, and nonresumable jobs. We first present an enhancement procedure that, once applied to any arbitrary solution, produces a schedule that is at most equal 2 times the optimal makespan. We then develop an improved heuristic, with a relative worst-case error of 3/2.
Similar content being viewed by others
References
Breit J (2004) An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf Process Lett 90: 273–278
Cheng TCE, Wang G (2000) An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper Res Lett 26: 223–229
Hadda H, Dridi N, Hajri-Gabouj S (2007a) The two-stage assembly flow shop scheduling with an availability constraint. In: Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Application, MISTA, pp 184–191
Hadda H, Hajri-Gabouj S, Dridi N (2007b) Etude du flow shop hybride à deux étages avec machines dédiées sous contrainte d’indisponibilité. In: 5th International Conference: Integrated Design and Production, CPI, Rabat-Morocco
Hamid A, Artiba A (2006) Scheduling two-stage hybrid flow shop with availability constraints. Comput Oper Res 33: 1399–1419
Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Res Log Q 1: 61–68
Lee CY (1997) Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper Res Lett 20: 129–139
Lee CY (1999) Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114: 420–429
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hadda, H., Dridi, N. & Hajri-Gabouj, S. An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs. 4OR-Q J Oper Res 8, 87–99 (2010). https://doi.org/10.1007/s10288-009-0102-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-009-0102-3