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

DOI10.1016/j.cor.2005.05.029zbMath1102.90001OpenAlexW2064297670MaRDI 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

zbMATH Keywords

dynamic programmingcapacityinventory-production: policies

Mathematics Subject Classification ID

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

Related Items (8)

Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ 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 ⋮ A branch-and-price algorithm for an integrated production and inventory routing problem

Cites Work

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

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