Citation
Scheduling a conference to minimize attendee preference Conflicts. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 379-392, 2015.
Paper
Abstract
This paper describes a conference scheduling (or timetabling) problem where, at the time of registration, participants indicate preferences for events within the conference that they would like to attend. Based upon these preferences, an assignment of events to rooms and time slots should be determined that minimizes the number of attendee preference con?icts and satis?es a number of hard constraints. Ideally the schedule should be constructed so that for most, or all, participants the events that they would like to attend are assigned to different time slots. We show that our problem, and several variants of it, are NP-hard.Anintegerprogrammingmodel isdevelopedto solvetheproblem andacomputationalstudyofthismodelisperformedoninstancesgeneratedfromrealdata.Improvements to the model, including a symmetry breaking reformulation and a dualization of some hard constraints,areshowntosigni?cantlyimprovesolutiontimes,makingtheproblemtractable for the desired real world application.
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-379-392-P, author = {J. Quesnelle and D. Steffy},
title = {Scheduling a conference to minimize attendee preference Conflicts},
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 = {379--392},
note = {Paper},
abstract = {This paper describes a conference scheduling (or timetabling) problem where, at the time of registration, participants indicate preferences for events within the conference that they would like to attend. Based upon these preferences, an assignment of events to rooms and time slots should be determined that minimizes the number of attendee preference con?icts and satis?es a number of hard constraints. Ideally the schedule should be constructed so that for most, or all, participants the events that they would like to attend are assigned to different time slots. We show that our problem, and several variants of it, are NP-hard.Anintegerprogrammingmodel isdevelopedto solvetheproblem andacomputationalstudyofthismodelisperformedoninstancesgeneratedfromrealdata.Improvements to the model, including a symmetry breaking reformulation and a dualization of some hard constraints,areshowntosigni?cantlyimprovesolutiontimes,makingtheproblemtractable for the desired real world application.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-379-392-P.pdf} }