A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage

DOI10.1080/01966324.1998.10737465zbMATH Open0940.90005OpenAlexW2073459051WikidataQ58286855 ScholiaQ58286855MaRDI QIDQ4259000FDOQ4259000

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

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

zbMATH Keywords

heuristicsworst case analysisaverage case analysisinventory theory

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

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

Cited In (19)

• Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
• Storage space allocation to maximize inter-replenishment times
• Title not available (Why is that?)
• The inventory packing problem
• Inventory routing in a warehouse: the storage replenishment routing problem
• The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem
• A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY
• 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
• Title not available (Why is that?)
• 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)