Key points are not available for this paper at this time.
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.
Dudek et al. (Mon,) studied this question.