A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
- 1 February 1967
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 15 (1) , 71-82
- https://doi.org/10.1287/opre.15.1.71
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.Keywords
This publication has 0 references indexed in Scilit: