Autor(es): Duarte, António ; Carvalho, J.M. Valério de
Data: 2015
Identificador Persistente: http://hdl.handle.net/10198/17145
Origem: Biblioteca Digital da UPB
Assunto(s): Applied mathematics; Optimization; Systems theory
Detalhes do Documento
A column generation approach to the discrete lot sizing and scheduling problem on parallel machines
Descrição
In this work, we study the discrete lot sizing and scheduling problem (DSLP) in identical parallel resources with (sequence-independent) setup costs and inventory holding costs. We propose a Dantzig-Wolfe decomposition of a known formulation and describe a branch-and-price and column generation procedure to solve the problem to optimality. The results show that the lower bounds provided by the reformulated model are stronger than the lower bounds provided by the linear programming (LP) relaxation of the original model.
Tipo de Documento
Comunicação em conferência
Idioma Português
Contribuidor(es) Biblioteca Digital da UPB
Licença CC
Idioma Português
Contribuidor(es) Biblioteca Digital da UPB
Licença CC
