A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

The single-item stochastic inventory control problem is to find an inventory replenishment policy in the presence of independent discrete stochastic demands under periodic review and finite time horizon. In this paper, we prove that this problem is intractable and design for it a fully polynomial-ti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics of operations research Ročník 34; číslo 3; s. 674 - 685
Hlavní autoři: Halman, Nir, Klabjan, Diego, Mostagir, Mohamed, Orlin, Jim, Simchi-Levi, David
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.08.2009
Institute for Operations Research and the Management Sciences
Témata:
Algorithms
Analysis
Approximation
approximation algorithms
Approximations
Carrying costs
Cost functions
Dynamic programming
Evaluation
Integers
Inventory control
Mathematical functions
Polynomials
Procurement
Stochastic control theory
stochastic dynamic programming
stochastic inventory management
Studies
ISSN:0364-765X, 1526-5471
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 single-item stochastic inventory control problem is to find an inventory replenishment policy in the presence of independent discrete stochastic demands under periodic review and finite time horizon. In this paper, we prove that this problem is intractable and design for it a fully polynomial-time approximation scheme.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-765X
1526-5471
DOI:10.1287/moor.1090.0391