On the MILP model for the U-shaped assembly line balancing problems
Optimization models for U-shaped assembly lines are investigated. A MILP model is investigated in detail and shown that it may find optimal solutions that are infeasible. Theoretical analysis of infeasibility is provided and a revised version of this model is given. The infeasibility of the solutions reported by the model on a large set of benchmark problems.
u-shaped assembly lines integer programming facilities planning and design