Conference
Long-Run Stability in Dynamic Scheduling
Abstract
Stability analysis consists of identifying conditions under which the number of jobs in a system is guaranteed to remain bounded over time. To date, such long-run performance guarantees have not been available for periodic approaches to dynamic scheduling problems. However, stability has been extensively studied in queueing theory. In this paper, we introduce stability to the dynamic scheduling literature and demonstrate that stability …
Authors
Terekhov D; Tran T; Down D; Beck JC
Volume
22
Pagination
pp. 261-269
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
DOI
10.1609/icaps.v22i1.13524
Conference proceedings
Proceedings of the International Conference on Automated Planning and Scheduling
ISSN
2334-0843