Effective heuristics for the dynamic demand joint replenishment problem
- First Online:
- Cite this article as:
- Robinson, E., Narayanan, A. & Gao, LL. J Oper Res Soc (2007) 58: 808. doi:10.1057/palgrave.jors.2602197
- 4 Views
This paper considers the dynamic demand joint replenishment problem where there is a joint setup cost in each time period when any member of the product family is replenished and a separate setup cost for each different item replenished. We present two forward-pass heuristics, a two-phase heuristic, and a simulated annealing metaheuristic (SAM) and investigate their relative effectiveness in solving a comprehensive set of test problems. The experimental results indicate the two-phase heuristic and the SAM perform better than existing approaches for the problem.