A unified modeling approach for the static-dynamic uncertainty strategy in stochastic lot-sizing

Abstract

In this paper, we develop mixed integer linear programming models to compute near-optimal policy parameters for the non-stationary stochastic lot sizing problem under Bookbinder and Tan's static-dynamic uncertainty strategy. Our models build on piecewise linear upper and lower bounds of the first order loss function. We discuss different formulations of the stochastic lot sizing problem, in which the quality of service is captured by means of backorder penalty costs, non-stockout probability, or fill rate constraints. These models can be easily adapted to operate in settings in which unmet demand is backordered or lost. The proposed approach has a number of advantages with respect to existing methods in the literature: it enables seamless modelling of different variants of the above problem, which have been previously tackled via ad-hoc solution methods; and it produces an accurate estimation of the expected total cost, expressed in terms of upper and lower bounds. Our computational study demonstrates the effectiveness and flexibility of our models.

38 pages, working draft

References in corpus (2)

• Piecewise linear approximations of the standard normal first order loss function
• A note on Tempelmeier's β-service measure under non-stationary stochastic demand

Cited by in corpus (11)

• Effects of forecast errors on optimal utilisation in aggregate production planning with stochastic customer demand
• Computing non-stationary $(s,S)$ policies using mixed integer linear programming
• Computing Optimal (R, s, S) Policy Parameters by a Hybrid of Branch-and-Bound and Stochastic Dynamic Programming
• Capital flow constrained lot sizing problem with loss of goodwill and loan
• A comparison of non-stationary stochastic lot-sizing strategies
• A dynamic ordering policy for a stochastic inventory problem with cash constraints
• A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
• MILP Approximations for non-stationary stochastic lot-sizing under (s,Q)-type policy
• Stochastic Dynamic Programming Heuristic for the (R, s, S) Policy Parameters Computation
• An (R, S) Based Heuristic Model for the Stochastic Joint Replenishment Problem
• A graph-based heuristic for the non-stationary stochastic lot-sizing problem under penalty costs