Detalhes bibliográficos
| Resumo: | 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. |
|---|
| Autores principais: | Duarte, António |
|---|
| Outros Autores: | Carvalho, J.M. Valério de |
|---|
| Assunto: | Applied mathematics Optimization Systems theory |
|---|
| Ano: | 2015 |
|---|
| País: | Portugal |
|---|
| Tipo de documento: | comunicação em conferência |
|---|
| Tipo de acesso: | acesso restrito |
|---|
| Instituição associada: | Instituto Politécnico de Bragança |
|---|
| Idioma: | português |
|---|
| Origem: | Biblioteca Digital do IPB |
|---|