A Competitive Algorithm for Throughput Maximization on Identical Machines
Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
TL;DR
This paper introduces a deterministic online scheduling algorithm that guarantees a constant competitive ratio for maximizing job throughput with preemption on multiple identical machines.
Contribution
It presents the first $O(1)$ competitive deterministic algorithm for online preemptive scheduling on multiple identical machines.
Findings
Achieves constant competitive ratio for any number of machines
Applicable to online scheduling with preemption
Improves upon previous non-constant competitive algorithms
Abstract
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on identical machines. The main result is an competitive deterministic algorithm for any number of machines .
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Scheduling and Optimization Algorithms · Optimization and Packing Problems