Computational models for timetabling problem
MetadataShow full item record
The timetabling problem is to find a schedule of activities in space/time that satisfies a prescribed set of operational and resource constraints and which maximizes an objective function that reflects the value of the schedule. Constructing an effective timetable is always a challenging task for any scheduler. Most literature research focuses on specic applications and the resulting models are not easily applied to problems other than those for which they were designed for. In this paper, we construct a general model for university course timetabling. Our model incorporates a total of 17 different types of requirements identified in the literature as well as three new constraint types that we think should be part of the restrictions in a general university based timetabling model. An integer programming (IP) model is presented which incorporates restrictions that need to be satisfied and requests that are included in the objective function. We implement and test our models using the AIMMS mathematical software package. Computational results on a number of case studies are favorable and demonstrate the value of our approach.
Showing items related by title, author, creator and subject.
Aizam, Nur Aidya Hanum (2013)Timetabling is a table of information showing when certain events are scheduled to take place. Timetabling is in fact very essential in making sure that all events occur in the time and place required. It is critical in ...
Bradley, Matthew John (2010)Bus Rapid Transit (BRT) systems are increasingly used, particularly in the developing world, to provide low-cost, high-capacity urban mobility. An example of this trend is Bogotá’s TransMilenio BRT system, the test site ...
Tan, Terence; Tan, Tele; West, Geoff; Low, S. (2012)The timetabling problem is to find a timetable solution by assigning time and resources to sessions that satisfy a set of constraints. Traditionally, research has focused on optimization towards a final solution but this ...