Offsetting inventory replenishment cycles to minimize storage space
From MaRDI portal
Publication:1046100
DOI10.1016/J.EJOR.2009.07.035zbMath1177.90010OpenAlexW2040424781MaRDI QIDQ1046100
Publication date: 21 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.035
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (4)
Offsetting inventory replenishment cycles ⋮ The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ A fully polynomial time approximation scheme for the replenishment storage problem ⋮ The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem
Cites Work
- Unnamed Item
- The complexity of the staggering problem, and other classical inventory problems
- Offsetting inventory cycles of items sharing storage.
- On the Single Resource Capacity Problem for Multi-Item Inventory Systems
- Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
- The Deterministic, Two-Product, Inventory System with Capacity Constraint
- An Algorithm for Limited Capacity Inventory Problem with Staggering
- Multi-Product Inventory Situations with One Restriction
- Deterministic Multi-Item Inventory Systems with Limited Capacity
- A Note on "Multi-Product Inventory Situations with One Restriction"
- A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage
- Single Resource Multi-Item Inventory Systems
This page was built for publication: Offsetting inventory replenishment cycles to minimize storage space