SciELO - Scientific Electronic Library Online

 
vol.14 issue4Portuguese corpus-based learning using ETL author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

Share


Journal of the Brazilian Computer Society

Print version ISSN 0104-6500On-line version ISSN 1678-4804

Abstract

NASCIMENTO, Mariá C. V.  and  TOLEDO, Franklina M. B.. A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over. J. Braz. Comp. Soc. [online]. 2008, vol.14, n.4, pp.7-15. ISSN 1678-4804.  https://doi.org/10.1007/BF03192568.

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.

Keywords : GRASP; path relinking; lot sizing; multiplant; carry-over.

        · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License