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

DOI10.1007/BF03398726zbMath1160.90304OpenAlexW2773678450MaRDI QIDQ2476427

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 programminginventoryheuristicperiodic-reviewnon-stationary stochastic demand

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Dynamic Inventory Policy with Varying Stochastic Demands
• Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
• A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems
• A Simple Heuristic for Computing Nonstationary (s, S) Policies
• Computing Optimal (s, S) Inventory Policies

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