Autor(es): Duarte, António ; Carvalho, J.M. Valério de
Data: 2013
Identificador Persistente: http://hdl.handle.net/10198/10778
Origem: Biblioteca Digital da UPB
Assunto(s): DLSP; Lot sizing; Scheduling; Setup costs; Column generation; Branch-and-price
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. Preliminary 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.
