Running summarizing tools on a new article
Check the paper below, then start its synthesis.
A Competitive Algorithm for Throughout Maximization on Identical Machines
Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
arXiv: 2111.06564v1 (cs.DS)
License: CC BY-NC-ND 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$.
Submitted to arXiv on 12 Nov. 2021