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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 48; číslo 6; s. 835 - 839
Hlavní autoři: Hochbaum, Dorit S., Rao, Xu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.11.2020
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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