A competitive algorithm for throughput maximization on identical machines

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 .

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming Jg. 206; H. 1-2; S. 497 - 514
Hauptverfasser:	Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2024 Springer
Schlagworte:	Algorithms Business schools Calculus of Variations and Optimal Control; Optimization Combinatorics Computer science Full Length Paper Management science Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical 68W40 Scheduling Online algorithm 68W25 Competitive analysis
ISSN:	0025-5610, 1436-4646
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!