Extensions to the Heuristic Algorithm for University Timetables

An alternative method of data handling in the heuristic algorithm for University timetables is suggested and methods of including various constraints on the final solution are given. The extended algorithm includes the allocation of suitable rooms to lectures, the consideration of lecturers' preferences, dynamic allocation of a lecturer's free day, and the spreading of similar lectures over the week.