Richard J. Wallace and Eugene C. Freuder
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be made "dispatchable", i.e., executable incrementally in real time with guarantees against failure due to unfortunate event-time selections. These schedules can be built prior to execution by an automated Planner/ Scheduler based on the Heuristic Scheduling Testbed System (HSTS). the present work we show how the property of dispatchabflity can be extended to networks that include constraints for consumable resources. We first describe conditions under which a component of the network composed of resource constraints will support dispatchability. Then we show how a network can be produced during planning that supports dispatchabflity while allowing flexible resource use. This work indicates that flexible handling of consumable resources can be safely extended to the execution layer to provide more effective deployment of these resources.