Proceedings IJCAI-03, Acapulco Mexico, August, 2003
Maximizing Flexibility: A Retraction Heuristic for Over-subscribed Scheduling Problems
Laurence A. Kramer and Stephen F. Smith
The Robotics Institute
Carnegie Mellon University
Pittsburgh, PA 15213, USA
Abstract
Maximizing Flexibility: A Retraction Heuristic for Over-subscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time frame than available resource capacity will allow, and hence decisions must be made about which tasks should be included in the schedule and which should be excluded. We adopt a controlled, iterative repair search approach, and focus on improving the results of an initial priority-driven solution generation procedure. Central to our approach is a new retraction heuristic, termed max-flexibility, which is responsible for identifying which tasks to (temporarily) retract from the schedule for reassignment in an effort to incorporate additional tasks into the schedule. The max-flexibility heuristic chooses those tasks that have maximum flexibility for assignment within their feasible windows. We empirically evaluate the performance of max-flexibility using problem data and the basic scheduling procedure from a fielded airlift mission scheduling application. We show that it produces comparable improvement results to two contention-based retraction heuristics, including a variant of min-conflicts (Minton et al. 1992), with significantly less search and computational cost.
Full paper in PDF format