A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Planning Stability in Material Requirements Planning Systems
Planning Stability in Material Requirements Planning Systems
A Single-Item Inventory Model for a Nonstationary Demand Process
Manufacturing & Service Operations Management
Dynamic 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
Algorithms for stochastic CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Cost-Based Domain Filtering for Stochastic Constraint Programming
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Synthesizing filtering algorithms for global chance-constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Finding (α, ϑ)-solutions via sampled SCSPs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Filtering algorithms for global chance constraints
Artificial Intelligence
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 |
We consider a class of production/inventory control problems that has a single product and a single stocking location, for which a stochastic demand with a known non-stationary probability distribution is given. Under the widely-known replenishment cycle policy the problem of computing policy parameters under service level constraints has been modeled using various techniques. Tarim and Kingsman introduced a modeling strategy that constitutes the state-of-the-art approach for solving this problem. In this paper we identify two sources of approximation in Tarim and Kingsman's model and we propose an exact stochastic constraint programming approach. We build our approach on a novel concept, global chance-constraints, which we introduce in this paper. Solutions provided by our exact approach are employed to analyze the accuracy of the model developed by Tarim and Kingsman.