Neighbourhood Search Metaheuristics for Capacitated Lotsizing with Sequence-dependent Setups

Bernardo Almada-Lobo (1) , Ross J.W. James (2)

1 Department of Mechanical Engineering and Industrial Management
2 Department of Management

We address a problem that often arises in industry, the multi-item capacitated-lotsizing and scheduling problem with sequence dependent setup times and costs. Powerful commercial solvers fail to solve even medium-sized instances of this NP-hard problem, therefore we employ a tabu search and a variable neighbourhood search metaheuristic to solve it and compare the performance of these metaheuristics over time. In contrast to the majority of the literature on this topic, the solution representation explicitly considers production quantities and setup variables, which enables us to develop fast search heurstics. A comprehensive set of computational experiments shows the effectiveness and efficiency of the proposed approaches in solving medium to large size problems.

Mots clés: Physical Sciences

Bernardo Almada-Lobo, Ross J.W. James. Neighbourhood Search Metaheuristics for Capacitated Lotsizing with Sequence-dependent Setups. International Journal of Production Research, 2009, 48 (03), pp.861-878. ⟨10.1080/00207540802446787⟩. ⟨hal-00547666⟩