Citation
A Case Study of an Integer Programming Model for Instructor Assignments and Scheduling Problem. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 267-275, 2007.
Paper
Abstract
We express an integer program formulation of the rostering problem academic departments face every semester. The goal is to model the real situation, with all the relevant exceptions and peculiar- ities and to optimize the instructor satisfaction level with their timetable. We introduce Preference Sets and Preference Pairs as the main abstraction on which the model is based. Abstraction that can be used to allow the subjective satisfaction level of instructors to be modeled satisfactorily. We describe an instance in some detail and comment on the surprisingly short solving time required by modern integer program solvers for a type of problem that, until recently, was considered too hard for this type of formulation. The Department of Mathematics and Statistics at Oakland University has adopted this formulation since 2006.
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{2007-267-275-P, author = {E. Cheng and S. Kruk},
title = {A Case Study of an Integer Programming Model for Instructor Assignments and Scheduling Problem},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {267--275},
note = {Paper},
abstract = {We express an integer program formulation of the rostering problem academic departments face every semester. The goal is to model the real situation, with all the relevant exceptions and peculiar- ities and to optimize the instructor satisfaction level with their timetable. We introduce Preference Sets and Preference Pairs as the main abstraction on which the model is based. Abstraction that can be used to allow the subjective satisfaction level of instructors to be modeled satisfactorily. We describe an instance in some detail and comment on the surprisingly short solving time required by modern integer program solvers for a type of problem that, until recently, was considered too hard for this type of formulation. The Department of Mathematics and Statistics at Oakland University has adopted this formulation since 2006.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-267-275-P.pdf} }