Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 678)


Creating timetables is a complex and recurring task at any university. Basically, the goal is to create a weekly schedule of the teaching activities by assigning lectures to rooms and time periods (timeslots). From the perspective of a computer scientist, it seems natural to formalize the task in terms of a computational problem so that timetables can be created in an automated fashion. In this work we will deal with formal computational problems related to course timetabling as well as the problem of formalizing the course timetabling task. One of our main topics occurring throughout this work will be the formalization of the quality of a timetable and how to measure it.


Timeslot Scheduler University Course Timetabling Problem (UCTP) Fair Course Reconfiguration Variant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [BGK+95]
    Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, Jr., W.R.: Designing and reporting on computational experiments with heuristic methods. J. Heuristics 1(1), 9–32 (1995)CrossRefGoogle Scholar
  2. [BLS00]
    Bergmann, R., Ludbrook, J., Spooren, W.P.J.M.: Different outcomes of the Wilcoxon-Mann-Whitney test from different statistics packages. Am. Stat. 54(1), 72–77 (2000)Google Scholar
  3. [Car01]
    Carter, M.W.: A comprehensive course timetabling and student scheduling system at the university of Waterloo. In: Selected Papers from the Third International Conference on Practice and Theory of Automated Timetabling III, PATAT ’00, pp. 64–84. Springer, London (2001)Google Scholar
  4. [Con06]
    Conover, W.J.: Practical Nonparametric Statistics. Wiley Series in Probability and Statistics, 3rd edn. Wiley, New York (2006)Google Scholar
  5. [CvdHJ08]
    Cereceda, L., van den Heuvel, J., Johnson, M.: Connectedness of the graph of vertex-colourings. Discrete Math. 308(5–6), 913–919 (2008). doi: 10.1016/j.disc.2007.07.028 CrossRefGoogle Scholar
  6. [DGMS07]
    Di Gaspero, L., McCollum, B., Schaerf, A.: The second international timetabling competition (ITC-2007): curriculum-based course timetabling (Track 3). In: Proceedings of the 1st International Workshop on Scheduling, a Scheduling Competition (SSC) (2007)Google Scholar
  7. [Die12]
    Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)Google Scholar
  8. [dW85]
    de Werra, D.: An introduction to timetabling. Eur. J. Oper. Res. 19(2), 151–162 (1985)CrossRefGoogle Scholar
  9. [HvdWZ06]
    Hothorn, T., Hornik, K., van de Wiel, M.A., Zeileis, A.: A lego system for conditional inference. Am. Stat. 60(3), 257–263 (2006)CrossRefGoogle Scholar
  10. [IDH+11]
    Ito, T., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12–14), 1054–1065 (2011)CrossRefGoogle Scholar
  11. [KGV83]
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)CrossRefGoogle Scholar
  12. [Lew06]
    Lewis, R.: Metaheuristics for university course timetabling. Ph.D. thesis, Napier University, Edinburgh (2006)Google Scholar
  13. [LH10]
    Lü, Z., Hao, J.-K.: Adaptive tabu search for course timetabling. Eur. J. Oper. Res. 200(1), 235–244 (2010). doi: 10.1016/j.ejor.2008.12.007 CrossRefGoogle Scholar
  14. [LL12]
    Lach, G., Lübbecke, M.E.: Curriculum based course timetabling: new solutions to Udine benchmark instances. Ann. Oper. Res. 194, 255–272 (2012). doi: 10.1007/s10479-010-0700-7 CrossRefGoogle Scholar
  15. [PS98]
    Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization; Algorithms and Complexity. Dover Publications, New York (1998)Google Scholar
  16. [R D08]
    R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna (2008). ISBN 3-900051-07-0Google Scholar
  17. [Wan06]
    Wanka, R.: Approximationsalgorithmen: Eine Einführung. Leitfäden der Informatik. B. G. Teubner GmbH (2006). doi: 10.1007/978-3-8351-9067-2 Google Scholar
  18. [Wil45]
    Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bull. 1(6), 80–83 (1945). doi: 10.2307/3001968 CrossRefGoogle Scholar
  19. [MW10b*]
    Mühlenthaler, M., Wanka, R.: A novel event insertion heuristic for finding feasible solutions of course timetabling problems. In: Proceedings of 8th International Conferene on the Practice and Theory of Automated Timetabling (PATAT), pp. 294–304 (2010)Google Scholar
  20. [MW12*]
    Mühlenthaler, M., Wanka, R.: Fairness in academic course timetabling. In: Proceedings of 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp. 114–130 (2012)Google Scholar
  21. [MW13*]
    Mühlenthaler, M., Wanka, R.: A decomposition of the max-min fair curriculum-based course timetabling problem. In: Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pp. 300–313 (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Dept. of Computer Science 12University of Erlangen-NurembergErlangenGermany

Personalised recommendations