Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
Nenhuma Miniatura disponível
Data
2014-06-01
Autores
Fiorotto, Diego Jacinto [UNESP]
Araujo, Silvio Alexandre de [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Springer
Resumo
We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to develop a Lagrangian heuristic to obtain good solutions to this problem and good lower bounds to certify the quality of solutions. Based on a strong reformulation of the problem as a shortest path problem, the Lagrangian relaxation is applied to the demand constraints (flow constraint) and the relaxed problem is decomposed per period and per machine. The subgradient optimization method is used to update the Lagrangian multipliers. A primal heuristic, based on transfers of production, is designed to generate feasible solutions (upper bounds). Computational results using data from the literature are presented and show that our method is efficient, produces lower bounds of good quality and competitive upper bounds, when compared with the bounds produced by another method from the literature and by high-performance MIP software.
Descrição
Palavras-chave
Lot sizing, Parallel machines, Reformulations, Lagrangian heuristic
Como citar
Annals Of Operations Research. Dordrecht: Springer, v. 217, n. 1, p. 213-231, 2014.