This article addresses the problem of scheduling the replenishment of items to be delivered to multiple buyers from a single provider in order to minimize the total cost including the inventory holding cost, a major ordering cost for each period of replenishment, a minor ordering cost for each item included in a replenishment, and the routing cost. This problem can be modelled as an integer non linear program. The solution methodology is based on Constraint Programming. Experimentation of the proposed model and the solution approach is reported.