A simple heuristic for computing non-stationary inventory policies based on function approximation
From MaRDI portal
Publication:6565432
DOI10.1016/j.ejor.2024.02.016MaRDI QIDQ6565432
S. Armagan Tarim, Onur A. Kilic
Publication date: 2 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing non-stationary \((s, S)\) policies using mixed integer linear programming
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- An Efficient Algorithm for Computing Optimal (s, S) Policies
- Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies
- The Power Approximation for Computing (s, S) Inventory Policies
- Technical Note—An Adjustment to the Norman-White Approach to Approximating Dynamic Programs
- 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
- (s, S) Policies Under Continuous Review and Discrete Compound Poisson Demand
- A Simple Heuristic for Computing Nonstationary (s, S) Policies
- Forecasting and Inventory Management of Short Life-Cycle Products
- Computing Optimal (s, S) Inventory Policies
- On (s, S) Policies
- Dimensional and Computational Analysis in Stationary (s, S) Inventory Problems with Gamma Distributed Demand
- Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research
This page was built for publication: A simple heuristic for computing non-stationary inventory policies based on function approximation
