A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem

This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m − 1 sequences may be found.