Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
From MaRDI portal
Publication:3362077
DOI10.1287/opre.39.2.233zbMath0734.90028OpenAlexW2026421732MaRDI QIDQ3362077
Publication date: 1991
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bb3fb0167a1a99dbf84c54f3003db1b387f9cb4a
Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (6)
The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem ⋮ The complexity of the staggering problem, and other classical inventory problems ⋮ The performance ratio of grouping policies for the joint replenishment problem ⋮ Stochastic multiproduct inventory models with limited storage ⋮ Offsetting inventory replenishment cycles to minimize storage space
This page was built for publication: Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
