Abstract
This note shows that the assignment and sequencing of single-operation jobs in a parallel-machine environment can be formulated as an assignment problem. Means for reducing the size and computational difficulty of this problem are identified.

This publication has 0 references indexed in Scilit: