A fully polynomial time approximation scheme for the Replenishment Storage problem

The Replenishment Storage problem (RSP) is to minimize the storage capacity requirement for a deterministic demand, multi-item inventory system with specified individual reorder cycle lengths. The reorders can only take place at integer time units. This problem was shown to be weakly NP-hard for con...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 48; no. 6; pp. 835 - 839
Main Authors: Hochbaum, Dorit S., Rao, Xu
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2020
Subjects:
Approximation algorithm
Fully polynomial time approximation scheme
Weakly NP-hard
Fully polynomial time approximation scheme
Approximation algorithm
Weakly NP-hard
ISSN:0167-6377, 1872-7468
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Replenishment Storage problem (RSP) is to minimize the storage capacity requirement for a deterministic demand, multi-item inventory system with specified individual reorder cycle lengths. The reorders can only take place at integer time units. This problem was shown to be weakly NP-hard for constant joint cycle length (the least common multiple of all individual cycle lengths). We devise here the first known FPTAS for the RSP with different individual cycle lengths and constant joint cycle length.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2020.10.004