Open Access

A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

  • Mariá C. V. Nascimento1 and
  • Franklina M. B. Toledo1
Journal of the Brazilian Computer Society14:BF03192568

Received: 29 January 2008

Accepted: 26 August 2008


This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.


GRASPpath relinkinglot sizingmultiplantcarry-over