Stochastic lot-sizing problem with inventory-bounds and constant order-capacities

In this paper, we study the stochastic version of lot-sizing problems with inventory bounds and order capacities. Customer demands, inventory bounds, and costs are subject to uncertainty and dependent with each other throughout the finite planning horizon. Two models in stochastic programming are developed: the first one has inventory-bound constraints, and the second one has both inventory-bound and order-capacity constraints. We explore structural properties of the two models and develop O(n2)O(n2) and O(n2Tlogn)O(n2Tlogn) dynamic programming algorithms for them, respectively. Our model also generalizes the deterministic lot-sizing problem with inventory bounds. For some cases, when applied to the deterministic versions, our algorithms outperform existing deterministic algorithms.