Skip to main content
SpringerLink
Log in

A \({(\frac 4 3) -}\) approximation algorithm for a special case of the two machine flow shop problem with several availability constraints

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Breit J.: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf. Process. Lett. 90, 273–278 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Article  MATH  MathSciNet  Google Scholar 

  3. 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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng T.C.E., Wang G.: Two-machine flow shop scheduling with consecutive availability constraints. Inf. Process. Lett. 71, 49–54 (1999)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  6. 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)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Article  MATH  Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lee C.Y.: Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114, 420–429 (1999)

    Article  MATH  Google Scholar 

  10. 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)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Unité de Recherche URAII, INSAT-TUNIS, Centre Urbain Nord, B.P. No 676, Tunis Cedex, Tunisia

    Hatem Hadda

Authors
  1. Hatem Hadda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hatem Hadda.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0137-6

Keywords

Search

Navigation