1. M.M. Ahmadian, M. Khatami, A. Salehipour, T.C.E. Cheng, Four decates of research on the open-shop scheduling problem to minimize makespan. Eur. J. Oper. Res. (2021).https://doi.org/10.1016/j.ejor.2021.03.026

2. E. Bampis, G.N. Rouskas, The scheduling and wavelength assignment problem in optical wdm networks. J. Lightwave Tech.20, 782–789 (2002)

   Article  Google Scholar 

3. 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, 2007)

   Google Scholar 

4. R.A. Brualdi, Notes on the Birkhoff algorithm for doubly stochastic matrices. Can. Math. Bull.25, 127–147 (1982)

   Article  Google Scholar 

5. R.A. Brualdi, P.M. Gibson, Convex polyhedra of doubly stochastic matrices: I. applications of permanent function. J. Comb. Theory A22, 194–230 (1977)

   Google Scholar 

6. P. Brucker,Scheduling Algorithms (Springer, 1995)

   Google Scholar 

7. C.-S. Chang, W.-J. Chen, H.-Y. Huang, On Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neumann, inSeventh International Workshop on Quality of Service (IEEE, 1999), pp. 79–86

   Google Scholar 

8. K. Chen, A. Singla, A. Singh, K. Ramachandran, L. Xu, Y. Zhang, X. Wen, Y. Chen, Osa: An optical switching architecture for data center networks with unprecedented flexibility. IEEE/ACM Trans. Netw.22, 498–511 (2014)

   Article  Google Scholar 

9. E.G. Coffman Jr., M.R. Garey, D.S. Johnson, A.S. LaPaugh, Scheduling file transfers. SIAM J. Comput.14, 744–780 (1985)

   Article  Google Scholar 

10. D. de Werra, A decomposition property of polyhedra. Mathematical Programming30, 261–266 (1984)

    Article  Google Scholar 

11. D. de Werra, Preemptive scheduling, linear programming and network flows. SIAM J. Alg. Disc. Meth.5, 11–20 (1984)

    Article  Google Scholar 

12. D. de Werra, On the two-phase method for preemptive scheduling. Eur. J. Oper. Res.37, 227–235 (1988)

    Article  Google Scholar 

13. D. de Werra, A note on SS/TDMA satellite communication. Linear Algebra Appl.135, 69–77 (1990)

    Article  Google Scholar 

14. D. de Werra, Almost nonpreemptive schedules. Ann. Oper. Res.26, 243–256 (1990)

    Article  Google Scholar 

15. D. de Werra, Extensions of coloring models for scheduling purposes. Eur. J. Oper. Res.92, 474–492 (1996)

    Article  Google Scholar 

16. D. de Werra, J. Erschler, Open shop with some additional constraints. Graphs Comb.12, 81–93 (1996)

    Article  Google Scholar 

17. D. de Werra, N.V.R. Mahadev, U. Peled, Edge chromatic scheduling with simultaneity constraints. SIAM J. Disc. Math., 631–641 (1993)

    Google Scholar 

18. M. Dell’Amico, S. Martello, Open shop, satellite communication and a theorem by Egerváry (1931). Oper. Res. Lett.18, 207–211 (1996)

    Article  Google Scholar 

19. A. Demers, S. Keshav, S. Shenkar, Analysis and symulation of a fair queueing algorithm. Internetworking Res. Exp.1, 3–26 (1990)

    Google Scholar 

20. M. Drozdowski, Scheduling multiprocessor tasks - an overview. Eur. J. Oper. Res.94, 215–230 (1996)

    Article  Google Scholar 

21. F. Dufossé, K. Kaya, I. Panagiotas, B. Uçar, Further notes on Birkhoff-von Neumann decompsition od doubly stochastic matrices. Linear Algebra Appl.554, 68–78 (2018)

    Article  Google Scholar 

22. F. Dufossé, B. Uçar, Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices. Linear Algebra Appl.479, 108–115 (2016)

    Article  Google Scholar 

23. H.K. Farahat, L. Mirsky, Permutation endomorphisis and refinment of a theorem of Birkhoff. Proc. Camb. Philos. Soc.56, 322–328 (1960)

    Article  Google Scholar 

24. R. Gandhi, M.M. Halldórsson, G. Kortsarz, H. Shachnai, Improved results for data migration and open shop scheduling. ACM Trans. Algorithms2, 116–129 (2006)

    Article  Google Scholar 

25. T. Gonzalez, Open shop scheduling, in eds. by Joseph Y-T. Leung,Handbook on Scheduling: Algorithms, Models, and Performance Analysis (Chapman and Hall/CRC, 2004), pp. 6–1 to 6–14

    Google Scholar 

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

    Article  Google Scholar 

27. T.F. Gonzalez, Complexity and approximations for multimessage multicasting. J. Par. Dist. Comput.55, 215–235 (1998)

    Article  Google Scholar 

28. T.F. Gonzalez, Simple algorithms for multimessage multicasting with forwarding. Algorithmica29, 511–533 (2001)

    Article  Google Scholar 

29. R.A. Horn, C.R. Johnson,Matrix Analysis, 2nd edn. (Cambridge University Press, 2013)

    Google Scholar 

30. T. Inukai, An efficient SS/TDMA time slot assignment algorithm. IEEE Trans. Commun.27, 1449–1455 (1979)

    Article  Google Scholar 

31. S. Khuller, Y. Kim, Y.C. Wan, Algorithms for data migrantion with cloning, inProc. of the 22nd ACM Symposium on Principles od Database Systems, pp. 27–36 (2003)

    Google Scholar 

32. W. Kubiak,Proportional Optimization and Fairness (Springer, 2009)

    Google Scholar 

33. J. Kulkarni, E. Lee, M. Singh, Minimum Birkhoff-von Neumann decomposition, inProc. 19th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 343–354, Waterloo, ON, Canada (2017)

    Google Scholar 

34. E.L. Lawler, J. Labetoulle, On preemptive scheduling on unrelated parallel processors by linear programming. J. ACM25, 612–619 (1978)

    Article  Google Scholar 

35. J.L. Lewandowski, C.L. Liu, SS/TDMA stellite communications with k-permutation switching modes. SIAM J. Alg. Disc. Meth.8, 519–534 (1987)

    Article  Google Scholar 

Download references