A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage

DOI10.1080/01966324.1998.10737465zbMath0940.90005OpenAlexW2073459051WikidataQ58286855 ScholiaQ58286855MaRDI QIDQ4259000

Nicholas G. Hall

Publication date: 22 August 1999

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1998.10737465

zbMATH Keywords

heuristicsaverage case analysisworst case analysisinventory theory

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (5)

The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ A fully polynomial time approximation scheme for the replenishment storage problem ⋮ The inventory packing problem ⋮ The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem ⋮ Offsetting inventory replenishment cycles to minimize storage space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separate vs. joint replenishment policies with maximum storage requirement costs
• Technical Note—Optimal Scheduling of Periodic Activities
• A multi-item EOQ model with inventory cycle balancing
• The inventory packing problem
• Worst-Case Analysis of Heuristic Algorithms
• Multi-Product Inventory Situations with One Restriction
• Deterministic Multi-Item Inventory Systems with Limited Capacity
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage