A fully polynomial time approximation scheme for the replenishment storage problem

DOI10.1016/j.orl.2020.10.004OpenAlexW3097520059MaRDI QIDQ2661576

Xu Rao, Dorit S. Hochbaum

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.01631

zbMATH Keywords

approximation algorithmfully polynomial time approximation schemeweakly NP-hard

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Offsetting inventory replenishment cycles
• Offsetting inventory replenishment cycles to minimize storage space
• Offsetting inventory cycles of items sharing storage.
• Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
• A class of random algorithms for inventory cycle offsetting
• A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage
• The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem

This page was built for publication: A fully polynomial time approximation scheme for the replenishment storage problem