iScheduler: Reinforcement Learning-Driven Continual Optimization for Large-Scale Resource Investment Problems

arXiv:2602.06064v2 Announce Type: replace-cross Abstract: Scheduling precedence-constrained tasks under shared renewable resources is critical to modern computing platforms. It is often modeled as the Resource Investment Problem (RIP) by minimizing the cost of provisioned renewable resources under precedence and timing constraints. Unfortunately, exact mixed-integer programming and constraint programming become impractically slow on large RIP instances, and dynamic updates require schedule revisions under tight latency budgets. To address this, we present iScheduler, a reinforcement-learning-driven iterative scheduling framework for large RIP. Specifically, it formulates RIP solving as a Markov decision process over decomposed subproblems and constructs schedules through sequential process selection. By doing this, the framework accelerates optimization and supports reconfiguration by reusing unchanged process schedules and rescheduling only affected processes. To evaluate this framework, we release L-RIPLIB, an industrial-scale benchmark derived from cloud-platform workloads with 1,000 instances of 2,500-10,000 tasks. Our experiments show that iScheduler attains competitive resource costs while reducing time to feasibility by up to 43$\times$ against leading solver-backed baselines.

Abstract:Scheduling precedence-constrained tasks under shared renewable resources is critical to modern computing platforms. It is often modeled as the Resource Investment Problem (RIP) by minimizing the cost of provisioned renewable resources under precedence and timing constraints. Unfortunately, exact mixed-integer programming and constraint programming become impractically slow on large RIP instances, and dynamic updates require schedule revisions under tight latency budgets. To address this, we present iScheduler, a reinforcement-learning-driven iterative scheduling framework for large RIP. Specifically, it formulates RIP solving as a Markov decision process over decomposed subproblems and constructs schedules through sequential process selection. By doing this, the framework accelerates optimization and supports reconfiguration by reusing unchanged process schedules and rescheduling only affected processes. To evaluate this framework, we release L-RIPLIB, an industrial-scale benchmark derived from cloud-platform workloads with 1,000 instances of 2,500-10,000 tasks. Our experiments show that iScheduler attains competitive resource costs while reducing time to feasibility by up to 43$\times$ against leading solver-backed baselines.

The article has been accepted by Frontiers of Computer Science (FCS), with the DOI: https://doi.org/10.1007/s11704-026-60177-w. 15 pages, 7 figures

Distributed, Parallel, and Cluster Computing (cs.DC); Artificial Intelligence (cs.AI)

arXiv:2602.06064 [cs.DC]

(or arXiv:2602.06064v2 [cs.DC] for this version)

https://doi.org/10.48550/arXiv.2602.06064 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1007/s11704-026-60177-w Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

analiza aiqbench

iScheduler: Reinforcement Learning-Driven Continual Optimization for Large-Scale Resource Investment Problems

Subiecte conexe