Online scheduling of parallel jobs on two machines is 2-competitive

Authors:
J. L. Hurink;J. J. Paulus
Affiliations:
University of Twente, P.O. box 217, 7500AE Enschede, The Netherlands;University of Twente, P.O. box 217, 7500AE Enschede, The Netherlands
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 9

Online computation and competitive analysis

Online computation and competitive analysis
Scheduling parallel jobs to minimize the makespan

Journal of Scheduling
On-line scheduling of parallel jobs in a list

Journal of Scheduling
On-line scheduling of parallel jobs on two machines

Journal of Discrete Algorithms

On-Line Multiple-Strip Packing

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Online algorithm for parallel job scheduling and strip packing

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Online multiple-strip packing

Theoretical Computer Science
Improved online algorithms for parallel job scheduling and strip packing

Theoretical Computer Science
Improved lower bound for online strip packing

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
SIGACT news online algorithms column 20: the power of harmony

ACM SIGACT News
On-line scheduling of multi-core processor tasks with virtualization

Operations Research Letters
A tight analysis of Brown-Baker-Katseff sequences for online strip packing

Journal of Combinatorial Optimization
The generalization of scheduling with machine cost

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider online scheduling of parallel jobs on parallel machines. For the problem with two machines and the objective of minimizing the makespan, we show that 2 is a tight lower bound on the competitive ratio. For the problem with m machines, we derive lower bounds using an ILP formulation.