Bounds for the Optimal Scheduling of n Jobs on m Processors

W. L. Eastman, S. Even and I. M. Isaacs
Additional contact information
W. L. Eastman: Sperry Rand Research Center, Sudbury, Massachusetts
S. Even: Sperry Rand Research Center, Sudbury, Massachusetts
I. M. Isaacs: Sperry Rand Research Center, Sudbury, Massachusetts

Management Science, 1964, vol. 11, issue 2, 268-279

Abstract: The problem of scheduling n jobs on m identical processors has been introduced by R. McNaughton, but as yet no efficient algorithm has been found for determining an optimal sequencing of jobs. In this paper lower and upper bounds are given for the cost of an optimal schedule. Since the two bounds are not far apart, they may be helpful in practical scheduling problems. A procedure is described for obtaining a schedule which costs less than the given upper bound.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.2.268 (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:ormnsc:v:11:y:1964:i:2:p:268-279

Access Statistics for this article

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