Skip to main content
SpringerLink
Log in

Approximation results for the two-machine job shop under limited machine availability

  • Technical Note
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

This paper tackles the two-machine job shop scheduling problem with limited machine availability under the resumable scenario. We provide a number of characterizations for the optimal solution. We also develop polynomial-time approximation schemes for two particular configurations and identify a polynomially solvable case.

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

Fig. 1
Fig. 2

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  Google Scholar 

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

    Article  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  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco 8, 87–99 (1979)

    Google Scholar 

  5. Golmakani, H.R., Namazi, A.: An artificial immune algorithm for multiple-route job shop scheduling problem with preventive maintenance constraints. Int. J. Oper. Res. 19, 457–478 (2014)

    Article  Google Scholar 

  6. Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26, 36–52 (1978)

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. 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  Google Scholar 

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

    Article  Google Scholar 

  10. Hadda, H.: A PTAS for a particular case of the two-machine flow shop with limited machine availability. J. Math. Model. Algorithms Oper. Res. 13, 511–522 (2014)

    Article  Google Scholar 

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

  12. Hadda, H., Dridi, N., Hajri-Gabouj, S.: The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis. J. Math. Model. Algorithms Oper. Res. 13, 233–245 (2014)

    Article  Google Scholar 

  13. Jackson, J.R.: An extension of Johnson’s results on job lot scheduling. Res. Log. Q. 3, 201–203 (1956)

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. 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  Google Scholar 

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

    Article  Google Scholar 

  17. 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  Google Scholar 

  18. 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  Google Scholar 

  19. Ma, Y., Chu, C., Zuo, C.: A survey of scheduling with deterministic machine availability constraints. Comput. Ind. Eng. 58, 199–211 (2010)

    Article  Google Scholar 

  20. Mati, Y.: Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability. Comput. Ind. Eng. 59, 537–543 (2010)

    Article  Google Scholar 

  21. 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  Google Scholar 

  22. Sotskov, Y.N., Shakhlevich, N.V.: NP-hardness of shop-scheduling problems with three jobs. Discrete Appl. Math. 59, 237–266 (1995)

    Article  Google Scholar 

  23. Wang, S.A., Yu, J.B.: An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput. Ind. Eng. 59, 436–447 (2010)

    Article  Google Scholar 

  24. Williamson, D., Hall, L., Hoogeveen, J., Hurkens, C., Lenstra, J., Sevastianov, S., Shmoys, D.: Short shop schedules. Oper. Res. 45, 288–294 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Unité de recherche OASIS, Ecole Nationale d’Ingénieurs de Tunis, Université de Tunis El Manar, BP 37, Le belvédère, 1002, Tunis, 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

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hadda, H. Approximation results for the two-machine job shop under limited machine availability. OPSEARCH 54, 651–662 (2017). https://doi.org/10.1007/s12597-017-0298-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-017-0298-5

Keywords

Mathematics Subject Classification

Search

Navigation