Tarim S.A.Hnich B.Rossi R.Prestwich S.2023-06-162023-06-1620079.78E+120302-9743https://doi.org/10.1007/978-3-540-73817-6_11https://hdl.handle.net/20.500.14365/339411th Annual European Research Consortium for Informatics and Mathematics (ERCIM) International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 -- 26 June 2006 through 26 June 2006 -- Caparica -- 71137An interesting class of production/inventory control problems considers a single product and a single stocking location, given a stochastic demand with a known non-stationary probability distribution. 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 a cost-based filtering method. Our algorithm can solve to optimality instances of realistic size much more efficiently than previous approaches, often with no search effort at all. © Springer-Verlag Berlin Heidelberg 2007.eninfo:eu-repo/semantics/openAccessAlgorithmsCustomer satisfactionInventory controlProbability distributionsProblem solvingCost-based filtering methodCustomer demandsInventory systemService levelStochastic control systemsConference Object10.1007/978-3-540-73817-6_112-s2.0-38049115196