In this paper, we consider the periodic review joint replenishment problem under the class of cyclic policies. For each item, the demand in the protection interval is assumed stochastic. Moreover, a fraction of shortage is lost, while the other quota is backordered. We suppose that lead times and minor ordering costs are controllable. The problem concerns determining the cyclic replenishment policy, the lead times, and the minor ordering costs in order to minimize the long‐run expected total cost per time unit. We established several properties of the cost function, which permit us to derive a heuristic algorithm. A lower bound on the minimum cost is obtained, which helps us to evaluate the effectiveness of the proposed heuristic. The heuristic is also compared with a hybrid genetic algorithm that is specifically developed for benchmarking purposes. Numerical experiments have been carried out to investigate the performance of the heuristic.
File in questo prodotto:
Non ci sono file associati a questo prodotto.