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.