Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering

DOI10.1016/S0377-2217(97)00431-1zbMath0933.90006OpenAlexW1995674565MaRDI QIDQ1806636

Søren Glud Johansen, Helle Schultz

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00431-1

zbMATH Keywords

inventorystochastic modellingcoordinated replenishment

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (7)

Multi-item inventory control with full truckloads: a comparison of aggregate and individual order triggering ⋮ On the benefits of delayed ordering ⋮ The joint replenishment problem: optimal policy and exact evaluation method ⋮ Collaborative shipping under different cost-sharing agreements ⋮ A MODIFIED JOINT INVENTORY POLICY FOR VMI SYSTEMS ⋮ An analytical study of the \(Q(s,S)\) policy applied to the joint replenishment problem ⋮ Calculating can-order policies for the joint replenishment problem by the compensation approach

Cites Work

• Unnamed Item
• Unnamed Item
• Technical Note—Cost Formulas for Continuous Review Inventory Models with Fixed Delivery Lags
• Optimal Control Policy for Stochastic Inventory Systems with Markovian Discount Opportunities
• Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands

This page was built for publication: Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering