Rights statement: This is the author’s review version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 53, 2015 DOI: 10.1016/j.cor.2014.07.012
Submitted manuscript, 336 KB, PDF document
Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Integer programming methods for large-scale practical classroom assignment problems
AU - Philips, Antony E.
AU - Waterer, Hamish
AU - Ehrgott, Matthias
AU - Ryan, David M.
N1 - This is the author’s review version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 53, 2015 DOI: 10.1016/j.cor.2014.07.012
PY - 2015/1
Y1 - 2015/1
N2 - In this paper we present an integer programming method for solving the Classroom Assignment Problem in University Course Timetabling. We introduce a novel formulation of the problem which generalises existing models and maintains tractability even for large instances. The model is validated through computational results based on our experiences at the University of Auckland, and on instances from the 2007 International Timetabling Competition. We also expand upon existing results into the computational difficulty of room assignment problems.
AB - In this paper we present an integer programming method for solving the Classroom Assignment Problem in University Course Timetabling. We introduce a novel formulation of the problem which generalises existing models and maintains tractability even for large instances. The model is validated through computational results based on our experiences at the University of Auckland, and on instances from the 2007 International Timetabling Competition. We also expand upon existing results into the computational difficulty of room assignment problems.
KW - University course timetabling
KW - Classroom assignment
KW - Integer programming
KW - Lexicograhic optimisation
U2 - 10.1016/j.cor.2014.07.012
DO - 10.1016/j.cor.2014.07.012
M3 - Journal article
VL - 53
SP - 42
EP - 53
JO - Computers and Operations Research
JF - Computers and Operations Research
SN - 0305-0548
ER -