A Competitive Algorithm for Throughout Maximization on Identical Machines

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou

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$.