A timetabling problem: constraint and mathematical programming approaches

Abstract

Constraint programming is a relatively new approach far solving combinatorial optimization problems. This approach is especially effective far large scale scheduling problems with side conditions. University course scheduling problem is one of the hard problems in combinatorial optimization. Furthermore, the specific requirements of each institution make it very difficult to suggest a generalized model and a solution algorithm far this problem. The purpose of this study is to design a system far scheduling courses at Bilkent University. This system utilizes both constraint programming and mathematical programming techniques. The problem is solved in three stages. The first two stages, in tandem, generate a course schedule using constraint programming techniques, and in the last stage classrooms are assigned to courses by means of a mixed integer programming model. The proposed system is validated by experimental runs using Bilkent University course offerings and classroom data from past semesters.