A Geometric Model and a Graphical Algorithm for a Sequencing Problem

William W. Hardgrave and George L. Nemhauser
Additional contact information
William W. Hardgrave: Bell Telephone Laboratories, Inc., Holmdel, New Jersey
George L. Nemhauser: The Johns Hopkins University, Baltimore, Maryland

Operations Research, 1963, vol. 11, issue 6, 889-900

Abstract: A geometric model is given for the problem of scheduling N jobs on M machines so that the total time needed to complete the processing of all jobs is minimized. This model leads to a graphical algorithm, the essence of which is the determination of a shortest path between two nodes in a finite network. Particular attention is given to the case of 2 jobs for which the algorithm developed is simple and efficient. The theoretical analysis is then extended to the general case. Computational problems arise in the general case primarily because of the difficulty of constructing the network.

Date: 1963
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.11.6.889 (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:11:y:1963:i:6:p:889-900

Access Statistics for this article

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