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 .

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 206; číslo 1-2; s. 497 - 514
Hlavní autori:	Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2024 Springer
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!