Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/3392| Title: | Replenishment Planning for Stochastic Inventory Systems With Shortage Cost | Authors: | Rossi R. Armagan Tarim S. Hnich B. Prestwich S. |
Keywords: | Cost functions Costs Decision making Process planning Random processes Uncertainty analysis Demand assumption Demand uncertainty Policy parameters Replenishment planning Inventory control |
Publisher: | Springer Verlag | 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 | URI: | https://doi.org/10.1007/978-3-540-72397-4_17 https://hdl.handle.net/20.500.14365/3392 |
ISBN: | 354072396X 9783540723967 |
ISSN: | 0302-9743 |
| Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.