Skip to main content
SpringerLink
Log in

A PTAS for a Particular Case of the Two-machine Flow Shop with Limited Machine Availability

  • Published:
Journal of Mathematical Modelling and Algorithms in Operations Research

Abstract

In this paper we develop a polynomial-time approximation scheme for a particular case of the two-machine flow shop scheduling problem with several availability constraints on the second machine under the resumable scenario.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allaoui, H., Artiba, A.: Scheduling two-stage hybrid flow shop with availability constraints. Comput. Oper. Res. 33, 1399–1419 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Math. Oper. Res. 1, 117–129 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Hadda, H.: A \(\left (\frac {4}{3}\right )\)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints. Optim. Lett. 3, 583–592 (2009)

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Hadda, H.: A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints. Optim. Lett. 6, 559–569 (2011)

    Article  MathSciNet  Google Scholar 

  7. Hadda, H., Dridi, N., Hajri-Gabouj, S.: An improved heuristic for two-machine flow shop scheduling with an avilability constraint and nonresumable jobs. 4OR-Q. J. Oper. Res. 8, 87–99 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hadda, H., Dridi, N., Hajri-Gabouj, S.: The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis. J. Math. Model. Algoritm. Oper. Res. (2013). doi:10.1007/s10852-013-9235-7

    MATH  Google Scholar 

  9. Hoogeveen, J.A., Lenstra, J.K., Veltman, B.: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. Eur. J. Oper. Res. 89, 172–175 (1996)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  11. 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  MathSciNet  MATH  Google Scholar 

  12. 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  MathSciNet  MATH  Google Scholar 

  13. 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  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Ng, C.T., Kovalyov, M.Y.: An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Nav. Res. Log. 51, 307–315 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schuurman, P., Woeginger, G.J.: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci. 237, 105–122 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.AJ., Lenstra, J.K., Sevast’janov, S.V., Shmoys, D.B.: Short shop schedules. Oper. Res. 45, 288–294

Download references

Author information

Authors and Affiliations

  1. LISI, INSAT-Tunis, Centre Urbain Nord B.P. N676, 1080, 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 PTAS for a Particular Case of the Two-machine Flow Shop with Limited Machine Availability. J Math Model Algor 13, 511–522 (2014). https://doi.org/10.1007/s10852-013-9245-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-013-9245-5

Keywords

Mathematics Subject Classification (2010)

Search

Navigation