A heuristic approach to scheduling university timetables

Abstract

This paper describes a heuristic approach to the university timetabling problem. The approach can satisfy complex conditions such as pre-assignment of classes, provision of lunch and dinner breaks, reservation or blocking of certain periods and some other requirements. The approach starts with a blank timetable in which classes are allocated into the timetable according to various criteria, the criteria themselves changing with the situation. A good heuristic solution to the problem can be obtained after a few trials. The method can be used to construct an integrated timetable for a number of academic departments. This would result in better resource utilization and provide a means for further resource development studies. The limitations of the system and ideas for its further enhancement are also discussed. © 1986.