Skip to main content
SpringerLink
Log in

Real-life examination timetabling

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. http://www.unitime.org.

  2. http://www.cs.qub.ac.uk/itc2007.

  3. http://www.cpsolver.org.

  4. http://www.unitime.org/exam_dataformat.php.

  5. Since there are typically different courses offered in Spring and Fall, we usually consider only semesters of the same season for the average periods.

References

  • 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.

  • Carter, M. W., Laporte, G., & Lee, S. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society, 47(3), 373–383. doi:10.1057/jors.1996.37.

    Article  Google Scholar 

  • Dueck, G. (1993). New optimization heuristics: The great deluge algorithm and the record-to record travel. Journal of Computational Physics, 104, 86–92.

    Article  Google Scholar 

  • Gogos, C., Alefragis, P., & Housos, E. (2012). An improved multi-staged algorithmic process forthesolution of the examination timetabling problem. Annals of Operations Research, 194(1), 203–221. doi:10.1007/s10479-010-0712-3.

    Article  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).

  • McCollum, B., McMullan, P., Parkes, A. J., Burke, E. K., & Qu, R. (2012). A new model for automated examination timetabling. Annals of Operations Research, 194, 291–315. doi:10.1007/s10479-011-0997-x.

    Article  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. (2009). ITC 2007 solver description: A hybrid approach. Annals of Operations Research, 172, 429–446. doi:10.1007/s10479-009-0644-y.

    Article  Google Scholar 

  • Müller, T., & Murray, K. (2010). Comprehensive approach to student sectioning. Annals of Operations Research, 181, 249–269.

    Article  Google Scholar 

  • 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).

  • 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 

  • Qu, R., Burke, E., McCollum, B., Merlot, L., & Lee, S. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12, 55–89. doi:10.1007/s10951-008-0077-5.

    Article  Google Scholar 

  • Rudová, H., Müller, T., & Murray, K. (2011). Complex university course timetabling. Journal of Scheduling, 14(2), 187–207.

    Article  Google Scholar 

  • Sabar, N. R., Ayob, M., Qu, R., & Kendall, G. (2012). A graph coloring constructive hyper-heuristic for examination timetabling problems. Applied Intelligence, 37(1), 1–11.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Space Management and Academic Scheduling, Purdue University, 501 Northwestern Avenue, West Lafayette, IN, USA

    Tomáš Müller

Authors
  1. Tomáš Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomáš Müller.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Müller, T. Real-life examination timetabling. J Sched 19, 257–270 (2016). https://doi.org/10.1007/s10951-014-0391-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-014-0391-z

Keywords

Search

Navigation