Skip to main content
SpringerLink
Log in

On the complexity of proportionate open shop and job shop problems

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we present \(\mathcal{N}\mathcal{P}\)-hardness proofs and exhibit linear-time algorithms for proportionate two-machine open shop and job shop problems with respect to the maximum lateness, the makespan with release dates, the total weighted completion times and the number of just-in-time jobs.

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
Fig. 3
Fig. 4

References

  1. Azerine, A., Boudhar, M., Rebaine, D.: A two-machine no-wait flow shop problem with two competing agents. J. Comb. Optim. 43(1), 168–199 (2022)

    Article  MathSciNet  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to np-completeness. Freeman San Francisco (1979)

    Google Scholar 

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

    Article  Google Scholar 

  4. Koulamas, C., Kyparisis, G.J.: The three-machine proportionate open shop and mixed shop minimum makespan problems. Eur. J. Oper. Res. 243(1), 70–74 (2015)

    Article  MathSciNet  Google Scholar 

  5. Koulamas, C., Panwalkar, S.: The proportionate two-machine no-wait job shop scheduling problem. Eur. J. Oper. Res. 252(1), 131–135 (2016)

    Article  MathSciNet  Google Scholar 

  6. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.: Minimizing maximum lateness in a two-machine open shop. Math. Oper. Res. 6(1), 153–158 (1981)

    Article  MathSciNet  Google Scholar 

  7. Liaw, C.F.: Scheduling two-machine preemptive open shops to minimize total completion time. Comput. Oper. Res. 31(8), 1349–1363 (2004)

    Article  MathSciNet  Google Scholar 

  8. Liu, L., Chen, Y., Dong, J., Goebel, R., Lin, G., Luo, Y., Ni, G., Su, B., Xu, Y., Zhang, A.: Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803, 57–70 (2020)

    Article  MathSciNet  Google Scholar 

  9. Liu, L., Chen, Y., Dong, J., Goebel, R., Lin, G., Luo, Y., Ni, G., Su, B., Zhang, A.: Approximation algorithms for the three-machine proportionate mixed shop scheduling. arXiv preprint arXiv:1809.05745 (2018)

  10. Matta, M.E., Elmaghraby, S.E.: Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop. Eur. J. Oper. Res. 201(3), 720–728 (2010)

    Article  MathSciNet  Google Scholar 

  11. Mor, B., Mosheiov, G.: A note: minimizing maximum earliness on a proportionate flowshop. Inf. Process. Lett. 115(2), 253–255 (2015)

    Article  MathSciNet  Google Scholar 

  12. Naderi, B., Zandieh, M., Yazdani, M.: Polynomial time approximation algorithms for proportionate open-shop scheduling. Int. Trans. Oper. Res. 21(6), 1031–1044 (2014)

    Article  MathSciNet  Google Scholar 

  13. Ni, G., Chen, L.: Improved scheduling for the three-machine proportionate open shop and mixed shop minimum makespan problems. IEEE Access 8, 186805–186812 (2020)

    Article  Google Scholar 

  14. Ow, P.S.: Focused scheduling in proportionate flowshops. Manag. Sci. 31(7), 852–869 (1985)

    Article  Google Scholar 

  15. Panwalkar, S., Koulamas, C.: The two-machine no-wait general and proportionate open shop makespan problem. Eur. J. Oper. Res. 238(2), 471–475 (2014)

    Article  MathSciNet  Google Scholar 

  16. Pinedo, M.: Scheduling Theory: Algorithms and Systems (1995)

  17. Rachamadugu, R.M.V., Vepsalainen, A., Morton, T.E.: Scheduling in proportionate flowshops. CARNEGIE-MELLON UNIV PITTSBURGH PA ROBOTICS INST, Tech. rep. (1982)

  18. Sevast’yanov, S.V.: Some positive news on the proportionate open shop problem. Сибирские электронные математические известия 16, 406–426 (2019)

  19. Shabtay, D.: The just-in-time scheduling problem in a flow-shop scheduling system. Eur. J. Oper. Res. 216(3), 521–532 (2012)

    Article  MathSciNet  Google Scholar 

  20. Shakhlevich, N., Hoogeveen, H., Pinedo, M.: Minimizing total weighted completion time in a proportionate flow shop. J. Sched. 1(3), 157–168 (1998)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire RECITS, Faculté de Mathématiques, Université des Sciences et de la Technologie Houari Boumedienne, Alger, Algérie

    Abdennour Azerine & Mourad Boudhar

  2. Research Center on Scientific and Technical Information, CERIST, Algiers, Algeria

    Abdennour Azerine

  3. Département d’Informatique et de Mathématique, Université du Québec à Chicoutimi, Québec, Canada

    Djamal Rebaine

Authors
  1. Abdennour Azerine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mourad Boudhar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Djamal Rebaine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdennour Azerine.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Azerine, A., Boudhar, M. & Rebaine, D. On the complexity of proportionate open shop and job shop problems. Optim Lett 18, 365–375 (2024). https://doi.org/10.1007/s11590-023-02000-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-02000-0

Keywords

Search

Navigation