1. A.S. Asratian, D. de Werra, A generalized class-teacher model for some timtabling problems. Eur. J. Oper. Res.143, 531–542 (2002)

   Google Scholar 

2. A.S. Asratian, R.R. Kamalian, Interval colorings of edges of a multigraph (in Russian). Appl Math (also arXiv:1401.8079v1)5, 25–34 (1987)

   Google Scholar 

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

   Google Scholar 

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

   Google Scholar 

5. P. Brucker, A. Krämer, Schop scheduling with multiprocessor tasks on dedicated processors. Ann. Oper. Res.57, 13–27 (1995)

   Google Scholar 

6. E. Cole, K. Ost, S. Schirra, Edge-coloring Bipartite Multigraphs in\(O(E \log D)\). Combinatorica21, 5–12 (2001)

   Google Scholar 

7. D. de Werra, An introduction to timetabling. Eur. J. Oper. Res.19, 151–162 (1985)

   Google Scholar 

8. D. de Werra, A.S. Asratian, S. Durand, Complexity of some special types of timetabling problems. J. Sched.5, 171–183 (2002)

   Google Scholar 

9. D. de Werra, T. Kis, W. Kubiak, Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched.11, 75–83 (2008)

   Google Scholar 

10. S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicomodity flow problems. SIAM J. Comput.5, 691–703 (1976)

    Google Scholar 

11. H.N. Gabow, O. Kariv, Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput.11, 117–129 (1982)

    Google Scholar 

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

    Google Scholar 

13. C. Gotlieb, The construction of class-teacher time-tables, inProc. IFIP Congress 62, Munich (North-Holland, Amsterdam, 1963)

    Google Scholar 

14. O. Ittig, Scheduling with multiprocessors: a rounding network algorithm with a constant error. Master’s thesis, Memorial University of Newfoundland and EPFL, 2005

    Google Scholar 

15. T. Kis, D. de Werra, W. Kubiak, A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Oper. Res. Lett.38, 129–132 (2010)

    Google Scholar 

16. W. Kubiak, On a conjecture for the university timetabling problem. Discrete Appl. Math.299, 26–49 (2021)

    Google Scholar 

17. E.L. Lawler,Combinatorial Optimization. Networks and Matroids (Dover Publications, New York, 2001)

    Google Scholar 

18. A. Schrijver,Theory of Linear and Integer Programming (Wiley, London, 1999)

    Google Scholar 

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

    Google Scholar 

Download references