| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 975.24 KB | Adobe PDF |
Advisor(s)
Abstract(s)
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.
Description
Keywords
Applied mathematics Optimization Systems theory
Citation
Duarte, António J.S.T.; Carvalho, J.M.V. Valério de (2015). A column generation approach to the discrete lot sizing and scheduling problem on parallel machines. In Almeida, João Paulo; Oliveira, José F.; Pinto, Alberto A. (Eds.) Operational Research e 16th National Conference of the APDIO. p. 157-170. ISBN 978-3-319-20328-7
Publisher
Springer International Publishing