Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
DOI10.1016/J.COR.2007.02.020zbMATH Open1171.90002OpenAlexW2098682118MaRDI QIDQ2482372FDOQ2482372
Authors: Ming-Jong Yao, Weng-Ming Chu, Yen-Fei Lin 
Publication date: 16 April 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.02.020
Recommendations
- A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage
- Offsetting inventory replenishment cycles to minimize storage space
- Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
- Inventory routing in a warehouse: the storage replenishment routing problem
- Storage space allocation to maximize inter-replenishment times
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)
Cites Work
- Bounds on Multiprocessing Timing Anomalies
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Multistage Lot Sizing Problems via Randomized Rounding
- Offsetting inventory cycles of items sharing storage.
- A multi-item EOQ model with inventory cycle balancing
- Multi-Product Inventory Situations with One Restriction
- Deterministic Multi-Item Inventory Systems with Limited Capacity
- The economic lot scheduling problem under power-of-two policy
- A global optimum search algorithm for the joint replenishment problem under power-of-two policy.
- Technical Note—Optimal Scheduling of Periodic Activities
- An Algorithm for Limited Capacity Inventory Problem with Staggering
- The peak load minimization problem in cyclic production
Cited In (7)
- Storage space allocation to maximize inter-replenishment times
- 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
- Offsetting inventory replenishment cycles
- A fully polynomial time approximation scheme for the replenishment storage problem
- Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
- A search algorithm for solving the joint replenishment problem in a distribution center with warehouse-space restrictions
This page was built for publication: Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482372)
