Scheduling on identical machines: How good is LPT in an on-line setting?

Authors:
Bo Chen;Arjen P. A. Vestjens
Affiliations:
Warwick Business School, University of Warwick, Coventry CV4 7AL, UK;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands
Venue:
Operations Research Letters
Year:
1997

Citing 3
Cited 16

On-Line Scheduling of Real-Time Tasks

IEEE Transactions on Computers
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An optimal online algorithm for scheduling two machines with release times

Theoretical Computer Science
Scheduling Two Machines with Release Times

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On-line Scheduling for Jobs with Arbitrary Release Times

Computing
Competitive Analysis for the On-line Truck Transportation Problem

Journal of Global Optimization
Scheduling parallel jobs to minimize the makespan

Journal of Scheduling
Note: A best online algorithm for scheduling on two parallel batch machines

Theoretical Computer Science
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

Information Processing Letters
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Online k-server routing problems

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Optimal algorithms for online single machine scheduling with deteriorating jobs

Theoretical Computer Science
On-line scheduling with non-crossing constraints

Operations Research Letters
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

Theoretical Computer Science
Reactive scheduling in a job shop where jobs arrive over time

Computers and Industrial Engineering
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan

Information Processing Letters
Online LPT algorithms for parallel machines scheduling with a single server

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a parallel machine scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on m identical machines, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its processing time becomes known at its arrival. We deal with the problem of minimizing the makespan, which is the time by which all jobs have been finished. We propose and analyze the following on-line LPT algorithm: At any time a machine becomes availabe for processing, schedule an available job with the largest processing time. We prove that this algorithm has a performance guarantee of 32, and that this bound is tight. Furthermore, we show that any on-line algorithm will have a performance bound of at least 1.3473. This bound is improved to (5 - @/5)/2~1.3820 for m = 2.