The simple assembly line balancing problem (SALBP) considers work division among
different workstations of a serially arranged assembly process to maximise its efficiency
under workload (cumulative) and technological (precedence) constraints. In this work, we
consider a variant of the SALBP which allows parallel workstations. To study the effect of
parallel stations, we propose a new problem (the parallel station assembly line balancing
problem or PSALBP) in which the objective is to minimise the number of parallel stations …

This paper presents a dynamic programming (DP) algorithm for solving an assembly line-
balancing) ALB (problem with parallel workstations. Solutions represent a trade-off between
the minimum number of stations required to achieve a balance and the cost of installing
additional facilities. Both task costs and equipment costs are considered. A second feature of
the algorithm is that it takes into account unproductive time during a cycle. The advantage of
the DP approach is that it readily permits the recursive relationship associated with the serial …