Tabu search heuristics for resource scheduling with course scheduling applications
Abstract
Scheduling problems are often modeled as resource constrained problems in which critical resource assignments to tasks are known and the best assignment of resource time must be made subject to these constraints. Generalization to resource scheduling, where resource assignments are chosen concurrently with times results in a problem which is much more difficult. The general resource scheduling model may be simplified by restricting assignments to a single primary resource, subject to constraints resulting from preassignment of secondary, or auxiliary, resources. The purpose of this research was to explore solution heuristics for the special case of the resource scheduling problem described above. The class of problems was further restricted to those where it is reasonable to enumerate both feasible time and primary resource assignments. Potential applications include shift oriented production and manpower scheduling problems as well as course scheduling where classrooms (instructors) are primary and instructors (rooms) and students are secondary resources.. Extensions and enhancements to Tabu Search methodology are presented here and demonstrated for a new formulation of the university classroom scheduling problem. The underlying model is a type of quadratic multiple choice problem which we call multiple choice quadratic vertex packing (MCQVP). Results for strategic oscillation and biased candidate sampling strategies are shown for reasonable sized real and randomly generated, synthetic, problem instances. These strategies are compared with other variations using consistent measures of solution time and quality developed for this study. Application in the context of CHRONOS, a prototype modular computerized course scheduling support system is also documented. Several common constraints on the relations between the meetings for a course section are combinatorialized using (possibly overlapping) time patterns. The MCQVP model then represents the classroom scheduling problem as one of assigning rooms and time patterns to course sections subject to constraints resulting from instructor and student assignments. Pure timetabling and room assignment, the two most widely studied course scheduling problems, are special cases of this room scheduling formulation.
Degree
Ph.D.
Advisors
Rardin, Purdue University.
Subject Area
Industrial engineering
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.