Abstract
University course timetabling problems are combinatorial problems, which consist in scheduling a set of courses within a given number of rooms and time periods. Solving a real-world timetabling problem manually often requires a significant amount of time, sometimes several days or even weeks. Therefore, a lot of research has been invested in order to provide automated support for human timetablers. Contributions come from the fields of operations research (e.g., graph coloring, network flow techniques) and artificial intelligence (e.g., simulated annealing, tabu search, genetic algorithms, constraint satisfaction) [50].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Frühwirth, T., Abdennadher, S. (2003). University Course Timetabling. In: Essentials of Constraint Programming. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05138-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-05138-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08712-7
Online ISBN: 978-3-662-05138-2
eBook Packages: Springer Book Archive