Citation
University Course Timetabling with Con?ict Minimization and Elective Courses. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 412-428, 2015.
Paper
Abstract
In this paper, we describe an integer programming approach to a real-life university timetabling case from Germany. Due to the special nature of the considered study program, a con?ict-free timetable usually does not exist. Therefore, we propose a model to minimize the number of con?icts. In addition, decomposition is used to split the problem into a model for compulsory courses and a model for elective courses. Both models incorporate various additional hard constraints, such as the need for consecutive slots or even for desired con?icts across di?erent semesters.
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-412-428-P, author = {E. Althaus and U. Muttray},
title = {University Course Timetabling with Con?ict Minimization and Elective Courses },
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 = {412--428},
note = {Paper},
abstract = { In this paper, we describe an integer programming approach to a real-life university timetabling case from Germany. Due to the special nature of the considered study program, a con?ict-free timetable usually does not exist. Therefore, we propose a model to minimize the number of con?icts. In addition, decomposition is used to split the problem into a model for compulsory courses and a model for elective courses. Both models incorporate various additional hard constraints, such as the need for consecutive slots or even for desired con?icts across di?erent semesters.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-412-428-P.pdf} }