A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

Herbert G. Campbell, Richard A. Dudek and Milton L. Smith
Additional contact information
Herbert G. Campbell: Texas Tech University
Richard A. Dudek: Texas Tech University
Milton L. Smith: Texas Tech University

Management Science, 1970, vol. 16, issue 10, B630-B637

Abstract: This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m - 1 sequences may be found.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (106)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.10.B630 (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:16:y:1970:i:10:p:b630-b637

Access Statistics for this article

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