Abstract
| Original language | English |
|---|---|
| Journal | Journal of Scheduling |
| Volume | 22 |
| Issue number | 2 |
| Pages (from-to) | 155-172 |
| Number of pages | 18 |
| ISSN | 1094-6136 |
| DOIs | |
| Publication status | Published - 2019 |
Keywords
- Course timetabling
- Integer programming
- Preprocessing
- Valid inequalities
Cite this
}
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. / Bagger, Niels-Christian Fink; Desaulniers, Guy; Desrosiers, Jacques.
In: Journal of Scheduling, Vol. 22, No. 2, 2019, p. 155-172.Research output: Contribution to journal › Journal article › Research › peer-review
TY - JOUR
T1 - Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
AU - Bagger, Niels-Christian Fink
AU - Desaulniers, Guy
AU - Desrosiers, Jacques
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
KW - Course timetabling
KW - Integer programming
KW - Preprocessing
KW - Valid inequalities
U2 - 10.1007/s10951-018-0582-0
DO - 10.1007/s10951-018-0582-0
M3 - Journal article
VL - 22
SP - 155
EP - 172
JO - Journal of Scheduling
JF - Journal of Scheduling
SN - 1094-6136
IS - 2
ER -