Cost-Based Filtering Techniques for Stochastic Inventory Control Under Service Level Constraints

This paper1 considers a single product and a single stocking location production/inventory control problem given a non-stationary stochastic demand. Under a widely-used control policy for this type of inventory system, the objective is to find the optimal number of replenishments, their timings and their respective order-up-to-levels that meet customer demands to a required service level. We extend a known CP approach for this problem using three cost-based filtering methods. Our approach can solve to optimality instances of realistic size much more efficiently than previous approaches, often with no search effort at all.

[1]  Andrea Lodi,et al.  Cost-Based Domain Filtering , 1999, CP.

[2]  P. Gács,et al.  Algorithms , 1992 .

[3]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[4]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[5]  Chris N. Potts,et al.  Constraint satisfaction problems: Algorithms and applications , 1999, Eur. J. Oper. Res..

[6]  Roberto Rossi,et al.  Cost-Based Filtering for Stochastic Inventory Control , 2006, CSCLP.

[7]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[8]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[9]  Roberto Rossi,et al.  A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints , 2008, Constraints.

[10]  Pascal Van Hentenryck,et al.  Generality versus Specificity: An Experience with AI and OR Techniques , 1988, AAAI.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Meinolf Sellmann,et al.  Cost Based Filtering for the Constrained Knapsack Problem , 2002, Ann. Oper. Res..

[13]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[14]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

[15]  Brian G. Kingsman,et al.  Production, Manufacturing and Logistics Modelling and computing (R n ,S n ) policies for inventory systems with non-stationary stochastic demand , 2005 .

[16]  Toby Walsh,et al.  Stochastic Constraint Programming: A Scenario-Based Approach , 2009, Constraints.

[17]  E. Silver.  Inventory control under a probabilistic time-varying, demand pattern , 1978 .

[18]  Roberto Rossi,et al.  Replenishment Planning for Stochastic Inventory Systems with Shortage Cost , 2007, CPAIOR.

[19]  James H. Bookbinder,et al.  Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints , 1988 .

[20]  Ş. Tarim,et al.  The stochastic dynamic production/inventory lot-sizing problem with service-level constraints , 2004 .

[21]  Armagan Tarim,et al.  Constraint programming for computing non-stationary (R, S) inventory policies , 2008, Eur. J. Oper. Res..

[22]  R. Sedgewick,et al.  Algorithms (2nd ed.) , 1988 .

[23]  Ronald G. Askin.  A Procedure for Production Lot Sizing with Probabilistic Dynamic Demand , 1981 .

[24]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[25]  François Laburhe.  CHOCO: implementing a CP kernel , 2007 .