Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies
From MaRDI portal
Publication:3861132
DOI10.1287/OPRE.28.2.353zbMath0425.90023OpenAlexW2093610870MaRDI QIDQ3861132
James R. Freeland, Evan L. Porteus
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.2.353
Related Items (10)
Approximating Markov decision processes using expected state transitions ⋮ A Current Taxonomy of Inventory Systems ⋮ New structural properties of inventory models with Polya frequency distributed demand and fixed setup cost ⋮ Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution ⋮ Constraint programming for computing non-stationary \((R, S)\) inventory policies ⋮ Heuristic methods and applications: A categorized survey ⋮ On the empirical performance of \((T, s, S)\) heuristics ⋮ Simple approximations for the reorder point in periodic and continuous review (s,S) inventory systems with service level constraints ⋮ Production planning with discounting and stochastic demands ⋮ A dynamic analysis of the single-item periodic stochastic inventory system with order capacity
This page was built for publication: Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies