Modelo de PLEM mejorado para el Accessibility Windows Assembly Line Balancing Problem (AWALBP)

Abstract

The Accessibility Windows Assembly Line Balancing Prob-lem (AWALBP) occurs in those assembly lines where the length of the workpiec-es is large relative to the width of the workstations. As a result, each workstation can only access to the limited portion of workpiece(s) that is inside its accessibil-ity window. In previous works we proposed a mixed-integer linear programming (MILP) model and a heuristic decomposition approach to solve AWALBP. Com-putational results revealed the size limits of the instances that could be solved. In this work, we provide an enhanced MILP model using reformulations and addi-tional bound contraints, which significantly improves the percentage of the in-stances optimally solved.