Development of M -Stage Decision Rule for Scheduling N Jobs Through M Machines

Richard A. Dudek and Ottis Foy Teuton
Additional contact information
Richard A. Dudek: Texas Technological College, Lubbock
Ottis Foy Teuton: Texas Technological College, Lubbock

Operations Research, 1964, vol. 12, issue 3, 471-497

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

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.3.471 (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:12:y:1964:i:3:p:471-497

Access Statistics for this article

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