Name
Abstract | ||
|---|---|---|
Information delays exist when the most recent inventory information available to the Inventory Manager (IM) is dated. In other words, the IM observes only the inventory level that belongs to an earlier period. Such situations are not uncommon, and they arise when it takes a while to process the demand data and pass the results to the IM. In this paper, we establish that the average cost optimal policy is of state-dependent basestock type with respect to the reference inventory position. We show that the optimal base stock depends on the age and the magnitude of the latest observed delay. We illustrate the results by solving an example with delays of 0 and 1, for which we are able to obtain formulas/bounds for the basestock levels. © 2006 IEEE. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TAC.2011.2144650 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Delay,Markov processes,Dynamic programming,Inventory control,Inventory management,Optimization | Dynamic programming,Magnitude (mathematics),Mathematical optimization,Markov process,Cycle count,Stochastic process,Average cost,Activity-based costing,Mathematics | Journal |
Volume | Issue | ISSN |
56 | 12 | 0018-9286 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Bensoussan | 1 | 367 | 170.17 |
| Metin Çakanyildirim | 2 | 150 | 12.59 |
| Suresh Sethi | 3 | 1215 | 255.98 |
| Mingzheng Wang | 4 | 251 | 15.78 |
| Zhang Hanqin | 5 | 223 | 28.29 |