1. J. Błażewicz, W. Cellary, R. Słowiński, J. Wȩglarz,Scheduling Under Resource Constraints—Deterministic Models (J. C. Baltzer AG, Basel, Switzerland, 1986)

   Google Scholar 

2. J. Błażewicz, K. Ecker, E. Pesch, G. Schmidt, J. Wȩglarz,Handbook on Scheduling: From Theory to Applications. International Handbooks on Information Systems. (Springer, Berlin, 2007)

   Google Scholar 

3. J. Blazewicz, J.K. Lenstra, A.H.G. Rinnooy Kan, Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math.5, 11–24 (1983)

   Google Scholar 

4. P. Brucker,Scheduling Algorithms (Springer, Berlin, 1995)

   Google Scholar 

5. D. Cochand, D. de Werra, R. Słowiński, Preemptive scheduling with staircase and piecewise linear resource availability. Z. Opns. Res.33, 297–313 (1989)

   Google Scholar 

6. D. de Werra, Graph-theoretical models for preemptive scheduling, inAdvances in Project Scheduling, ed. by R. Słowiński, J. Wȩglarz (Elsevier, Amsterdam, 1989), pp. 171–185

   Google Scholar 

7. D. de Werra, J. Błażewicz, Some preemptive open shop problems with a renewable or a nonrenewable resources. Discrete Appl. Math.35, 205–219 (1992)

   Google Scholar 

8. D. de Werra, J. Błażewicz, Addendum: some preemptive open shop scheduling problems with a renewable or a nonrenewable resources. Discrete Appl. Math.35, 103–104 (1993)

   Google Scholar 

9. D. de Werra, J. Błażewicz, W. Kubiak, A preemptive open shop scheduling problem with one resource. Oper. Res. Letts.10, 9–15 (1991)

   Google Scholar 

10. T. Gonzalez, Open shop scheduling, inHandbook on Scheduling: Algorithms, Models, and Performance Analysis, ed. by J.Y.-T. Leung (Chapman and Hall/CRC, 2004), pp. 6-1–6-14

    Google Scholar 

11. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time. J. ACM23, 665–679 (1976)

    Google Scholar 

12. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discr. Math.5, 287–326 (1979)

    Google Scholar 

13. I.V. Gribkovskaia, C.-Y. Lee, V.A. Strusevich, D. de Werra, Three is easy, two is hard: open shop sum-bath scheduling problem refined. Oper. Res. Lett.34, 456–464 (2006)

    Google Scholar 

14. B. Jurisch, W. Kubiak, Two-machine open shops with renewable resources. Opns. Res.45, 544–552 (1997)

    Google Scholar 

15. W. Kubiak, C. Sriskandarajah, K. Zaras, A note on the complexity of openshop scheduling problems. INFOR29 (1991)

    Google Scholar 

16. M. Pinedo, L. Schrage, Stochastic shop scheduling: a survey, inDeterministic and Stochastic Scheduling, ed. by M.A.H. Dempster, J.K. Lenstra, A.H.G. Rinnooy Kan (Reidel: Dordrecht, 1982), pp. 181–196

    Google Scholar 

17. M.L. Pinedo,Scheduling: Theory, Algorithms, and Systems, 5th edn. (Springer, Berlin, 2016)

    Google Scholar 

18. D. Shabtay, M. Kaspi, Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function. Naval Res. Logist.53, 204–216 (2006)

    Google Scholar 

19. N.V. Shakhlevich, V.A. Strusevich, Two machine open shop scheduling problem to minimize an arbitrary regular penalty function. Eur. J. Oper. Res.70, 391–404 (1993)

    Google Scholar 

20. A.J. Soper, A cyclical search for the two machine flow shop and open shop to minimize finish time. J. Sched.18, 311–314 (2015)

    Google Scholar 

21. V.S. Tanaev, Y.N. Sotskov, V.A. Strusevich,Scheduling Theory: Multi-Stage Systems (Kluwer Academic Publishers, Dordrecht, 1994)

    Google Scholar 

22. N.E.H. Tellache, M. Boudhar, Open shop scheduling problems with conflict graphs. Discrete Appl. Math.227, 103–120 (2017)

    Google Scholar 

23. N.E.H. Tellache, M. Boudhar, F. Yalaoui, Two-machine open shop problem with agreement graph. Theor. Comput. Sci.796, 154 –169 (2019)

    Google Scholar 

24. M. van den Akker, H. Hoogeveen, G.J. Woeginger, The two-machine open shop problem: to fit or not to fit, that is the question. Oper. Res. Lett.31, 219–224 (2003)

    Google Scholar 

25. G.J. Woeginger, The open shop scheduling problem, in35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), ed. by R. Niedermeier, B. Vallée Leibniz. International Proceedings in Informatics (Dagstuhl Publishing, 2018), pp. 4:1–4:12

    Google Scholar 

Download references