Dispatchability Conditions for Schedules with Consumable Resources

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. In the present work we show how the property of dispatchability can be extended to networks that include constraints for consumable resources. We describe conditions that can be placed on resource use by activities during execution to avoid oversubscription while insuring schedule dispatchability. This involves preventing interactions between resource use and scheduling per se, that can compromise dispatchability. We also describe strategies that can be used in conjunction with these conditions to increase flexibility of resource allocation. This work indicates that flexible handling of resource use can be safely extended to the execution layer to provide more effect...

• Type: Conference
• Year: 2000
• Where: ECAI
• Authors: Richard J. Wallace, Eugene C. Freuder
• Keywords: Artificial Intelligence, Consumable Resources, ECAI 2000, Simple Temporal Networks, Unfortunate Event-time Selections