Numerous methods have been proposed for solution of the simple assembly line balancing (SALB) problem. This paper describes a branch and bound algorithm which in many cases is faster than the well-known Hoffmann heuristic technique to which it is related. It introduces a simple bounding rule...

Assembly line balancing consists of assigning work elements, which are subject to sequencing restrictions, along an assembly line in an optimal manner. The procedure presented in this paper leads to optimal line balances by operation on a matrix of zeros and ones called a "Precedence Matrix." A...