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

Authors:
Leah Epstein;Jiřı Sgall
Affiliations:
Department of Computer Science, Tel-Aviv University, Israel;Mathematical Institute, AS CR, itná 25, CZ-11567 Praha 1, Czech Republic and Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic
Venue:
Operations Research Letters
Year:
2000

Citing 11
Cited 15

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

Journal of the ACM (JACM)
Better bounds for online scheduling

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters
Randomized online scheduling on two uniform machines

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
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
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Preemptive on-line scheduling for two uniform processors

Operations Research Letters
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters

Resource Augmentation in Load Balancing

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
2005: an offline persepctive

ACM SIGACT News
Preemptive online scheduling: optimal algorithms for all speeds

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Preemptive scheduling on a small number of hierarchical machines

Information and Computation
A Lower Bound for the On-Line Preemptive Machine Scheduling with lpNorm

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Optimal and online preemptive scheduling on uniformly related machines

Journal of Scheduling
Robust algorithms for preemptive scheduling

ESA'11 Proceedings of the 19th European conference on Algorithms
Preemptive Online Scheduling with Reordering

SIAM Journal on Discrete Mathematics
Preemptive semi-online scheduling on parallel machines with inexact partial information

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A lower bound on deterministic online algorithms for scheduling on related machines without preemption

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines

Operations Research Letters
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

Journal of Scheduling
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 consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.