Richard J. Wallace, 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. 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. 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 effective deployment of consumable resources.
Keywords: Scheduling, Real-time systems, Constraint satisfaction
Citation: Richard J. Wallace, Eugene C. Freuder: Dispatchability Conditions for Schedules with Consumable Resources . In W.Horn (ed.): ECAI2000, Proceedings of the 14th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2000, pp.536-539.