IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v189y2008i3p1004-1021.html
   My bibliography  Save this article

Constraint programming for computing non-stationary (R, S) inventory policies

Author

Listed:
  • Tarim, S. Armagan
  • Smith, Barbara M.

Abstract

This paper proposes a constraint programming model for computing the finite horizon single-item inventory problem with stochastic demands in discrete time periods with service-level constraints under the non-stationary version of the "periodic review, order-up-to-level" policy (i.e., non-stationary (R, S) or, simply (Rn, Sn)). It is observed that the modeling process is more natural and the required number of variables is smaller compared to the MIP formulation of the same problem. The computational tests show that the CP approach is more tractable than the conventional MIP formulation. Two different domain reduction methods are proposed to improve the computational performance of solution algorithms. The numerical experiments confirmed the effectiveness of these methods.

Suggested Citation

  • Tarim, S. Armagan & Smith, Barbara M., 2008. "Constraint programming for computing non-stationary (R, S) inventory policies," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1004-1021, September.
    • Handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:1004-1021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00672-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tarim, S. Armagan & Kingsman, Brian G., 2004. "The stochastic dynamic production/inventory lot-sizing problem with service-level constraints," International Journal of Production Economics, Elsevier, vol. 88(1), pages 105-119, March.
    2. Brailsford, Sally C. & Potts, Chris N. & Smith, Barbara M., 1999. "Constraint satisfaction problems: Algorithms and applications," European Journal of Operational Research, Elsevier, vol. 119(3), pages 557-581, December.
    3. Heisig, Gerald, 2001. "Comparison of (s,S) and (s,nQ) inventory control rules with respect to planning stability," International Journal of Production Economics, Elsevier, vol. 73(1), pages 59-82, August.
    4. Awi Federgruen & Paul Zipkin, 1984. "An Efficient Algorithm for Computing Optimal ( s , S ) Policies," Operations Research, INFORMS, vol. 32(6), pages 1268-1285, December.
    5. Donald L. Iglehart, 1963. "Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem," Management Science, INFORMS, vol. 9(2), pages 259-267, January.
    6. Richard Ehrhardt, 1979. "The Power Approximation for Computing (s, S) Inventory Policies," Management Science, INFORMS, vol. 25(8), pages 777-786, August.
    7. de Kok, Ton & Inderfurth, Karl, 1997. "Nervousness in inventory management: Comparison of basic control rules," European Journal of Operational Research, Elsevier, vol. 103(1), pages 55-82, November.
    8. Yu-Sheng Zheng & A. Federgruen, 1991. "Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy," Operations Research, INFORMS, vol. 39(4), pages 654-665, August.
    9. James H. Bookbinder & Jin-Yan Tan, 1988. "Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints," Management Science, INFORMS, vol. 34(9), pages 1096-1108, September.
    10. Srinivas Bollapragada & Thomas E. Morton, 1999. "A Simple Heuristic for Computing Nonstationary (s, S) Policies," Operations Research, INFORMS, vol. 47(4), pages 576-584, August.
    11. Chen, Frank Y. & Krass, Dmitry, 2001. "Inventory models with minimal service level constraints," European Journal of Operational Research, Elsevier, vol. 134(1), pages 120-140, October.
    12. Arthur F. Veinott, Jr. & Harvey M. Wagner, 1965. "Computing Optimal (s, S) Inventory Policies," Management Science, INFORMS, vol. 11(5), pages 525-552, March.
    13. Tarim, S. Armagan & Kingsman, Brian G., 2006. "Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demand," European Journal of Operational Research, Elsevier, vol. 174(1), pages 581-599, October.
    14. Irvin J. Lustig & Jean-François Puget, 2001. "Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming," Interfaces, INFORMS, vol. 31(6), pages 29-53, December.
    15. James R. Freeland & Evan L. Porteus, 1980. "Evaluating the Effectiveness of a New Method for Computing Approximately Optimal ( s , S ) Inventory Policies," Operations Research, INFORMS, vol. 28(2), pages 353-364, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Roberto Rossi & S. Armagan Tarim & Brahim Hnich & Steven Prestwich & Semra Karacaer, 2010. "Scheduling internal audit activities: a stochastic combinatorial optimization problem," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 325-346, April.
    2. Rossi, Roberto & Tarim, S. Armagan & Hnich, Brahim & Prestwich, Steven, 2010. "Computing the non-stationary replenishment cycle inventory policy under stochastic supplier lead-times," International Journal of Production Economics, Elsevier, vol. 127(1), pages 180-189, September.
    3. Roberto Rossi & S. Armagan Tarim & Ramesh Bollapragada, 2012. "Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 66-80, February.
    4. Huseyin Tunc & Onur A. Kilic & S. Armagan Tarim & Roberto Rossi, 2018. "An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 492-506, August.
    5. Roberto Rossi & S. Tarim & Brahim Hnich & Steven Prestwich, 2012. "Constraint programming for stochastic inventory systems under shortage cost," Annals of Operations Research, Springer, vol. 195(1), pages 49-71, May.
    6. Nasr, Walid W. & Elshar, Ibrahim J., 2018. "Continuous inventory control with stochastic and non-stationary Markovian demand," European Journal of Operational Research, Elsevier, vol. 270(1), pages 198-217.
    7. Slama, Ilhem & Ben-Ammar, Oussama & Thevenin, Simon & Dolgui, Alexandre & Masmoudi, Faouzi, 2022. "Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1183-1198.
    8. Liu, Kanglin & Zhang, Zhi-Hai, 2018. "Capacitated disassembly scheduling under stochastic yield and demand," European Journal of Operational Research, Elsevier, vol. 269(1), pages 244-257.
    9. Tarim, S. Armagan & Dogru, Mustafa K. & Özen, Ulas & Rossi, Roberto, 2011. "An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints," European Journal of Operational Research, Elsevier, vol. 215(3), pages 563-571, December.
    10. Rossi, Roberto & Tarim, S. Armagan & Hnich, Brahim & Prestwich, Steven, 2011. "A state space augmentation algorithm for the replenishment cycle inventory policy," International Journal of Production Economics, Elsevier, vol. 133(1), pages 377-384, September.
    11. Rossi, Roberto & Kilic, Onur A. & Tarim, S. Armagan, 2015. "Piecewise linear approximations for the static–dynamic uncertainty strategy in stochastic lot-sizing," Omega, Elsevier, vol. 50(C), pages 126-140.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dural-Selcuk, Gozdem & Rossi, Roberto & Kilic, Onur A. & Tarim, S. Armagan, 2020. "The benefit of receding horizon control: Near-optimal policies for stochastic inventory control," Omega, Elsevier, vol. 97(C).
    2. Xiang, Mengyuan & Rossi, Roberto & Martin-Barragan, Belen & Tarim, S. Armagan, 2018. "Computing non-stationary (s, S) policies using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 271(2), pages 490-500.
    3. Kilic, Onur A. & Tarim, S. Armagan, 2024. "A simple heuristic for computing non-stationary inventory policies based on function approximation," European Journal of Operational Research, Elsevier, vol. 316(3), pages 899-905.
    4. Ma, Xiyuan & Rossi, Roberto & Archibald, Thomas Welsh, 2022. "Approximations for non-stationary stochastic lot-sizing under (s,Q)-type policy," European Journal of Operational Research, Elsevier, vol. 298(2), pages 573-584.
    5. B S Maddah & M Y Jaber & N E Abboud, 2004. "Periodic review (s, S) inventory model with permissible delay in payments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 147-159, February.
    6. Chen, Zhen & Rossi, Roberto, 2021. "A dynamic ordering policy for a stochastic inventory problem with cash constraints," Omega, Elsevier, vol. 102(C).
    7. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2011. "The cost of using stationary inventory policies when demand is non-stationary," Omega, Elsevier, vol. 39(4), pages 410-415, August.
    8. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Discrete‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 131-153, January.
    9. Gah-Yi Ban, 2020. "Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring," Operations Research, INFORMS, vol. 68(2), pages 309-326, March.
    10. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2013. "A simple approach for assessing the cost of system nervousness," International Journal of Production Economics, Elsevier, vol. 141(2), pages 619-625.
    11. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.
    12. Gurkan, M. Edib & Tunc, Huseyin & Tarim, S. Armagan, 2022. "The joint stochastic lot sizing and pricing problem," Omega, Elsevier, vol. 108(C).
    13. Roberto Rossi & S. Tarim & Brahim Hnich & Steven Prestwich, 2012. "Constraint programming for stochastic inventory systems under shortage cost," Annals of Operations Research, Springer, vol. 195(1), pages 49-71, May.
    14. Roberto Rossi & S. Armagan Tarim & Ramesh Bollapragada, 2012. "Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 66-80, February.
    15. Lee, Jun-Yeon & Ren, Louie, 2011. "Vendor-managed inventory in a global environment with exchange rate uncertainty," International Journal of Production Economics, Elsevier, vol. 130(2), pages 169-174, April.
    16. Xie, Xiaolan, 1998. "Stability analysis and optimization of an inventory system with bounded orders," European Journal of Operational Research, Elsevier, vol. 110(1), pages 126-149, October.
    17. Tarim, S. Armagan & Kingsman, Brian G., 2006. "Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demand," European Journal of Operational Research, Elsevier, vol. 174(1), pages 581-599, October.
    18. Chan, Gin Hor & Song, Yuyue, 2003. "A dynamic analysis of the single-item periodic stochastic inventory system with order capacity," European Journal of Operational Research, Elsevier, vol. 146(3), pages 529-542, May.
    19. Lagodimos, A.G. & Christou, I.T. & Skouri, K., 2012. "Computing globally optimal (s,S,T) inventory policies," Omega, Elsevier, vol. 40(5), pages 660-671.
    20. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:1004-1021. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.