Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem

Niels-Christian Fink Bagger*, Guy Desaulniers, Jacques Desrosiers

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

29 Downloads (Pure)

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.
Original languageEnglish
JournalJournal of Scheduling
Volume22
Issue number2
Pages (from-to)155-172
Number of pages18
ISSN1094-6136
DOIs
Publication statusPublished - 2019

Keywords

  • Course timetabling
  • Integer programming
  • Preprocessing
  • Valid inequalities

Cite this

Bagger, Niels-Christian Fink ; Desaulniers, Guy ; Desrosiers, Jacques. / Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. In: Journal of Scheduling. 2019 ; Vol. 22, No. 2. pp. 155-172.
@article{12d63fe1b81141ddb5d332694f8d58bb,
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.",
keywords = "Course timetabling, Integer programming, Preprocessing, Valid inequalities",
author = "Bagger, {Niels-Christian Fink} and Guy Desaulniers and Jacques Desrosiers",
year = "2019",
doi = "10.1007/s10951-018-0582-0",
language = "English",
volume = "22",
pages = "155--172",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "2",

}

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 journalJournal articleResearchpeer-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 -