Paper Info
Title
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
Abstract
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.
Year
DOI
Venue
2019
10.1007/s10951-018-0582-0
Journal of Scheduling
Keywords
Field
DocType
Course timetabling, Integer programming, Preprocessing, Valid inequalities
Mathematical optimization,Computer science,Preprocessor,Curriculum,Inequality,Integer programming,Timetabling problem
Journal
Volume
Issue
ISSN
22.0
2
1099-1425
Citations 
PageRank 
References 
2
0.40
17
Authors
4
Name
Order
Citations
PageRank
Niels-Christian Fink Bagger120.40
Guy Desaulniers287462.90
Guy Desaulniers387462.90
Jacques Desrosiers41800204.60