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

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.