Answers are grounded in this paper and cite their sources.
An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem. Arc lengths are such that it is sufficient to find any path from the origin to destination node containing a minimal number of arcs. Computational results are presented and the algorithm is compared with prior analytical methods of line balancing.
No takes yet. Share an insight, caveat, or question.
Gutjahr et al. (1964) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: