DeepAI AI Chat
Log In Sign Up

Learning to Schedule

by   Dabeen Lee, et al.

This paper proposes a learning and scheduling algorithm to minimize the expected cumulative holding cost incurred by jobs, where statistical parameters defining their individual holding costs are unknown a priori. In each time slot, the server can process a job while receiving the realized random holding costs of the jobs remaining in the system. Our algorithm is a learning-based variant of the cμ rule for scheduling: it starts with a preemption period of fixed length which serves as a learning phase, and after accumulating enough data about individual jobs, it switches to nonpreemptive scheduling mode. The algorithm is designed to handle instances with large or small gaps in jobs' parameters and achieves near-optimal performance guarantees. The performance of our algorithm is captured by its regret, where the benchmark is the minimum possible cost attained when the statistical parameters of jobs are fully known. We prove upper bounds on the regret of our algorithm, and we derive a regret lower bound that is almost matching the proposed upper bounds. Our numerical results demonstrate the effectiveness of our algorithm and show that our theoretical regret analysis is nearly tight.


page 1

page 2

page 3

page 4


Near-Optimal Scheduling in the Congested Clique

This paper provides three nearly-optimal algorithms for scheduling t job...

Speed-Robust Scheduling

The speed-robust scheduling problem is a two-stage problem where given m...

Scheduling Servers with Stochastic Bilinear Rewards

In this paper we study a multi-class, multi-server queueing system with ...

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints

In this paper, we study an optimal online resource reservation problem i...

Prior-free Strategic Multiagent Scheduling with focus on Social Distancing

Motivated by the need for social distancing during a pandemic, we consid...

On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems

We study cost-sharing games in real-time scheduling systems where the ac...

Characterization of the Gittins index for sequential multistage jobs

The optimal scheduling problem in single-server queueing systems is a cl...