A simulation based heuristic for serial inventory systems under fill-rate constraints

Ick Hyun Kwon, Sung Shick Kim, Jun-Geol Baek

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We examine the problem of minimizing average inventory costs subject to a fill-rate constraint in a Clark and Scarf type serial inventory model with a normal demand process. We propose a simulation based heuristic procedure to solve this problem. Using a recent result by Sobel [1] that is an exact base-stock level for a single-stage model, the lower bounds of base-stock levels in each stage of the serial system are obtained. Then, through an effective approximate method, the given problem is decomposed into subproblems. Using the convexity of these subproblems, near optimal base-stock levels are determined sequentially from the most upstream stage to the downstream stage. Numerical tests have shown a highly accurate performance of the proposed heuristic.

Original languageEnglish
Pages (from-to)297-304
Number of pages8
JournalInternational Journal of Advanced Manufacturing Technology
Volume31
Issue number3-4
DOIs
Publication statusPublished - 2006 Nov 1
Externally publishedYes

Fingerprint

Costs

Keywords

  • Base-stock
  • Fill rate
  • Heuristic
  • Normal demand process
  • Serial inventory system
  • Simulation

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

A simulation based heuristic for serial inventory systems under fill-rate constraints. / Kwon, Ick Hyun; Kim, Sung Shick; Baek, Jun-Geol.

In: International Journal of Advanced Manufacturing Technology, Vol. 31, No. 3-4, 01.11.2006, p. 297-304.

Research output: Contribution to journalArticle

@article{cf7ab76ccf1140249bea8f1f2e3517c3,
title = "A simulation based heuristic for serial inventory systems under fill-rate constraints",
abstract = "We examine the problem of minimizing average inventory costs subject to a fill-rate constraint in a Clark and Scarf type serial inventory model with a normal demand process. We propose a simulation based heuristic procedure to solve this problem. Using a recent result by Sobel [1] that is an exact base-stock level for a single-stage model, the lower bounds of base-stock levels in each stage of the serial system are obtained. Then, through an effective approximate method, the given problem is decomposed into subproblems. Using the convexity of these subproblems, near optimal base-stock levels are determined sequentially from the most upstream stage to the downstream stage. Numerical tests have shown a highly accurate performance of the proposed heuristic.",
keywords = "Base-stock, Fill rate, Heuristic, Normal demand process, Serial inventory system, Simulation",
author = "Kwon, {Ick Hyun} and Kim, {Sung Shick} and Jun-Geol Baek",
year = "2006",
month = "11",
day = "1",
doi = "10.1007/s00170-005-0193-8",
language = "English",
volume = "31",
pages = "297--304",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "3-4",

}

TY - JOUR

T1 - A simulation based heuristic for serial inventory systems under fill-rate constraints

AU - Kwon, Ick Hyun

AU - Kim, Sung Shick

AU - Baek, Jun-Geol

PY - 2006/11/1

Y1 - 2006/11/1

N2 - We examine the problem of minimizing average inventory costs subject to a fill-rate constraint in a Clark and Scarf type serial inventory model with a normal demand process. We propose a simulation based heuristic procedure to solve this problem. Using a recent result by Sobel [1] that is an exact base-stock level for a single-stage model, the lower bounds of base-stock levels in each stage of the serial system are obtained. Then, through an effective approximate method, the given problem is decomposed into subproblems. Using the convexity of these subproblems, near optimal base-stock levels are determined sequentially from the most upstream stage to the downstream stage. Numerical tests have shown a highly accurate performance of the proposed heuristic.

AB - We examine the problem of minimizing average inventory costs subject to a fill-rate constraint in a Clark and Scarf type serial inventory model with a normal demand process. We propose a simulation based heuristic procedure to solve this problem. Using a recent result by Sobel [1] that is an exact base-stock level for a single-stage model, the lower bounds of base-stock levels in each stage of the serial system are obtained. Then, through an effective approximate method, the given problem is decomposed into subproblems. Using the convexity of these subproblems, near optimal base-stock levels are determined sequentially from the most upstream stage to the downstream stage. Numerical tests have shown a highly accurate performance of the proposed heuristic.

KW - Base-stock

KW - Fill rate

KW - Heuristic

KW - Normal demand process

KW - Serial inventory system

KW - Simulation

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

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

U2 - 10.1007/s00170-005-0193-8

DO - 10.1007/s00170-005-0193-8

M3 - Article

AN - SCOPUS:33751095344

VL - 31

SP - 297

EP - 304

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 3-4

ER -