Metaheuristics for university course timetabling.

Lewis, Rhydian M R; Paechter, Ben; Rossi-Doria, Olivia

Abstract

In this chapter we consider the NP-complete problem of university
course timetabling. We note that it is often difficult to gain a deep understanding
of these sorts of problems due to the fact that so many different
types of constraints can ultimately be considered for inclusion in any particular
application. Consequently we conduct a detailed analysis of a
benchmark problem version that is slightly simplified, but also contains
many of the features that make these sorts of problems “hard”. We review a
number of the algorithms that have been proposed for this particular problem,
and also present a detailed description and analysis of an example algorithm
that we show is able to perform well across a range of benchmark
instances.

Citation

Lewis, R. M. R., Paechter, B., & Rossi-Doria, O. (2007). Metaheuristics for university course timetabling. In K. Dahal, K. Chen Tan, & P. Cowling (Eds.), Evolutionary Scheduling (237-272). Springer. https://doi.org/10.1007/978-3-540-48584-1_9

• Publication Date: Apr 25, 2007
• Deposit Date: Jul 22, 2008
• Peer Reviewed: Peer Reviewed
• Volume: 49
• Pages: 237-272
• Book Title: Evolutionary Scheduling
• ISBN: 978-3-540-48582-7
• DOI: https://doi.org/10.1007/978-3-540-48584-1_9
• Keywords: Metaheuristics; Timetabling
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/1767