On the optimality of the (S — 1,S) policy

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199010)37:5<715::AID-NAV3220370510>3.0.CO;2-U" /><715::AID-NAV3220370510>3.0.CO;2-U 10.1002/1520-6750(199010)37:5<715::AID-NAV3220370510>3.0.CO;2-UzbMath0719.90027OpenAlexW2006247097MaRDI QIDQ5752270

Carl R. Schultz

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199010)37:5<715::aid-nav3220370510>3.0.co;2-u

zbMATH Keywords

continuous reviewcomplete backloggingconstant lead timesone-for-one (S-1,S) inventory policy

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (5)

Optimum ordering policies for expensive slow moving items ⋮ A perishable inventory system with modified \((S-1,S)\) policy and arbitrary processing times. ⋮ Applying queuing approach for a stochastic location-inventory problem with two different mean inventory considerations ⋮ Managing premium wines using an \((s - 1,s)\) inventory policy: a heuristic solution approach ⋮ Inventory problems with perishable items: fixed lifetimes and backlogging

This page was built for publication: On the optimality of the (S — 1,S) policy