Journal article
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
In this paper, we propose an integer-programming relaxation for obtaining lower bounds for the curriculum-based course timetabling problem in which weekly assignments for courses to rooms and periods are considered. The model is a pattern formulation where a pattern is an assignment of a course into a set of periods on one day.
Different preprocessing techniques are implemented to reduce the number of variables, and valid inequalities are derived and added to the model. The proposed model is tested on 21 real-world data instances. On 17 of these instances, the best known solutions have been proven optimal, and out of the remaining four, our model improves the lower bounds for three of them.
Language: | English |
---|---|
Publisher: | Springer US |
Year: | 2019 |
Pages: | 155-172 |
ISSN: | 10991425 and 10946136 |
Types: | Journal article |
DOI: | 10.1007/s10951-018-0582-0 |
ORCIDs: | Bagger, Niels-Christian Fink |