Algorithms (2nd ed.)
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Principles of Constraint Programming
Principles of Constraint Programming
Cost-based filtering for stochastic inventory control
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Cost-Based Domain Filtering for Stochastic Constraint Programming
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Flow-Based combinatorial chance constraints
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
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.