Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem

Research output: Research - peer-reviewJournal article – Annual report year: 2018

View graph of relations

In this paper, we propose an integer-programming relaxation for obtaining lower bounds for the curriculum-based course timetabling problem in which weekly assignments for courses to rooms and periods are considered. The model is a pattern formulation where a pattern is an assignment of a course into a set of periods on one day. Different preprocessing techniques are implemented to reduce the number of variables, and valid inequalities are derived and added to the model. The proposed model is tested on 21 real-world data instances. On 17 of these instances, the best known solutions have been proven optimal, and out of the remaining four, our model improves the lower bounds for three of them.
Original languageEnglish
JournalJournal of Scheduling
Number of pages18
ISSN1094-6136
DOIs
StateAccepted/In press - 2018
CitationsWeb of Science® Times Cited: No match on DOI

    Research areas

  • Course timetabling, Integer programming, Preprocessing, Valid inequalities
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 153125600