Answers are grounded in this paper and cite their sources.
A multiproduct assembly line-balancing problem is presented. The problem is formulated as a linear integer programming problem for which zero-one programming is applicable. A reformulation based on finding the shortest route in a finite direct network is developed, and an example problem is solved. Directions for future research is indicated.
No takes yet. Share an insight, caveat, or question.
Roberts et al. (1970) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: