Abstract
A solution procedure is provided for solving the joint replenishment problem using a basic cycle approach. The solution procedure is very simple, and involves comparing possible values between the ‘minimum’ and ‘maximum’ cycle times. Extensive simulation demonstrates that this solution procedure is superior to previously known algorithms for solving this problem.