Distribution free bounds for service constrained (Q, r) inventory systems

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(200012)47:8<635::AID-NAV3>3.0.CO;2-C" /><635::AID-NAV3>3.0.CO;2-C 10.1002/1520-6750(200012)47:8<635::AID-NAV3>3.0.CO;2-CzbMath0981.90001OpenAlexW1968903494MaRDI QIDQ4526922

Vipul Agrawal, Sridhar Seshadri

Publication date: 2000

Full work available at URL: https://doi.org/10.1002/1520-6750(200012)47:8<635::aid-nav3>3.0.co;2-c

zbMATH Keywords

algorithmboundsinventory modelsstochasticfill-rate constrained inventory problem

Mathematics Subject Classification ID

Stochastic models in economics (91B70) Inventory, storage, reservoirs (90B05)

Related Items (7)

A heuristic for rationing inventory in two demand classes with backlog costs and a service constraint ⋮ Weak aggregating algorithm for the distribution-free perishable inventory problem ⋮ Fill rate of single-stage general periodic review inventory systems ⋮ Inventory management under highly uncertain demand ⋮ Min-max distribution free continuous-review model with a service level constraint and variable lead time ⋮ A decision rule for coordination of inventory and transportation in a two-stage supply chain with alternative supply sources ⋮ Fill rate: from its definition to its calculation for the continuous \((s, Q)\) inventory system with discrete demands and lost sales

Cites Work

• Unnamed Item

This page was built for publication: Distribution free bounds for service constrained (Q, r) inventory systems