An Algorithm for the Line Balancing Problem

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.

• 저널Management Science · 11(2) · 308–315
• 토픽Assembly Line Balancing Optimization · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.11.2.308
• 저자Allan L. Gutjahr, George L. Nemhauser