Scheduling Jobs with Stochastic Holding Costs
Dabeen Lee, Milan Vojnovic

TL;DR
This paper develops learning-based scheduling algorithms for jobs with unknown stochastic holding costs, achieving near-optimal performance by balancing exploration and exploitation in a complex multi-class setting.
Contribution
It introduces a novel $c$ rule scheduling approach that learns job costs and switches from preemptive to nonpreemptive scheduling, with theoretical regret guarantees.
Findings
Algorithms achieve near-optimal regret bounds.
Numerical results confirm the effectiveness of the proposed methods.
Regret lower bounds match the upper bounds closely.
Abstract
We study a single-server scheduling problem for the objective of minimizing the expected cumulative holding cost incurred by jobs, where parameters defining stochastic job holding costs are unknown to the scheduler. We consider a general setting allowing for different job classes, where jobs of the same class have statistically identical holding costs and service times, with an arbitrary number of jobs across classes. In each time step, the server can process a job and observes random holding costs of the jobs that are yet to be completed. We consider a learning-based rule scheduling which starts with a preemption period of fixed duration, serving as a learning phase, and having gathered data about jobs, it switches to nonpreemptive scheduling. Our algorithms are designed to handle instances with large and small gaps in mean job holding costs and achieve near-optimal performance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Optimization and Search Problems · Scheduling and Optimization Algorithms
Methodstravel james
