A lower bound on a class of coordinated inventory/production problems

DOI10.1016/0167-6377(87)90031-9zbMath0622.90023OpenAlexW2035432525MaRDI QIDQ1091248

Derek Atkins, Paul Iyogun

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90031-9

zbMATH Keywords

lower boundcoordinated multi-product inventory problems

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (7)

Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies ⋮ A survey of lower bounding methodologies for production/inventory models ⋮ Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem ⋮ A two-echelon inventory system with transportation capacity constraint ⋮ A dynamic joint replenishment policy with auto-correlated demand ⋮ An integrated inventory-transportation system with modified periodic policy for multiple products ⋮ A performance bound on single cycle lot-sizing policies for an assembly system with stochastic demand

Cites Work

• Dynamic Version of the Economic Lot Size Model
• Approximations of Dynamic, Multilocation Production and Inventory Problems
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• On the Optimality of (σ, S) Policies
• A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
• Coordinated replenishments of items under time-varying demand: Dynamic programming formulation
• Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands

This page was built for publication: A lower bound on a class of coordinated inventory/production problems