Citation
A New Integer Linear Programming Formulation to the Examination Timetabling Problem. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 345-355, 2013.
Paper
Abstract
This paper presents a new integer linear programming formulation to the Examination Timetabling Problem and its experimental evaluation. The Examination Timetabling Problem consists in to assign exams to timeslots and rooms in an examination session. Students are enrolled to take these exams, so that two exams taken by the same student cannot be assigned to the same timeslot. Nowadays, heuristic approaches are the most applied technique to handle this problem. Some mathematical programming formulations were also proposed, but they never were evaluated experimentally. A new formulation to the problem was developed in this work, aiming at to be more compact and to require less memory to be handled. The obtained results were encouraging: we were able to handle some instances of the Second International Timetabling Competition. To a set of smaller instances, we were able to prove optimality in two cases and produce low cost solutions to the remaining instances. These results points that, unlike what was thought, integer programming approaches are becoming a practical approach to handle this problem.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-345-355-P, author = {G. H.G. Fonseca and H. G. Santos},
title = {A New Integer Linear Programming Formulation to the Examination Timetabling Problem },
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {345--355},
note = {Paper},
abstract = { This paper presents a new integer linear programming formulation to the Examination Timetabling Problem and its experimental evaluation. The Examination Timetabling Problem consists in to assign exams to timeslots and rooms in an examination session. Students are enrolled to take these exams, so that two exams taken by the same student cannot be assigned to the same timeslot. Nowadays, heuristic approaches are the most applied technique to handle this problem. Some mathematical programming formulations were also proposed, but they never were evaluated experimentally. A new formulation to the problem was developed in this work, aiming at to be more compact and to require less memory to be handled. The obtained results were encouraging: we were able to handle some instances of the Second International Timetabling Competition. To a set of smaller instances, we were able to prove optimality in two cases and produce low cost solutions to the remaining instances. These results points that, unlike what was thought, integer programming approaches are becoming a practical approach to handle this problem.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-345-355-P.pdf} }