Performance bound for myopic order-up-to inventory policies under stationary demand processes

DOI10.1016/j.orl.2022.08.005OpenAlexW4294001437WikidataQ114143855 ScholiaQ114143855MaRDI QIDQ2084042

René Caldentey, Clifford M. Hurvich, Avi Giloni

Publication date: 17 October 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.08.005

zbMATH Keywords

boundsinventory theorymyopic order-up-to

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Dynamic Inventory Policy with Varying Stochastic Demands
• The Value of Information Sharing in a Two-Level Supply Chain
• Optimal Policy for Dynamic Inventory Process with Stochastic Demands Subject to Seasonal Variations
• Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds
• Optimality of Myopic Inventory Policies for Certain Dependent Demand Processes
• Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
• The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing
• Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem
• Optimality of Myopic Inventory Policies for Several Substitute Products

This page was built for publication: Performance bound for myopic order-up-to inventory policies under stationary demand processes