Answers are grounded in this paper and cite their sources.
This paper gives a simple method for finding an optimal assignment of operations to work stations when the order of operations is specified. It is shown that the problem with a specific ordering can be formulated as an assignment problem or as a shortest-route problem for which an inspection-type solution is available. The more general problem, when it is possible to enumerate all feasible orderings of operations, can then be handled by repeating the required calculations for all such orderings.
No takes yet. Share an insight, caveat, or question.
Morton Klein (1963) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: