Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand

DOI10.1016/j.ejor.2005.01.053zbMath1116.90012OpenAlexW2022084541MaRDI QIDQ858399

Brian G. Kingsman, S. Armagan Tarim

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.053

zbMATH Keywords

modellinginventorystochastic demandnon-stationary \((R,S)\) policy

Mathematics Subject Classification ID

Stochastic models in economics (91B70) Inventory, storage, reservoirs (90B05)

Related Items (19)

Demand seasonality in retail inventory management ⋮ Cost-based filtering techniques for stochastic inventory control under service level constraints ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Piecewise linear lower and upper bounds for the standard normal first order loss function ⋮ The stochastic lot sizing problem with piecewise linear concave ordering costs ⋮ On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints ⋮ A reformulation for the stochastic lot sizing problem with service-level constraints ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ Service level robustness in stochastic production planning under random machine breakdowns ⋮ An optimization of \((Q, r)\) inventory policy based on health care apparel products with compound Poisson demands ⋮ An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem ⋮ Service-Level Oriented Lot Sizing Under Stochastic Demand ⋮ Continuous inventory control with stochastic and non-stationary Markovian demand ⋮ Constraint programming for computing non-stationary \((R, S)\) inventory policies ⋮ Constraint programming for stochastic inventory systems under shortage cost ⋮ Computing non-stationary \((s, S)\) policies using mixed integer linear programming ⋮ Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time ⋮ A mixed 0‐1 integer programming for inventory model ⋮ Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy

Cites Work

• Unnamed Item
• Nervousness in inventory management: Comparison of basic control rules
• Nervousness in inventory control: Analytical results
• Dynamic lot sizing with random demand and non-stationary costs
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints

This page was built for publication: Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand