A polynomial algorithm for the production/ordering planning problem with limited storage
From MaRDI portal
Publication:856668
DOI10.1016/j.cor.2005.05.029zbMath1102.90001MaRDI QIDQ856668
Marcos Colebrook, Joaquín Sicilia, Antonio Sedeño-Noda, José Miguel Gutiérrez
Publication date: 7 December 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.029
Related Items
Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities, Stochastic lot-sizing problem with inventory-bounds and constant order-capacities, A branch-and-price algorithm for an integrated production and inventory routing problem, Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories, Multi-item uncapacitated lot sizing problem with inventory bounds, The integrated production-inventory-distribution-routing problem, Polynomial-Time Solvability of Dynamic Lot Size Problems
Cites Work