Calculating can-order policies for the joint replenishment problem by the compensation approach

DOI10.1016/S0377-2217(01)00304-6zbMath1081.90508OpenAlexW2011289294MaRDI QIDQ1847205

Philip Melchiors

Publication date: 17 November 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00304-6

zbMATH Keywords

Markov decision processesInventoryCan-order policyJoint replenishment problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05) Markov and semi-Markov decision processes (90C40)

Related Items (7)

Multi-item inventory control with full truckloads: a comparison of aggregate and individual order triggering ⋮ The joint replenishment problem: optimal policy and exact evaluation method ⋮ Optimization of a stochastic joint replenishment inventory system with service level constraints ⋮ A MODIFIED JOINT INVENTORY POLICY FOR VMI SYSTEMS ⋮ A review of the joint replenishment problem literature: 1989--2005 ⋮ Order Fulfillment and Replenishment Policies for Fully Substitutable Products ⋮ A dynamic joint replenishment policy with auto-correlated demand

Cites Work

• Unnamed Item
• Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering
• On the determination of the control parameters of the optimal can-order policy
• Optimal Control Policy for Stochastic Inventory Systems with Markovian Discount Opportunities
• Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands
• Optimal Continuous Review Policies for Two Product Inventory Systems with Joint Setup Costs

This page was built for publication: Calculating can-order policies for the joint replenishment problem by the compensation approach