An Algorithm for the Line Balancing Problem
- 1 November 1964
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 11 (2) , 308-315
- https://doi.org/10.1287/mnsc.11.2.308
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: