Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 200, Issue 3, Pages 747-754Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2009.01.047
Keywords
Lot sizing; Multi-plant; Parallel machines; GRASP; Path-relinking
Funding
- Funda dacao de Amparo A Pesquisa do Estado de Sao Paulo (FAPESP)
- Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq, Brazil)
Ask authors/readers for more resources
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available