Article ID: | iaor1996417 |
Country: | United Kingdom |
Volume: | 23 |
Issue: | 3 |
Start Page Number: | 341 |
End Page Number: | 344 |
Publication Date: | Jun 1995 |
Journal: | OMEGA |
Authors: | Hariga M., Ben-Daya M. |
Keywords: | heuristics |
This paper compares recent efficient heuristics proposed for solving the joint replenishment problem. A heuristic based on the relaxation of a nonlinear programming formulation of the problem proposed by Hariga is the most efficient heuristic for solving the joint replenishment problem in view of its speed and quality of solution.