Replenishment Planning for Stochastic Inventory Systems With Shortage Cost
Loading...
Files
Date
2007
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
Yes
Abstract
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the "replenishment cycle" policy). Under the non-stationary demand assumption the (R,S) policy takes the form (R n,Sn) where Rn denotes the length of the n th replenishment cycle, and Sn the corresponding order-up-to-level. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a CP approach able to compute optimal (Rn,Sn) policy parameters under stochastic demand, ordering, holding and shortage costs. The convexity of the cost-function is exploited during the search to compute bounds. We use the optimal solutions to analyze the quality of the solutions provided by an approximate MIP approach that exploits a piecewise linear approximation for the cost function. © Springer-Verlag Berlin Heidelberg 2007.
Description
4th International Conference on Integration of Artificial Intelligence, Constraint Programming, and Operations Research Techniques for Combinatorial Optimization Problems, CPAIOR 2007 -- 23 May 2007 through 26 May 2007 -- Brussels -- 70750
Keywords
Cost functions, Costs, Decision making, Process planning, Random processes, Uncertainty analysis, Demand assumption, Demand uncertainty, Policy parameters, Replenishment planning, Inventory control
Fields of Science
Citation
WoS Q
N/A
Scopus Q
Q3

OpenCitations Citation Count
6
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
4510 LNCS
Issue
Start Page
229
End Page
243
PlumX Metrics
Citations
CrossRef : 6
Scopus : 9
Captures
Mendeley Readers : 18
SCOPUS™ Citations
9
checked on Mar 17, 2026
Web of Science™ Citations
11
checked on Mar 17, 2026
Downloads
4
checked on Mar 17, 2026
Google Scholar™


