Discrete lot sizing and scheduling on parallel machines: description of a column generation approach
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 pro...
Autor principal: | |
---|---|
Outros Autores: | |
Formato: | conferenceObject |
Idioma: | eng |
Publicado em: |
2014
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10198/10778 |
País: | Portugal |
Oai: | oai:bibliotecadigital.ipb.pt:10198/10778 |