1. Z. Adak, M.Ö. Arioğlu Akan, S. Bulkan, Multiprocessor open shop problem: literature review and future directions. J. Comb. Optim.40, 547–569 (2020)

   Article  Google Scholar 

2. I. Bárány, T. Fiala, Nearly optimum solution of multimachine scheduling problems (in Hungarian). Szigma15, 177–191 (1982)

   Google Scholar 

3. J.A. Bondy, U.S.R. Murty,Graph Theory with Applications (North-Holland Publishing Co., 1976)

   Google Scholar 

4. B. Chen, V.A. Strusevich, Worst-case analysis of heuristics for open shops with parallel machines. Eur. J. Oper. Res.70, 379–390 (1993)

   Article  Google Scholar 

5. Y. Chen, A. Zhang, G. Chen, J. Dong, Approximation algorithms for parallel open shop scheduling. Inf. Process. Lett.113, 220–224 (2013)

   Article  Google Scholar 

6. D. Dadush, B. Natura, L.A. Végh, Revisiting Tardos’ Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. arXiv:2009.04942v1, September 2020

   Google Scholar 

7. J. Dong, R. Jin, J. Hu, G. Lin, A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. J. Comb. Optim.37, 668–684 (2019)

   Article  Google Scholar 

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

   Article  Google Scholar 

9. K. Jansen, M. Sviridenko, Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problems, inLecture Notes in Computer Science 1770 (STACS 2000, 2000), pp. 455–465

   Google Scholar 

10. A. Kononov, M. Sviridenko, A linear time approximation scheme for makespan minimization in an open shop with release dates. O. R. Lett.30, 276–280 (2002)

    Article  Google Scholar 

11. E.L. Lawler, M.G. Luby, V.V. Vazirani, Scheduling open shops with parallel machines. Oper. Res. Lett.1, 161–164 (1982)

    Article  Google Scholar 

12. M.E. Matta, A genetic algorithm for the proportionate multiprocessor open shop. Comput. Oper. Res.36, 2601–2618 (2009)

    Article  Google Scholar 

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

    Article  Google Scholar 

14. M.E. Matta, S.S. Patterson, Evaluating multiple performance measures across several dimensions at a multi-facility outpatient center. Health Care Manag. Sci.10, 173–194 (2007)

    Article  Google Scholar 

15. R. McNaughton, Scheduling with deadlines and loss functions. Manag. Sci.6, 1–12 (1959)

    Article  Google Scholar 

16. B. Naderi, S.M.T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh, Scheduling open shops with parallel machines to minimize total completion time. J. Comput. Appl. Math.235, 1275–1287 (2011)

    Article  Google Scholar 

17. P. Schuurman, G.J. Woeginger, Approximation algorithms for multiprocessor open shop scheduling problem. Oper. Res. Lett.24, 157–163 (1999)

    Article  Google Scholar 

18. S.V. Sevastianow, G.J. Woeginger, Linear time approximation scheme for multiprocessor open shop problem. Discrete Appl. Math.114, 273–288 (2001)

    Article  Google Scholar 

19. É. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs. Opns. Res.34, 250–256 (1986)

    Article  Google Scholar 

20. G. Vairaktarakis, S. Sahni, Dual criteria preemptive open shop problems with minimum finish time. Naval Res. Logist.42, 103–121 (1995)

    Article  Google Scholar 

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

    Google Scholar 

22. P. Zhang, J.F. Bard, D.J. Morrice, K.M. Koenig, Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice units. IISE Trans.51(10), 1037–1060 (2019)

    Article  Google Scholar 

Download references