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.
No takes yet. Share an insight, caveat, or question.
Dudek et al. (1964) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: