The Power Approximation for Computing (s, S) Inventory Policies
From MaRDI portal
Publication:3875680
Cited in
(21)- On the empirical performance of \((T, s, S)\) heuristics
- Optimal policy estimation for continuous review inventory systems
- Multi-echelon systems: A service measure perspective
- Determination of reorder points for spare parts in a two-echelon inventory system: The case of non identical maintenance facilities
- An analysis of warehouse and distribution strategies. A case study
- Warehouse-retailer system with stochastic demands -- non-identical retailer case
- Augmenting the lot sizing order quantity when demand is probabilistic
- Constraint programming for computing non-stationary \((R, S)\) inventory policies
- Parametric replenishment policies for inventory systems with lost sales and fixed order cost
- The (s, Q) inventory system for slow moving items
- On asymptotic approximations for (s,S) policies
- Cold supply chain design with environmental considerations: a simulation-optimization approach
- Inventory control of items having lumpy demand patterns with service-level constraints
- A Current Taxonomy of Inventory Systems
- Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem
- A simple heuristic for computing non-stationary inventory policies based on function approximation
- Power approximation for pricing American options
- Fifty years of inventory research from a forecasting perspective
- Simple approximations for the reorder point in periodic and continuous review (s,S) inventory systems with service level constraints
- Inventory management of multiple items with irregular demand: a case study
This page was built for publication: The Power Approximation for Computing (s, S) Inventory Policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875680)
