A competitive algorithm for throughput maximization on identical machines

Download PDF
Open Webpage

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou

Published: 01 Jan 2024, Last Modified: 11 Jan 2025Math. Program. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O(1) competitive deterministic algorithm for any number of machines \(m >1\).