2006
DOI: 10.1007/s10957-006-9106-8
|View full text |Cite
|
Sign up to set email alerts
|

Optimality of Base-Stock and (s, S) Policies for Inventory Problems with Information Delays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(27 citation statements)
references
References 8 publications
0
27
0
Order By: Relevance
“…This relation can be recursively proved as in Lemma 3 of Bensoussan, Ç akanyıldırım, and Sethi (2006). To succinctly write the single-period costs, we let D i denote the sum of i many i.i.d.…”
Section: Dynamic Programming Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…This relation can be recursively proved as in Lemma 3 of Bensoussan, Ç akanyıldırım, and Sethi (2006). To succinctly write the single-period costs, we let D i denote the sum of i many i.i.d.…”
Section: Dynamic Programming Formulationmentioning
confidence: 99%
“…We had achieved the same amount of reduction with independent delays. Also, the case of a random delay requires two dimensional state space (Bensoussan, Ç akanyıldırım, Sethi 2006). When the delays are modelled by a general Markov chain, the dimension of the state space can be reduced only to three.…”
Section: Noncrossing Delaysmentioning
confidence: 99%
“…In their model, however, the latest market demand information is exploited when the order quantity is determined. Bensoussan et al (2006) and Bensoussan et al (2007) investigate the optimum ordering policy when inventory information is lagged. They conclude that an Order-Up-To (OUT) type policy is an optimum ordering policy for this problem when only inventory costs are present.…”
Section: Introductionmentioning
confidence: 99%
“…In Section 4, we provide an inventory model which admits a sufficient statistic. Sections 2, 3 and 4 are respectively based on [5], [3] and [4].…”
Section: Introductionmentioning
confidence: 99%