A note on LPT scheduling

Authors:
John F Morrison
Affiliations:
Departments of Mathematics and Computer Science, Towson State University, Baltimore, MD 21204, USA
Venue:
Operations Research Letters
Year:
1988

Citing 2
Cited 1

Scheduling independent tasks on uniform processors

SIAM Journal on Computing
Operating Systems Theory

Operating Systems Theory

On performance analysis of hybrid algorithm (improved PSO with simulated annealing) with GA, PSO for multiprocessor job scheduling

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bound is given for the worst case performance of a variant of the LPT scheduling algorithm for independent jobs on a uniform set of non-identical processors. We show that if the jobs are selected by a processor as it becomes free then the ratio of this finish time to the optimal finish time is bounded by one half the relative speed of the fastest processor.