Approximation algorithms for perishable inventory systems

Xiuli Chao, Xiting Gong, Cong Shi, Huanan Zhang

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

We develop the first approximation algorithms with worst-case performance guarantees for periodic-review perishable inventory systems with general product lifetime, for both backlogging and lost-sales models. The demand process can be nonstationary and correlated over time, capturing such features as demand seasonality and forecast updates. The optimal control policy for such systems is notoriously complicated, thus finding effective heuristic policies is of practical importance. In this paper, we construct a computationally efficient inventory control policy, called the proportional-balancing policy, for systems with an arbitrarily correlated demand process and show that it has a worst-case performance guarantee less than 3. In addition, when the demands are independent and stochastically nondecreasing over time, we propose another policy, called the dual-balancing policy, which admits a worst-case performance guarantee of 2. We demonstrate through an extensive numerical study that both policies perform consistently close to optimal.

Original languageEnglish (US)
Pages (from-to)585-601
Number of pages17
JournalOperations Research
Volume63
Issue number3
DOIs
StatePublished - May 1 2015

Fingerprint

Approximation algorithms
Inventory control
Sales
Inventory systems
Guarantee

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Chao, Xiuli ; Gong, Xiting ; Shi, Cong ; Zhang, Huanan. / Approximation algorithms for perishable inventory systems. In: Operations Research. 2015 ; Vol. 63, No. 3. pp. 585-601.
@article{d0f91ec6575f42e186f4a58dda29a39c,
title = "Approximation algorithms for perishable inventory systems",
abstract = "We develop the first approximation algorithms with worst-case performance guarantees for periodic-review perishable inventory systems with general product lifetime, for both backlogging and lost-sales models. The demand process can be nonstationary and correlated over time, capturing such features as demand seasonality and forecast updates. The optimal control policy for such systems is notoriously complicated, thus finding effective heuristic policies is of practical importance. In this paper, we construct a computationally efficient inventory control policy, called the proportional-balancing policy, for systems with an arbitrarily correlated demand process and show that it has a worst-case performance guarantee less than 3. In addition, when the demands are independent and stochastically nondecreasing over time, we propose another policy, called the dual-balancing policy, which admits a worst-case performance guarantee of 2. We demonstrate through an extensive numerical study that both policies perform consistently close to optimal.",
author = "Xiuli Chao and Xiting Gong and Cong Shi and Huanan Zhang",
year = "2015",
month = "5",
day = "1",
doi = "10.1287/opre.2015.1386",
language = "English (US)",
volume = "63",
pages = "585--601",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

Approximation algorithms for perishable inventory systems. / Chao, Xiuli; Gong, Xiting; Shi, Cong; Zhang, Huanan.

In: Operations Research, Vol. 63, No. 3, 01.05.2015, p. 585-601.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Approximation algorithms for perishable inventory systems

AU - Chao, Xiuli

AU - Gong, Xiting

AU - Shi, Cong

AU - Zhang, Huanan

PY - 2015/5/1

Y1 - 2015/5/1

N2 - We develop the first approximation algorithms with worst-case performance guarantees for periodic-review perishable inventory systems with general product lifetime, for both backlogging and lost-sales models. The demand process can be nonstationary and correlated over time, capturing such features as demand seasonality and forecast updates. The optimal control policy for such systems is notoriously complicated, thus finding effective heuristic policies is of practical importance. In this paper, we construct a computationally efficient inventory control policy, called the proportional-balancing policy, for systems with an arbitrarily correlated demand process and show that it has a worst-case performance guarantee less than 3. In addition, when the demands are independent and stochastically nondecreasing over time, we propose another policy, called the dual-balancing policy, which admits a worst-case performance guarantee of 2. We demonstrate through an extensive numerical study that both policies perform consistently close to optimal.

AB - We develop the first approximation algorithms with worst-case performance guarantees for periodic-review perishable inventory systems with general product lifetime, for both backlogging and lost-sales models. The demand process can be nonstationary and correlated over time, capturing such features as demand seasonality and forecast updates. The optimal control policy for such systems is notoriously complicated, thus finding effective heuristic policies is of practical importance. In this paper, we construct a computationally efficient inventory control policy, called the proportional-balancing policy, for systems with an arbitrarily correlated demand process and show that it has a worst-case performance guarantee less than 3. In addition, when the demands are independent and stochastically nondecreasing over time, we propose another policy, called the dual-balancing policy, which admits a worst-case performance guarantee of 2. We demonstrate through an extensive numerical study that both policies perform consistently close to optimal.

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

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

U2 - 10.1287/opre.2015.1386

DO - 10.1287/opre.2015.1386

M3 - Article

VL - 63

SP - 585

EP - 601

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 3

ER -