Performance Guarantees for Scheduling Algorithms

M. R. Garey, R. L. Graham and D. S. Johnson
Additional contact information
M. R. Garey: Bell Laboratories, Murray Hill, New Jersey
R. L. Graham: Bell Laboratories, Murray Hill, New Jersey
D. S. Johnson: Bell Laboratories, Murray Hill, New Jersey

Operations Research, 1978, vol. 26, issue 1, 3-21

Abstract: One approach to coping with the apparent difficulty of many schedule-optimization problems, such as occur in machine shops and computer processing, is to devise efficient algorithms that find schedules guaranteed to be “near-optimal.” This paper presents an introduction to this approach by describing its application to a well-known multiprocessor scheduling model and illustrating the variety of algorithms and results that are possible. The paper concludes with a brief survey of what has been accomplished to date in the area of scheduling using this approach.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.3 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:1:p:3-21

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().