Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling
(2022) arXiv preprint — (2022)
Files
220400038v1.pdf
Open Access - Adobe PDF
- 812.3 KB
Details
- Authors
Ren, Wei 
- Abstract
- This paper studies optimal scheduling and resource allocation under allowable over-scheduling. Formulating an optimisation problem where over-scheduling is embedded, we derive an optimal solution that can be implemented by means of a new additive increase multiplicative decrease (AIMD) algorithm. After describing the AIMD-like scheduling mechanism as a switching system, we show convergence of the scheme, based on the joint spectral radius of symmetric matrices, and propose two methods for fitting an optimal AIMD tuning to the optimal solution derived. Finally, we demonstrate the overall optimal design strategy via an illustrative example.
- Affiliations
Citations
Ren, W., vlahakis, Athanasopoulos, N., & Jungers, R. (2022). Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling. arXiv preprint. Published. https://doi.org/10.48550/arXiv.2204.00038 (Original work published 2022)