Exécution de notre outil de synthèse sur un nouvel article

Vérifiez l’article ci-dessous, puis lancez sa synthèse.


A Competitive Algorithm for Throughput Maximization on Identical Machines

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou

Licence : CC BY-NC-ND 4.0

Résumé : 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$.

Soumis à arXiv le 23 Aoû. 2024