On optimal algorithms for the joint replenishment problem

On optimal algorithms for the joint replenishment problem

0.00 Avg rating0 Votes
Article ID: iaor20031758
Country: United Kingdom
Volume: 53
Issue: 11
Start Page Number: 1286
End Page Number: 1290
Publication Date: Nov 2002
Journal: Journal of the Operational Research Society
Authors:
Abstract:

In this paper, we demonstrate that the algorithm for determining the optimal strict cyclic policy for the Joint Replenishment Problem suggested by Fung and Ma does not guarantee an optimal solution. We propose a modification that will ensure that the algorithm obtains the optimal strict cyclic policy. We then perform a comprehensive computational study to compare the modified Fung and Ma algorithm with other optimal algorithms for the problem. The study reveals that the optimal algorithm of Viswanathan is computationally more efficient than other methods.

Reviews

Required fields are marked *. Your email address will not be published.