A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
Published Online:1 Feb 1967https://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.
