nach oben

Journal of Scheduling

Erschienen in:

01.06.2016

Real-life examination timetabling

verfasst von: Tomáš Müller

Erschienen in: Journal of Scheduling | Ausgabe 3/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel Novel dual discounting functions for the Internet shopping optimization problem: new algorithms

Nächster Artikel The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

http://www.unitime.org.

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

http://www.cpsolver.org.

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

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

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

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

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

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

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

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

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.

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

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

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

Titel: Real-life examination timetabling
verfasst von: Tomáš Müller
Publikationsdatum: 01.06.2016
Verlag: Springer US
Erschienen in: Journal of Scheduling / Ausgabe 3/2016
Print ISSN: 1094-6136
Elektronische ISSN: 1099-1425
DOI: https://doi.org/10.1007/s10951-014-0391-z

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 3/2016

Novel dual discounting functions for the Internet shopping optimization problem: new algorithms

The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem

Line search method for solving a non-preemptive strictly periodic scheduling problem

An integer programming approach to the multimode resource-constrained multiproject scheduling problem

Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks

A complexity analysis and an algorithmic approach to student sectioning in existing timetables

Premium Partner