Citation
Thesis Defense Timetabling. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 507-514, 2015.
Paper
Abstract
The thesis defense timetabling problem consists in composing the suitable committee for a set of graduation sessions and assigning each candidate to one of the sessions. In this work, we de?ne the problem formulation that applies to some Italian universities, and we provide two solution methods based on local search and constraint satisfaction, respectively. In addition, we perform an experimental analysis and comparison on both real-world and arti?cial instances.
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{2015-507-514-P, author = {M. Battistutta and S. Ceschia and F. De Cesco and A. Schaerf},
title = {Thesis Defense Timetabling},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {507--514},
note = {Paper},
abstract = {The thesis defense timetabling problem consists in composing the suitable committee for a set of graduation sessions and assigning each candidate to one of the sessions. In this work, we de?ne the problem formulation that applies to some Italian universities, and we provide two solution methods based on local search and constraint satisfaction, respectively. In addition, we perform an experimental analysis and comparison on both real-world and arti?cial instances.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-507-514-P.pdf} }