The problems of (1) scheduling students to classes, classes to time periods, and classes to rooms, and (2) examinations to time periods and rooms have been of continuing interest to researchers and university administrators for many years. Under the general heading of timetable construction, such problems have been recognized as difficult to solve by exact methods due to their large size, integer variable requirements, and debatable measures of effectiveness. They are NP-hard. Given student choices for classes, most universities have a heuristic scheme for giving students their choices of classes and sections so as to avoid (or minimize) time conflicts. But, as we all know, a student may not get his or her selection due to class size limits and the order in which the student requests were processed. (Rumor has it that my school processes honor students first, then athletes, then seniors, juniors, sophomores and freshman, with first-come, first-served in each group.)

The present paper presents a heuristic algorithm for the examination timetable. The authors’ algorithm appears to be an efficient one and has been able to produce feasible schedules that are then subject to administrative review and adjustment. The computer-based timetable procedure adds a great deal of flexibility to this difficult administrative task as it encompasses the totality of the problem and allows for quick and inexpensive analyses of proposed changes and parameter variations.