Abstract
One of the most important policies adopted in inventory control is the replenishment cycle policy. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a constraint programming approach able to compute optimal replenishment cycle policy parameters under non-stationary stochastic demand, ordering, holding and shortage costs. We show how in our model it is possible to exploit the convexity of the cost-function during the search to dynamically compute bounds and perform cost-based filtering. Our computational experience show the effectiveness of our approach. Furthermore, we use the optimal solutions to analyze the quality of the solutions provided by an existing approximate mixed integer programming approach that exploits a piecewise linear approximation for the cost function.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Apt, K. (2003). Principles of constraint programming. Cambridge: Cambridge University Press.
Bayraktar, E., & Ludkovski, M. (2010). Inventory management with partially observed nonstationary demand. Annals of Operation Research, 176(1), 7–39.
Birge, J. R., & Louveaux, F. (1997). Introduction to stochastic programming. New York: Springer.
Bookbinder, J. H., & Tan, J. Y. (1988). Strategies for the probabilistic lot-sizing problem with service-level constraints. Management Science, 34, 1096–1108.
de Kok, A. G. (1991). Basics of inventory management. Part 2. The (R,S)-model. Research memorandum, FEW 521. Department of Economics, Tilburg University, Tilburg, The Netherlands.
de Kok, T., & Inderfurth, K. (1997). Nervousness in inventory management: comparison of basic control rules. European Journal of Operational Research, 103, 55–82.
Fahle, T., & Sellmann, M. (2002). Cost-based filtering for the constrained knapsack problem. Annals of Operation Research, 115, 73–93.
Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering. In Lecture notes in computer science: Vol. 1713. Proceedings of the 5th international conference on the principles and practice of constraint programming (pp. 189–203). Berlin: Springer.
Focacci, F., Lodi, A., & Milano, M. (2002). Optimization-oriented global constraints. Constraints, 7(3–4), 351–365.
Focacci, F., & Milano, M. (2001). Connections and integrations of dynamic programming and constraint programming. In Proceedings of the international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems CP-AI-OR 2001.
Fortuin, L. (1980). Five popular probability density functions: a comparison in the field of stock-control models. The Journal of the Operational Research Society, 31(10), 937–942.
Graves, S. C. (1999). A single-item inventory model for a non-stationary demand process. Manufacturing & Service Operations Management, 1, 50–61.
Hadley, G., & Whitin, T. M. (1964). Analysis of Inventory Systems. New York: Prentice Hall.
Heisig, G. (2002). Planning stability in material requirements planning systems. New York: Springer.
Hnich, B., Rossi, R., Tarim, S. A., & Prestwich, S. D. (2009). Synthesizing filtering algorithms for global chance-constraints. In Lecture notes in computer science: Vol. 5732. Proceedings of principles and practice of constraint programming (CP 2009) (pp. 439–453). Berlin: Springer.
Hnich, B., Rossi, R., Tarim, S. A., & Prestwich, S. (2011). A survey on CP-AI-OR hybrids for decision making under uncertainty. In P. van Hentenryck & M. Milano (Eds.), Springer optimization and its applications: Vol. 45. Hybrid optimization (pp. 227–270). New York: Springer. Chap. 7.
F. Laburthe and the OCRE Project Team (1994). Choco: Implementing a CP kernel. Technical report, Bouygues e-Lab, France.
Levi, R., Roundy, R. O., & Shmoys, D. B. (2006). Provably near-optimal sampling-based algorithms for stochastic inventory control models. In Proceedings of the thirty-eighth annual ACM symposium on theory of computing (STOC ’06) (pp. 739–748). New York: ACM Press.
Pujawan, I. N., & Silver, E. A. (2008). Augmenting the lot sizing order quantity when demand is probabilistic. European Journal of Operational Research, 127(3), 705–722.
Regin, J.-C. (1994). A filtering algorithm for constraints of difference in csps. In American Association for Artificial Intelligence (pp. 362–367). Seattle, Washington.
Regin, J.-C. (2003). Global constraints and filtering algorithms. In M. Milano (Ed.), Constraints and integer programming combined. Dordrecht: Kluwer Academic.
Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of constraint programming. Foundations of artificial intelligence. New York: Elsevier.
Rossi, R., Tarim, S. A., Hnich, B., & Prestwich, S. (2007). Replenishment planning for stochastic inventory systems with shortage cost. In Lecture notes in computer science: Vol. 4510. Proceedings of the international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems CP-AI-OR 2007 (pp. 229–243). Berlin: Springer.
Rossi, R., Tarim, S. A., Hnich, B., & Prestwich, S. D. (2008). A global chance-constraint for stochastic inventory systems under service level constraints. Constraints, 13(4), 490–517.
Rossi, R., Tarim, S. A., Hnich, B., & Prestwich, S. (2011). A state space augmentation algorithm for the replenishment cycle inventory policy. International Journal of Production Economics. 113(1), 377–384
Silver, E. A., Pyke, D. F., & Peterson, R. (1998). Inventory management and production planning and scheduling. New York: Wiley.
Tang, C. S. (2006). Perspectives in supply chain risk management. International Journal of Production Economics, 103, 451–488.
Tarim, S. A. (1996). Dynamic lotsizing models for stochastic demand in single and multi-echelon inventory systems. Ph.D. thesis, Lancaster University.
Tarim, S. A., & Kingsman, B. G. (2004). The stochastic dynamic production/inventory lot-sizing problem with service-level constraints. International Journal of Production Economics, 88, 105–119.
Tarim, S. A., & Kingsman, B. G. (2006). Modelling and computing (R n,S n) policies for inventory systems with non-stationary stochastic demand. European Journal of Operational Research, 174, 581–599.
Tarim, S. A., & Smith, B. (2008). Constraint programming for computing non-stationary (R,S) inventory policies. European Journal of Operational Research, 189, 1004–1021.
Tarim, S. A., Hnich, B., Prestwich, S. D., & Rossi, R. (2009a). Finding reliable solution: event-driven probabilistic constraint programming. Annals of Operation Research, 171(1), 77–99.
Tarim, S. A., Hnich, B., Rossi, R., & Prestwich, S. D. (2009b). Cost-based filtering techniques for stochastic inventory control under service level constraints. Constraints, 14(2), 137–176.
Tempelmeier, H. (2007). On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints. European Journal of Operational Research, 127(1), 184–194.
Wagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5, 89–96.
Walsh, T. (2002). Stochastic constraint programming. In Proceedings of European conference on artificial intelligence (ECAI’2002) (pp. 111–115).
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is an extended version of the work presented in Rossi et al. (2007).
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Rossi, R., Tarim, S.A., Hnich, B. et al. Constraint programming for stochastic inventory systems under shortage cost. Ann Oper Res 195, 49–71 (2012). https://doi.org/10.1007/s10479-011-0936-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0936-x