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

摘要: In the event that big-sized complex products (containing a large number of assembly tasks most which have long task times) are produced in simple or two-sided lines, hundreds stations essentially required. Long product flow time, area for establishment line, high budget investment equipment, and tools several work-in-process also required these kinds products. order to avoid disadvantages, lines with parallel multi-manned workstations can be utilized. this paper, one their balancing problems addressed, branch bound algorithm is proposed. The composed branching scheme, some efficient dominance feasibility criteria based on problem-specific knowledge. A heuristic-based guidance enumeration process included as an component well. VWSolver proposed special version problem literature has been modified compared algorithm. Results show outperforms terms both CPU times quality feasible solutions found. Highlights? We considered line used modeling producing ? exact solution including components developed knowledge Through analysis comparison results, it seen better performance than other optimal solutions, solutions.