Journal article

New integer linear programming approaches for course timetabling

Natashia Boland, Barry D Hughes, Liam TG Merlot, Peter J Stuckey

COMPUTERS & OPERATIONS RESEARCH | PERGAMON-ELSEVIER SCIENCE LTD | Published : 2008

Abstract

The most complete form of academic timetabling problem is the population and course timetabling problem. In this problem, there may be multiple classes of each subject, and the decision on which students are to constitute each class is made in concert with the decision on the timetable for each class. In order to solve this problem, it is normally simplified or decomposed in some fashion. One simplification commonly used in practice is known as blocking: it is assumed that the classes can be partitioned into sets of classes (or blocks) that will be timetabled in parallel. This restricts clashing to occur only between classes in the same block, and essentially removes the timetabling aspect o..

View full abstract