Mixed Integer Linear Programming for delivery planning in Joint Replenishment Problems

This paper deals with the Joint Replenishment Problem (JRP) in multi item and multi site settings based on the common cycle strategy. The proposed delivery planning method, in deterministic and constant demand environment, uses Mixed Integer Linear Programming (MILP) algorithm. It is shown that the proposed MILP method gives better results in terms of reduced total replenishment cost than the standard delivery policy for which there is a periodicity of delivery for all the pairs (product, site).