Extending Graham's result on scheduling to other heuristics

Authors:
Robert R. Goldberg;Jacob Shapiro
Affiliations:
Computer Science Department, Queens College, City University of New York, 65-30 Kissena Blvd., Flushing, NY 11367-0904, USA;Department of Statistics and CIS, Baruch College, Zicklin School of Business, 17 Lexington Avenue, New York, New York 10010, USA
Venue:
Operations Research Letters
Year:
2001

Citing 3
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Tighter bounds on a heuristic for a partition problem

Information Processing Letters
Approximation schemes for scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the off-line scheduling problem where a list of jobs must be scheduled on k-parallel processors. The heuristic of Graham is relaxed to create a class of algorithms which includes many well-known algorithms such as best fit, first fit, random fit and greedy. We show that Graham's upper bound of 43-1/3k for the competitive ratios under the C"m"a"x norm applies to all algorithms of this class.