Constraint programming for computing non-stationary (R, S) inventory policies

This paper proposes a constraint programming model for computing the finite horizon single-item inventory problem with stochastic demands in discrete time periods with service-level constraints under the non-stationary version of the "periodic review, order-up-to-level" policy (i.e., non-stationary (R, S) or, simply (Rn, Sn)). It is observed that the modeling process is more natural and the required number of variables is smaller compared to the MIP formulation of the same problem. The computational tests show that the CP approach is more tractable than the conventional MIP formulation. Two different domain reduction methods are proposed to improve the computational performance of solution algorithms. The numerical experiments confirmed the effectiveness of these methods.