An efficient lot-sizing heuristic for a periodic-review inventory system under non-stationary stochastic demand

DOI10.1007/BF03398726MaRDI QIDQ2476427zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 March 2008

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03398726

zbMATH Keywords

dynamic programmingheuristicinventorynon-stationary stochastic demandperiodic-review

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Simple Heuristic for Computing Nonstationary (s, S) Policies
• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy
• Efficient heuristics for dynamic lot sizing
• The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing
• Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand

Cites work

• A Simple Heuristic for Computing Nonstationary (s, S) Policies
• A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems
• Computing Optimal (s, S) Inventory Policies
• Dynamic inventory policy with varying stochastic demands
• Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
• scientific article; zbMATH DE number 3322720 (Why is no real title available?)

Cited in

(8)

• Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
• Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy
• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy
• A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
• Optimal policy and stability regions for the single product periodic review inventory problem, with stationary demands
• A Simple Heuristic for Computing Nonstationary (s, S) Policies
• SOS: A Quantile Estimation Procedure for Dynamic Lot-sizing Problems
• Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation

This page was built for publication: An efficient lot-sizing heuristic for a periodic-review inventory system under non-stationary stochastic demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476427)