Skip to main content
Log in

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

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

    Article  Google Scholar 

  • Cheng TCE, Wang G (2000) An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper Res Lett 26: 223–229

    Article  Google Scholar 

  • Hadda H, Dridi N, Hajri-Gabouj S (2009) An improved heuristic for two-machine flow shop scheduling with an avilability constraint and nonresumable jobs. 4OR-Q J Oper Res. doi:10.1007/s10288-009-0102-3

  • Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Res Log Q 1: 61–68

    Article  Google Scholar 

  • Kubzin MA, Potts CN, Strusevich VA (2009) Approximation results for flow shop scheduling problems with machine availability constraints. Comp & Oper Res 36: 379–390

    Article  Google Scholar 

  • Kubiak W, Blazewicz J, Formanowicz P, Breit J, Schmidt G (2002) Two-machine flow shops with limited machine availability. Eur J Oper Res 136: 528–540

    Article  Google Scholar 

  • Lee CY (1997) Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper Res Lett 20: 129–139

    Article  Google Scholar 

  • Lee CY (1999) Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114: 420–429

    Article  Google Scholar 

  • Ng CT, Kovalyov MY (2004) An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Nav Res Log 51: 307–315

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hatem Hadda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hadda, H. An improved algorithm for the two machine flow shop problem with several availability constraints. 4OR-Q J Oper Res 8, 271–280 (2010). https://doi.org/10.1007/s10288-010-0119-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-010-0119-7

Keywords

MSC classification (2000)

Navigation