A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage

DOI10.1080/01966324.1998.10737465MaRDI QIDQ4259000zbMATH OpenOpenAlexWikidataFDO

Authors 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

heuristicsworst case analysisaverage case analysisinventory theory

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• The inventory packing problem
• Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
• 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

• scientific article; zbMATH DE number 3130645 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3216838 (Why is no real title available?)
• A multi-item EOQ model with inventory cycle balancing
• Bounds on Multiprocessing Timing Anomalies
• Deterministic Multi-Item Inventory Systems with Limited Capacity
• Multi-Product Inventory Situations with One Restriction
• Separate vs. joint replenishment policies with maximum storage requirement costs
• Technical Note—Optimal Scheduling of Periodic Activities
• The inventory packing problem
• Worst-Case Analysis of Heuristic Algorithms

Cited in

(19)

• Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
• Storage space allocation to maximize inter-replenishment times
• scientific article; zbMATH DE number 1031399 (Why is no real title available?)
• The inventory packing problem
• Inventory routing in a warehouse: the storage replenishment routing problem
• A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY
• The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem
• Approximation algorithms for replenishment problems with fixed turnover times
• The inventory replenishment planning and staggering problem: a bi-objective approach
• A fast heuristic for minimising total average cycle stock subject to practical constraints
• scientific article; zbMATH DE number 834591 (Why is no real title available?)
• A fully polynomial time approximation scheme for the replenishment storage problem
• Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
• Offsetting inventory replenishment cycles to minimize storage space
• Online inventory replenishment scheduling of temporary orders
• Storage management of items in two levels of availability
• Another heuristic for minimizing total average cycle stock subject to practical constraints
• Minimising total average cycle stock subject to practical constraints
• The stock size problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259000)