Reconfigurable transfer line balancing problem: A new MIP approach and approximation hybrid algorithm

International audienceWe consider the problem of balancing reconfigurable transfer lines. The problem is quite recent and motivated by the growing need of reconfigurability in the new INDUSTRY 4.0 context. The problem consists into allocating different tasks necessary to machine a single part to different workstations placed into a serial line. The workstations can contain multiple machines operating in parallel and the tasks allocated to a workstation should be sequenced since the machines considered are mono-spindle head CNC machines and setup times between operations are needed to perform tool changes. Besides precedence constraints between operations are considered. In this article we suggested a new MIP approach based on formulation presented by Andrés et al.(2008) for a resembling problem. We suggest effective pre-processing procedures and a new lower bound. We besides suggest a novel hybrid approach that approximate the optimal solution when the setup times are bounded by the completion times. Experimentation are performed on benchmark instances and the methods are compared with those suggested in the literature