Timetabling problem for university as assignment of activities to resources

A mathematical programming approach is presented to solve the timetabling problem in a University. It includes two subproblems that are solved sequentially. Both subproblems have the same structure consisting of a 0–1 assignment problem of conflicting activities to resources. A solution method is derived for a relaxed version of an equivalent 0–1 quadratic assignment programming problem. The paper concludes with implementation remarks, numerical results and extensions.