Inventory replenishment control under supply uncertainty

Tae Su Cheong, Chelsea C. White

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider a discrete state, discrete decision epoch inventory replenishment control problem under supply uncertainty. We assume that there is no backlogging, the single period demand d is deterministic, and once an item is placed in inventory, it will not perish. If a units of the product are ordered, then α units are placed into inventory with probability P(α{pipe}a), where ∑α=0aP(α{pipe}a) = 1. Let z=d-x, where x is the current inventory level. For the infinite horizon, total discounted cost criterion, we present conditions that guarantee that an optimal replenishment policy δ * is such that δ *(z)=0 for z≤0, δ *(z)≥z≥0, and δ *(z)-z is monotonically non-decreasing for z≥0. Such a "staircase" structure has a simple parametric description, which can help to accelerate value iteration and policy iteration.

Original languageEnglish
Pages (from-to)581-592
Number of pages12
JournalAnnals of Operations Research
Volume208
Issue number1
DOIs
Publication statusPublished - 2013 Sep 1
Externally publishedYes

Fingerprint

Supply uncertainty
Inventory replenishment
Infinite horizon
Costs
Replenishment policy
Guarantee

Keywords

  • Inventory systems
  • Markov decision processes
  • Periodic review
  • Random yields
  • Supply uncertainty

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

Inventory replenishment control under supply uncertainty. / Cheong, Tae Su; White, Chelsea C.

In: Annals of Operations Research, Vol. 208, No. 1, 01.09.2013, p. 581-592.

Research output: Contribution to journalArticle

Cheong, Tae Su ; White, Chelsea C. / Inventory replenishment control under supply uncertainty. In: Annals of Operations Research. 2013 ; Vol. 208, No. 1. pp. 581-592.
@article{0704ccdb88914b3baafaded5c4e62ee4,
title = "Inventory replenishment control under supply uncertainty",
abstract = "We consider a discrete state, discrete decision epoch inventory replenishment control problem under supply uncertainty. We assume that there is no backlogging, the single period demand d is deterministic, and once an item is placed in inventory, it will not perish. If a units of the product are ordered, then α units are placed into inventory with probability P(α{pipe}a), where ∑α=0aP(α{pipe}a) = 1. Let z=d-x, where x is the current inventory level. For the infinite horizon, total discounted cost criterion, we present conditions that guarantee that an optimal replenishment policy δ * is such that δ *(z)=0 for z≤0, δ *(z)≥z≥0, and δ *(z)-z is monotonically non-decreasing for z≥0. Such a {"}staircase{"} structure has a simple parametric description, which can help to accelerate value iteration and policy iteration.",
keywords = "Inventory systems, Markov decision processes, Periodic review, Random yields, Supply uncertainty",
author = "Cheong, {Tae Su} and White, {Chelsea C.}",
year = "2013",
month = "9",
day = "1",
doi = "10.1007/s10479-011-0929-9",
language = "English",
volume = "208",
pages = "581--592",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Inventory replenishment control under supply uncertainty

AU - Cheong, Tae Su

AU - White, Chelsea C.

PY - 2013/9/1

Y1 - 2013/9/1

N2 - We consider a discrete state, discrete decision epoch inventory replenishment control problem under supply uncertainty. We assume that there is no backlogging, the single period demand d is deterministic, and once an item is placed in inventory, it will not perish. If a units of the product are ordered, then α units are placed into inventory with probability P(α{pipe}a), where ∑α=0aP(α{pipe}a) = 1. Let z=d-x, where x is the current inventory level. For the infinite horizon, total discounted cost criterion, we present conditions that guarantee that an optimal replenishment policy δ * is such that δ *(z)=0 for z≤0, δ *(z)≥z≥0, and δ *(z)-z is monotonically non-decreasing for z≥0. Such a "staircase" structure has a simple parametric description, which can help to accelerate value iteration and policy iteration.

AB - We consider a discrete state, discrete decision epoch inventory replenishment control problem under supply uncertainty. We assume that there is no backlogging, the single period demand d is deterministic, and once an item is placed in inventory, it will not perish. If a units of the product are ordered, then α units are placed into inventory with probability P(α{pipe}a), where ∑α=0aP(α{pipe}a) = 1. Let z=d-x, where x is the current inventory level. For the infinite horizon, total discounted cost criterion, we present conditions that guarantee that an optimal replenishment policy δ * is such that δ *(z)=0 for z≤0, δ *(z)≥z≥0, and δ *(z)-z is monotonically non-decreasing for z≥0. Such a "staircase" structure has a simple parametric description, which can help to accelerate value iteration and policy iteration.

KW - Inventory systems

KW - Markov decision processes

KW - Periodic review

KW - Random yields

KW - Supply uncertainty

UR - http://www.scopus.com/inward/record.url?scp=84883055595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883055595&partnerID=8YFLogxK

U2 - 10.1007/s10479-011-0929-9

DO - 10.1007/s10479-011-0929-9

M3 - Article

AN - SCOPUS:84883055595

VL - 208

SP - 581

EP - 592

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -