The performance ratio of grouping policies for the joint replenishment problem

DOI10.1016/0166-218X(93)90157-JzbMath0785.90045OpenAlexW2075481368MaRDI QIDQ689953

Daning Sun, Maurice Queyranne

Publication date: 2 January 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90157-j

zbMATH Keywords

upper boundEOQ modelworst-case performance ratiogrouping heuristicgrouping policiesjoint replenishmentsjoint setup costs

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

• Joint replenishment inventory control: Deterministic and stochastic models
• Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Lot Sizing Policies for Finite Production Rate Assembly Systems
• Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
• Multi-Product Inventory Situations with One Restriction
• A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
• Single Resource Multi-Item Inventory Systems

This page was built for publication: The performance ratio of grouping policies for the joint replenishment problem