Scheduling with chronology-directed search

Abstract

The intelligent use of scheduling heuristics can enable the production of effective schedules in spite of the inherent intractability of scheduling in complex, real-world domains. In order to effectively use these heuristics, information is needed on the current state of the evolving schedule. One method to obtain this information is to use chronologies - limited histories of the scheduling process. Chronology-directed search is an important component of the heuristic approach to automated scheduling.