Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time

Published Online:https://doi.org/10.1287/ijoc.1100.0434

References

  • Apt K.Principles of Constraint Programming (2003) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Axsäter S.Inventory Control (2006) 2nd ed.(Springer, Berlin) Google Scholar
  • Babaï M. Z., Syntetos A., Dallery Y. Z., Nikolopoulos K. Dynamic re-order point inventory control with lead-time uncertainty: Analysis and empirical investigation. Internat. J. Production Res. (2009) 47(9):2461–2483CrossrefGoogle Scholar
  • Bashyam S., Fu M. C. Optimization of (s, S) inventory systems with random lead times and a service level constraint. Management Sci. (1998) 44(12, Part 2):243–256LinkGoogle Scholar
  • Berry W. L. Lot sizing procedures for requirements planning systems: A framework for analysis. Production Inventory Management J. (1972) 13(2):19–34Google Scholar
  • Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
  • Blum C., Roli A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surveys (2003) 35(3):268–308CrossrefGoogle Scholar
  • Bookbinder J. H., Tan J. Y. Strategies for the probabilistic lot-sizing problem with service-level constraints. Management Sci. (1988) 34(9):1096–1108LinkGoogle Scholar
  • Cesta A., Cortellessa G., Oddi A., Policella N., Susi A. A constraint-based architecture for flexible support to activity scheduling. AI*IA 01: Proc. 7th Congress Italian Assoc. Artificial Intelligence Adv. Artificial Intelligence (2001) (Springer-Verlag, London) 369–381CrossrefGoogle Scholar
  • Charnes A., Cooper W. W. Chance-constrained programming. Management Sci. (1959) 6(1):73–79LinkGoogle Scholar
  • De Backer B., Furnon V., Shaw P., Kilby P., Prosser P. Solving vehicle routing problems using constraint programming and metaheuristics. J. Heuristics (2000) 6(4):501–523CrossrefGoogle Scholar
  • de Kok A. G. Basics of inventory management: Part 2: The (R, S)-model. (1991) . Research Memorandum FEW 521, Department of Economics, Tilburg University, Tilburg, The NetherlandsGoogle Scholar
  • de Kok T., Inderfurth K. Nervousness in inventory management: Comparison of basic control rules. Eur. J. Oper. Res. (1997) 103(1):55–82CrossrefGoogle Scholar
  • Eppen G. D., Martin R. K. Determining safety stock in the presence of stochastic lead time and demand. Management Sci. (1988) 34(11):1380–1390LinkGoogle Scholar
  • Focacci F., Laburthe F., Lodi A., Glover F., Kochenberger G. Local search and constraint programming. Handbook of Metaheuristics (2002) 57(Kluwer Academic Publishers, Norwell, MA) 369–403International Series in Operations Research and Management ScienceGoogle Scholar
  • Focacci F., Lodi A., Milano M. Cost-based domain filtering. Principles and Practice of Constraint Programming: Fifth International Conference (1999) 1713(Springer, Berlin) 189–203Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Hadley G., Whitin T. M.Analysis of Inventory Systems (1964) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
  • Hayya J. C., Bagchi U., Kim J. G., Sun D. On static stochastic order crossover. Internat. J. Production Econom. (2008) 114(1):404–413CrossrefGoogle Scholar
  • Hayya J. C., Xu S. H., Ramasesh R. V., He X. X. Order crossover in inventory systems. Stochastic Models (1995) 11(2):279–309CrossrefGoogle Scholar
  • Heisig G.Planning Stability in Material Requirements Planning Systems (2002) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Hunt J. A. Balancing accuracy and simplicity in determining reorder points. Management Sci. (1965) 12(4):B94–B103LinkGoogle Scholar
  • ILOGOPL Studio 3.7 User's Manual (2007) (IBM, Armonk, NY) Google Scholar
  • Kaplan R. S. A dynamic inventory model with stochastic lead times. Management Sci. (1970) 16(7):491–507LinkGoogle Scholar
  • Laburthe F.the OCRE project team Choco: Implementing a CP kernel. (1994) . Technical report, Bouygues e-Lab, St. Quentin en Yvelines, FranceGoogle Scholar
  • Nevison C., Burstein M. The dynamic lot-size model with stochastic lead times. Management Sci. (1984) 30(1):100–109LinkGoogle Scholar
  • Nocedal J., Wright S. J.Numerical Optimization (1999) (Springer, New York) CrossrefGoogle Scholar
  • Pesant G., Gendreau M., Freuder E. C. A view of local search in constraint programming. Proc. 2nd Internat. Conf. Principles and Practice of Constraint Programming, Vol. 1118 (1996) (Springer, Berlin) 353–366Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Régin J.-C. A filtering algorithm for constraints of difference in csps. Proc. 12th National Conf. Artificial Intelligence (1994) 1Seattle(American Association for Artificial Intelligence, Menlo Park, CA) 362–367Google Scholar
  • Régin J.-C., Milano M. Constraints and integer programming combined. Global Constraints and Filtering Algorithms (2003) (Kluwer Academic Publishers, Norwell, MA) 89–129Google Scholar
  • Riezebos J. Inventory order crossovers. Internat. J. Production Econom. (2006) 104(2):666–675CrossrefGoogle Scholar
  • Rossi F., van Beek P., Walsh T.Handbook of Constraint Programming (Foundations of Artificial Intelligence) (2006) (Elsevier Science, New York) Google Scholar
  • Rossi R., Tarim S. A., Hnich B., Prestwich S. A global chance-constraint for stochastic inventory systems under service level constraints. Constraints (2008) 13(4):490–517CrossrefGoogle Scholar
  • Rossi R., Tarim S. A., Hnich B., Prestwich S. Computing the non-stationary replenishment cycle inventory policy under stochastic supplier lead-times. Internat. J. Production Econom. (2010) 127(1):180–189CrossrefGoogle Scholar
  • Rossi R., Tarim S. A., Hnich B., Prestwich S. A state space augmentation algorithm for the replenishment cycle inventory policy. Internat. J. Production Econom. (2011) 133(1):377–384CrossrefGoogle Scholar
  • Silver E. A., Pyke D. F., Peterson R.Inventory Management and Production Planning and Scheduling (1998) (John Wiley & Sons, New York) Google Scholar
  • Speh T. W., Wagenheim G. Demand and lead-time uncertainty: The impacts of physical distribution performance and management. J. Bus. Logist. (1978) 1(1):95–113Google Scholar
  • Tang C. S. Perpectives in supply chain risk management. Internat. J. Production Econom. (2006) 103(2):451–488CrossrefGoogle Scholar
  • Tarim S. A. Dynamic lotsizing models for stochastic demand in single and multi-echelon inventory systems. (1996) . Ph.D. thesis, Lancaster University, Lancaster, UKGoogle Scholar
  • Tarim S. A., Kingsman B. G. The stochastic dynamic production/inventory lot-sizing problem with service-level constraints. Internat. J. Production Econom. (2004) 88(1):105–119CrossrefGoogle Scholar
  • Tarim S. A., Kingsman B. G. Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demand. Eur. J. Oper. Res. (2006) 174(1):581–599CrossrefGoogle Scholar
  • Tarim S. A., Smith B. Constraint programming for computing non-stationary (R, S) inventory policies. Eur. J. Oper. Res. (2008) 189(3):1004–1021CrossrefGoogle Scholar
  • Tarim S. A., Manandhar S., Walsh T. Stochastic constraint programming: A scenario-based approach. Constraints (2006) 11(1):53–80CrossrefGoogle Scholar
  • Tarim S. A., Hnich B., Rossi R., Prestwich S. Cost-based filtering techniques for stochastic inventory control under service level constraints. Constraints (2009) 14(2):137–176CrossrefGoogle Scholar
  • Tempelmeier H. On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints. Eur. J. Oper. Res. (2007) 181(1):184–194CrossrefGoogle Scholar
  • Whybark D. C., Williams J. G. Material requirements planning under uncertainty. Decision Sci. (1976) 7(4):595–606CrossrefGoogle Scholar
  • Zipkin P. Stochastic leadtimes in continuous-time inventory models. Naval Res. Logist. Quart. (1986) 33(4):763–774CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.