A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
A Competitive Algorithm for Throughout Maximization on Identical Machines
[article]
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