Hybrid methods for lot sizing on parallel machines
Nenhuma Miniatura disponível
Data
2015
Autores
Fiorotto, Diego Jacinto [UNESP]
Araujo, Silvio Alexandre de [UNESP]
Jans, Raf
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines, and apply Dantzig–Wolfe decomposition to a strong reformulation of the problem. Unlike in the traditional approach where the linking constraints are the capacity constraints, we use the flow constraints, i.e. the demand constraints, as linking constraints. The aim of this approach is to obtain high quality lower bounds. We solve the master problem applying two solution methods that combine Lagrangian relaxation and Dantzig–Wolfe decomposition in a hybrid form. A primal heuristic, based on transfers of production quantities, is used to generate feasible solutions. Computational experiments using data sets from the literature are presented and show that the hybrid methods produce lower bounds of excellent quality and competitive upper bounds, when compared with the bounds produced by other methods from the literature and by a high-performance MIP software.
Descrição
Palavras-chave
Lot sizing, Parallel machines, Reformulation, Hybrid methods, Dantzig–Wolfe decomposition, Lagrangian relaxation, Problema de dimensionamento de lotes, Relaxação lagrangiana, Geração de colunas
Como citar
Computers & Operations Research, v. 63, p. 136-148, 2015.