A new optimal algorithm for the joint replenishment problem

被引：42

作者：

Viswanathan, S

机构：

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1996年 / 47卷 / 07期

关键词：

inventory; joint-replenishment;

D O I：

10.2307/3010139

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we propose a new optimal algorithm for the Joint Replenishment Problem. The proposed algorithm can be used to determine the optimal strict-cyclic policy, as well as the optimal among all cyclic policies for the joint replenishment problem. Computational experiments on randomly generated problems reveal that the proposed algorithm performs better than existing optimal algorithms for the problem.

引用

页码：936 / 944

页数：9

共 7 条

[1]

Aksoy Y., 1988, International Journal of Operations & Production Management, V8, P63, DOI 10.1108/eb054814

[2] OPTIMAL PACKAGING FREQUENCY OF PRODUCTS JOINTLY REPLENISHED [J].