A comparison of non-stationary stochastic lot-sizing strategies

Abstract

We consider the non-stationary stochastic lot sizing problem with backorder costs and make a cost comparison among different lot-sizing strategies. We initially provide an overview of the strategies and some corresponding solution approaches in the literature. We then compare the cost performances of the lot-sizing strategies on a common test bed while taking into account the added value of realized demand information. The results of this numerical experience enable us to derive novel insights about the cost performance of different stochastic lot-sizing strategies under re-planning with respect to demand realization.

working draft

Cited by in corpus (7)

• Computing Optimal (R, s, S) Policy Parameters by a Hybrid of Branch-and-Bound and Stochastic Dynamic Programming
• Controlling inventory on electric roads
• A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
• Stochastic Dynamic Programming Heuristic for the (R, s, S) Policy Parameters Computation
• MILP Approximations for non-stationary stochastic lot-sizing under (s,Q)-type policy
• On the stochastic inventory problem under order capacity constraints
• A graph-based heuristic for the non-stationary stochastic lot-sizing problem under penalty costs