Iteratlve Refinement Scheduling*


We present a heuristics-based approach to deep space mission scheduling which is modeled on the approach used by expert human schedulers in producing schedules for planetary encounters. New chronological evaluation techniques are used to focus the search by using information gained during the scheduling process to locate, classify, and resolve regions of conflict. Our approach is based on the assumption that during the construction of a schedule there exist several disjunct temporal regions where the demand for one resource type or a single temporal constraint dominates (bottleneck regions). If the scheduler can identify these regions and classify them based on their dominant constraint, then the scheduler can select the scheduling heuristic.

Extracted Key Phrases

Cite this paper

@inproceedings{Biefeld2002IteratlveRS, title={Iteratlve Refinement Scheduling*}, author={Eric Biefeld}, year={2002} }