A polynomial algorithm for the production/ordering planning problem with limited storage

DOI10.1016/J.COR.2005.05.029zbMATH Open1102.90001OpenAlexW2064297670MaRDI QIDQ856668FDOQ856668

Authors: Marcos Colebrook, J. Sicilia, José M. Gutiérrez, Antonio Sedeño-Noda 

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

Recommendations

• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
• Capacitated dynamic lot-sizing problem with delivery/production time windows
• An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• scientific article; zbMATH DE number 232493

zbMATH Keywords

dynamic programmingcapacityinventory-production: policies

Mathematics Subject Classification ID

Dynamic programming (90C39) Inventory, storage, reservoirs (90B05) Production models (90B30)

Cites Work

• Bounded Production and Inventory Models with Piecewise Concave Costs
• A new characterization for the dynamic lot size problem with bounded inventory

Cited In (12)

• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Multi-item uncapacitated lot sizing problem with inventory bounds
• Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories
• Polynomial-time solvability of dynamic lot size problems
• A polynomial algorithm for a multi-item capacitated production planning problem
• Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities
• An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• A branch-and-price algorithm for an integrated production and inventory routing problem
• The integrated production-inventory-distribution-routing problem
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
• Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
• Dynamic lot-sizing model under perishability, substitution, and limited storage capacity

This page was built for publication: A polynomial algorithm for the production/ordering planning problem with limited storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856668)