A General Algorithm for Solution of the n -Job, M -Machine Sequencing Problem of the Flow Shop

Richard D. Smith and Richard A. Dudek
Additional contact information
Richard D. Smith: Texas Technological College, Lubbock, Texas
Richard A. Dudek: Texas Technological College, Lubbock, Texas

Operations Research, 1967, vol. 15, issue 1, 71-82

Abstract: This paper describes an algorithm that will yield the minimum make-span sequence for n -jobs requiring processing through M -machines when no passing is allowed. Theoretical development utilizing combinatorial analysis and proof of sequence optimality precedes the algorithm and an example problem.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.1.71 (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:15:y:1967:i:1:p:71-82

Access Statistics for this article

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