Assembly line balancing problems consist in partitioning the work necessary to assemble a number of products among di erent stations of an assembly line. We present a hybrid approach for solving such problems, which combines constraint programming and integer programming.

We propose a stronger formulation of the precedence constraints and the station limits for the simple assembly line balancing problem. The linear relaxation of the improved integer program theoretically dominates all previous formulations using impulse variables, and produces solutions of significantly better quality in practice. The improved formulation can be used to strengthen related proble...

Assembly line balancing is the problem of assigning tasks to workstations by optimizing a performance measure while satisfying precedence relations between tasks and cycle time restrictions. Many exact, heuristic and metaheuristic approaches have been proposed for solving simple straight and U-shaped assembly line balancing problems. In this study, a quite new optimization algorithm, Bacterial ...