Worst-case analysis of a scheduling algorithm

Authors:
Jeremy Spinrad
Affiliations:
School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA 30332, USA
Venue:
Operations Research Letters
Year:
1985

Citing 5
Cited 1

Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Unrelated parallel machine scheduling using local search

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note, a heuristic proposed by Ibarra and Kim (IK) for scheduling independent tasks on unrelated processors is analyzed. The heuristic may create a schedule which finishes a time m * OPT, where m is the number of processors, and OPT is the time used in the optimal schedule. This compares unfavorably with the heuristics described by Davis and Jaffe [2], which have worst-case behavior which is O(OPT * m^0^.^5).