COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM

被引：12

作者：

BENDAYA, M ^{[1
]}

HARIGA, M ^{[1
]}

机构：

[1] KING SAUD UNIV,RIYADH 11451,SAUDI ARABIA

来源：

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 1995年 / 23卷 / 03期

关键词：

INVENTORY; JOINT REPLENISHMENT; MULTIITEM; HEURISTIC; SIMULATION;

D O I：

10.1016/0305-0483(95)00009-D

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：341 / 344

页数：4

共 7 条

[1] DETERMINATION OF OPTIMUM PACKAGING FREQUENCY OF ITEMS JOINTLY REPLENISHED [J].