Published January 1, 2010
| Version v1
Journal article
Open
Computing the non-stationary replenishment cycle inventory policy under stochastic supplier lead-times
- 1. Wageningen UR, NL-6706 KN Wageningen, Netherlands
- 2. Hacettepe Univ, Dept Management, Ankara, Turkey
- 3. Izmir Univ Econ, Fac Comp Sci, Izmir, Turkey
- 4. Natl Univ Ireland Univ Coll Cork, Cork Constraint Computat Ctr, Cork, Ireland
Description
In this paper we address the general multi-period production/inventory problem with non-stationary stochastic demand and supplier lead-time under service level constraints. A replenishment cycle policy (R"S") is modeled, where R" is the nth replenishment cycle length and S" is the respective order-up-to-level. We propose a stochastic constraint programming approach for computing the optimal policy parameters. In order to do so, a dedicated global chance-constraint and the respective filtering algorithm that enforce the required service level are presented. Our numerical examples show that a stochastic supplier lead-time significantly affects policy parameters with respect to the case in which the lead-time is assumed to be deterministic or absent. (C) 2010 Elsevier B.V. All rights reserved.
Files
bib-1c0fcb5f-d49e-49e7-8d28-d690b10d1d2f.txt
Files
(223 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:422b58408b1dc9c6ddc1db400e069cf8
|
223 Bytes | Preview Download |