4OR

, Volume 8, Issue 1, pp 87–99 | Cite as

An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

Research Paper
First Online:
Received:
Revised:

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.

Keywords

Flow shop Scheduling Availability constraint Heuristics Worst case analysis 

MSC classification (2000)

68W40 Analysis of algorithms 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Breit J (2004) An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf Process Lett 90: 273–278CrossRefGoogle Scholar
  2. Cheng TCE, Wang G (2000) An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper Res Lett 26: 223–229CrossRefGoogle Scholar
  3. 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–191Google Scholar
  4. 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-MoroccoGoogle Scholar
  5. Hamid A, Artiba A (2006) Scheduling two-stage hybrid flow shop with availability constraints. Comput Oper Res 33: 1399–1419CrossRefGoogle Scholar
  6. Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Res Log Q 1: 61–68CrossRefGoogle Scholar
  7. Lee CY (1997) Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper Res Lett 20: 129–139CrossRefGoogle Scholar
  8. Lee CY (1999) Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114: 420–429CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  1. 1.Unité de Recherche URAII, INSAT-TunisTunis CedexTunisia
  2. 2.Unité de Recherche OASIS, ENITTunisTunisia

Personalised recommendations