On the empirical performance of \((T, s, S)\) heuristics
From MaRDI portal
Publication:1039792
DOI10.1016/j.ejor.2009.05.030zbMath1175.90014OpenAlexW2033926229MaRDI QIDQ1039792
M. Zied Babai, Aris A. Syntetos, Ruud H. Teunter
Publication date: 23 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.030
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (6)
The value of real time yield information in multi-stage inventory systems -- exact and heuristic approaches ⋮ Approaches for periodic inventory control under random production yield and fixed setup cost ⋮ Analysis of order-up-to-level inventory systems with compound Poisson demand ⋮ Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming ⋮ Undershoot and order quantity probability distributions in periodic review, reorder point, order-up-to-level inventory systems with continuous demand ⋮ Inventory -- forecasting: mind the gap
Cites Work
- Simple approximations for the reorder point in periodic and continuous review (s,S) inventory systems with service level constraints
- On the bias of Croston's forecasting method
- Optimal policy surfaces for a multi-item inventory problem
- On the \((R,s,Q)\) inventory model when demand is modelled as a compound Bernoulli process
- An inventory control system for spare parts at a refinery: an empirical comparison of different re-order point methods
- Power Approximation for Computing (s, S) Policies Using Service Level
- A Revision of the Power Approximation for Computing (s, S) Policies
- Numerical Comparisons of Inventory Policies for Periodic Review Systems
- Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies
- The Power Approximation for Computing (s, S) Inventory Policies
- Continuous Review (s, S) Policies with Lost Sales
- Analysis of the Deterministic (s, S) Inventory Problem
- Optimal and Heuristic Decisions in Single-and Multi-Item Inventory Systems
- (s, S) Policies Under Continuous Review and Discrete Compound Poisson Demand
- Methods for Determining the Re-order Point of an (s, S) Ordering Policy when a Service Level is Specified
- Selecting the best periodic inventory control and demand forecasting methods for low demand items
- Forecasting for Items with Intermittent Demand
- Classification for forecasting and stock control: a case study
- On the categorization of demand patterns
- Computing Optimal (s, S) Inventory Policies
- Forecasting and Stock Control for Intermittent Demands
- Unnamed Item
- Unnamed Item
This page was built for publication: On the empirical performance of \((T, s, S)\) heuristics
