Other formats:
BibTeX
LaTeX
RIS
@inproceedings{726098,
author = {Burke, Edmund K. and Mareček, Jakub and Parkes, Andrew J. and Rudová, Hana},
address = {Berlin},
booktitle = {Operations Research Proceedings 2007},
keywords = {integer programming; course timetabling; patterns},
language = {eng},
location = {Berlin},
isbn = {978-3-540-77902-5},
pages = {409-414},
publisher = {Springer},
title = {Penalising Patterns in Timetables: Novel Integer Programming Formulations},
url = {http://cs.nott.ac.uk/~jxm/papers/},
year = {2008}
}
TY - JOUR
ID - 726098
AU - Burke, Edmund K. - Mareček, Jakub - Parkes, Andrew J. - Rudová, Hana
PY - 2008
TI - Penalising Patterns in Timetables: Novel Integer Programming Formulations
PB - Springer
CY - Berlin
SN - 9783540779025
KW - integer programming
KW - course timetabling
KW - patterns
UR - http://cs.nott.ac.uk/~jxm/papers/
N2 - Many complex timetabling problems, such as university course timetabling and employee rostering, have an underpinning graph colouring component, a pattern penalisation component and a number of side constraints. In real-life settings, it might be relatively easy to come up with feasible solutions to instances of graph colouring, which correspond to hard constraints such as ``each student attends all events of courses of his choice and no student can be in two rooms at the same time'' even for hundreds of events and hundreds of distinct enrollments. Much more challenging are requirements such as ``students should not have gaps in their individual daily timetables'', which often make the problem over-constrained. On the example of the Udine Course Timetabling Problem, this paper studies several integer programming formulations of such pattern penalising constraints.
ER -
BURKE, Edmund K., Jakub MAREČEK, Andrew J. PARKES and Hana RUDOVÁ. Penalising Patterns in Timetables: Novel Integer Programming Formulations. In \textit{Operations Research Proceedings 2007}. Berlin: Springer, 2008, p.~409-414. ISBN~978-3-540-77902-5.
|
