On computational procedures for Value Iteration in inventory control

E.M.T. Hendrix, Cleo Kortenhorst, G. Ortega

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

Abstract

Dynamic programming (DP) is often seen in inventory control to lead to optimal ordering policies. When considering stationary demand, Value Iteration (VI) may be used to derive the best policy. In this paper, our focus is on the computational procedures to implement VI. Practical implementation requires bounding carefully the state space and demand in an adequate way. We illustrate with small cases the challenge of the implementation. We also show that handling service level constraints is not straightforward from a DP point of view. Moreover, when taking the age distribution into account for perishable products, the curse of dimensionality provides an additional challenge.
Original languageEnglish
Pages (from-to)1484-1489
JournalIFAC-PapersOnLine
Volume52
Issue number13
DOIs
Publication statusPublished - Dec 2019

Keywords

  • Mathematical Approaches for SchedulingStochastic ProcessesInventory controlValue IterationService levelPoisson

Fingerprint Dive into the research topics of 'On computational procedures for Value Iteration in inventory control'. Together they form a unique fingerprint.

Cite this