%0 Journal Article
%T A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over
%A Nascimento
%A Mari¨¢ C. V.
%A Toledo
%A Franklina M. B.
%J Journal of the Brazilian Computer Society
%D 2008
%I Springer
%R 10.1007/BF03192568
%X 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.
%K grasp
%K path relinking
%K lot sizing
%K multiplant
%K carry-over.
%U http://www.scielo.br/scielo.php?script=sci_abstract&pid=S0104-65002008000400002&lng=en&nrm=iso&tlng=en