A polynomial algorithm for the production/ordering planning problem with limited storage
Published in Computers & Operations Research, 2007
Recommended citation: Gutiérrez J, Sedeño-Noda A, Colebrook M, Sicilia J. "A polynomial algorithm for the production/ordering planning problem with limited storage". Computers & Operations Research 34(4), 934-837 (2007) https://doi.org/10.1016/j.cor.2005.05.029
Abstract
This paper concerns the dynamic lot size problem where the storage capacity is limited and shortages are allowed. The planning horizon is divided into periods and, for each period, concave functions to define the holding/stockout and production costs are considered. It is proved that the results derived in a previous work for the dynamic lot size problem assuming time-varying storage capacities remain valid for the case with backlogging.