Abstract

In this paper, we compare 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.

Item Type:

Article

Date Type:

Publication

Subjects:

Systems

Divisions:

College Of Computer Sciences and Engineering > Systems Engineering Dept