An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations

► We considered assembly line balancing problems with parallel multi-manned workstations which can be used for modeling lines producing big-sized complex products. ► A branch and bound based exact solution algorithm including some efficient components which are developed based on problem-specific knowledge is proposed. ► Through an analysis of comparison results, it has been seen that the proposed algorithm has better performance than the other one in terms of CPU times of optimal solutions, and quality of feasible solutions.