Modelling and solving the thesis defense timetabling problem
Michele Battistutta,
Sara Ceschia,
Fabio De Cesco,
Luca Di Gaspero and
Andrea Schaerf
Journal of the Operational Research Society, 2019, vol. 70, issue 7, 1039-1050
Abstract:
The thesis defense timetabling problem consists in composing the suitable committee for a set of defense sessions and assigning each graduation candidate to one of the sessions.In this work, we define the problem formulation that applies to some Italian universities and we provide three alternative solution methods, based on Integer Programming, Constraint Programming and Local Search, respectively. We also develop a principled instance generator, in order to expand the set of available instances.We perform an experimental analysis and we compare our solvers among themselves, using a testbed composed of both real-world and artificial instances. Even though there is no dominant method, the outcome is that Integer Programming gives the best average results, with Local Search being second, and Constraint Programming last on our testbed. All data is available on the web for verification and future comparisons.
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2018.1495870 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:70:y:2019:i:7:p:1039-1050
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20
DOI: 10.1080/01605682.2018.1495870
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald
More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().