A lower bound on deterministic online algorithms for scheduling on related machines without preemption

Authors:
Tomáš Ebenlendr;Jiří Sgall
Affiliations:
Institute of Mathematics, AS CR, Praha 1, Czech Republic;Dept. of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha 1, Czech Republic
Venue:
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Year:
2011

Citing 6
Cited 2

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
On-line load balancing for related machines

Journal of Algorithms
On-line Load Balancing for Related Machines

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
On-line Load Balancing

Developments from a June 1996 seminar on Online algorithms: the state of the art
Preemptive Online Scheduling: Optimal Algorithms for All Speeds

Algorithmica
A lower bound for on-line scheduling on uniformly related machines

Operations Research Letters

On-Line scheduling of parallel jobs in heterogeneous multiple clusters

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Lower bounds for online makespan minimization on a small number of related machines

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). Previous lower bound was 2.438 by Berman et al. We use an analytical bound on maximal frequency of scheduling jobs instead of the combinatorial bound obtained by computer based search through the graph of possible states of an algorithm in the previous work.