An efficient optimal solution method for the joint replenishment problem with minimum order quantities
We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We derive bounds on the basic cycle time and we propose an efficient global optimisation procedure to solve the JRP with constraints. Moreover, we also consider the case where a correction is made for empty replenishment occasions. The algorithms are tested with data from a real case and some additional numerical experiments are also presented.
|Keywords||inventory, joint replenishment, minimum order quantities|
|Persistent URL||dx.doi.org/10.1016/j.ejor.2005.02.056, hdl.handle.net/1765/15450|
Porras Musalem, E., & Dekker, R.. (2006). An efficient optimal solution method for the joint replenishment problem with minimum order quantities. European Journal of Operational Research, 174(3), 1595–1615. doi:10.1016/j.ejor.2005.02.056