An examination timetabling problem at a large American university is presented. Although there are some important differences, the solution approach is based on the ITC 2007 winning solver which is integrated in the open source university timetabling system UniTime. In this work, nine real world benchmark data sets are made publicly available and the results on four of them are presented in this paper. A new approach to further decreasing the number of student conflicts by allowing some exams to be split into multiple examination periods is also studied.
KeywordsSoft Constraint Hard Constraint Hill Climbing Production Configuration Examination Period
- Bykov, Y., & Petrovic, S. (2013). An initial study of a novel step counting hill climbing heuristic applied to timetabling problems. In Proceedings of the 6th Multidisciplinary International Scheduling Conference: Theory & Applications (MISTA), Gent, Belgium.Google Scholar
- McCollum, B., McMullan, P., Parkes, A., Burke, E., & Abdullah, S. (2009). An extended great deluge approach to the examination timetabling problem. In Proceedings of the 4th Multidisciplinary International Scheduling: Theory and Applications 2009 (MISTA 2009) (pp. 424–434).Google Scholar
- Müller, T. (2005). Constraint-based timetabling. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics. http://muller.unitime.org/phd-thesis
- Müller, T., Rudová, H. (2012) Real-life curriculum-based timetabling. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling—PATAT 2012 (pp. 57–72).Google Scholar
- Müller, T., Barták, R., & Rudová, H. (2004). Conflict-based statistics. In J. Gottlieb, D. L. Silva, N. Musliu, & E. Soubeiga (Eds.), EU/ME Workshop on Design and Evaluation of Advanced Hybrid Meta-Heuristics. Nottingham: University of Nottingham.Google Scholar