A Competitive Algorithm for Throughput Maximization on Identical Machines
Data Structures and Algorithms
2024-08-26 v2
Abstract
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on identical machines. The main result is an competitive deterministic algorithm for any number of machines .
Cite
@article{arxiv.2111.06564,
title = {A Competitive Algorithm for Throughput Maximization on Identical Machines},
author = {Benjamin Moseley and Kirk Pruhs and Clifford Stein and Rudy Zhou},
journal= {arXiv preprint arXiv:2111.06564},
year = {2024}
}