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