Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming

•We consider the inventory control problem under stochastic non-stationary demand.•We introduce a new algorithm to compute optimal (R, s, S) policy parameters.•The algorithm is a hybridisation of branch-and-bound and dynamic programming.•The computational results prove the performance of our method.