A Competitive Algorithm for Throughout Maximization on Identical Machines [article]

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
2021 arXiv   pre-print
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.
arXiv:2111.06564v1 fatcat:bssusxohgjdsfos4fm275vqfw4