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 .

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 206; no. 1-2; pp. 497 - 514
Main Authors:	Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2024 Springer
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!