Modelling and solving the SALB-E problem

This paper deals with the so-called SALBP-E (simple assembly line balancing problem-efficiency) problem, which consists of maximising the efficiency of an assembly line (defined as the product of the number of stations by the cycle time) in the framework of the assumptions that characterise the SALB problems. We propose mixed integer linear programming models and heuristic procedures, based on a fix-and-relax approach, to solve them.