We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Curriculum based course timetabling: new solutions to Udine benchmark instances.
- Authors
Lach, Gerald; Lübbecke, Marco
- Abstract
We present an integer programming approach to the university course timetabling problem, in which weekly lectures have to be scheduled and assigned to rooms. Students' curricula impose restrictions as to which courses may not be scheduled in parallel. Besides some hard constraints (no two courses in the same room at the same time, etc.), there are several soft constraints in practice which give a convenient structure to timetables; these should be met as well as possible. We report on solving benchmark instances from the literature and the 2nd International Timetabling Competition which are based on real data from the university of Udine. The first set is solved to proven optimality; for the second set we give solutions which on average compete well with or beat the previously best known solutions. Our algorithm is not an overall winner, but it is very robust in the sense that it deterministically gives satisfactory lower and upper bounds in reasonable computation time without particular tuning. For slightly larger instances from the literature our approach shows significant potential as it considerably beats previous benchmarks. We further present solutions of proven quality to a few much larger instances with more elaborate hard constraints.
- Subjects
EDUCATION benchmarking; CURRICULUM planning; TIME perspective; INTEGER programming; DECOMPOSITION method; UNIVERSITIES &; colleges
- Publication
Annals of Operations Research, 2012, Vol 194, Issue 1, p255
- ISSN
0254-5330
- Publication type
Article
- DOI
10.1007/s10479-010-0700-7