On the Joint Replenishment Problem under General-Integer Policy

Tunghai University Institutional Repository > 工學院 > 工學院 > 東海學報 > Item 310901/20806

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://140.128.103.80:8080/handle/310901/20806

题名:	On the Joint Replenishment Problem under General-Integer Policy
作者:	姚銘忠、?芳娟 Ming-Jong Yao and Fang-Chuan Lee
贡献者:	東海大學工學院
关键词:	Inventory, Scheduling, Lot size, Global optimum
日期:	2001-07
上传时间:	2013-03-26T09:01:07Z (UTC)
出版者:	台中市：東海大學
摘要:	This study performs theoretical analysis on the Joint Replenishment Problem (JRP) under General-Integer (GI) policy. The JRP models concern how to determine lot sizes and to schedule replenishment times for products so as to minimize the total costs per unit time. GI policy requires replenishment frequency of each product, denoted by ki, to be a general integer, i.e., ki = 1, 2, 3, …. In this study, we utilize a 10-product example to graphically present the curve of the optimal total cost with respect to the values of basic period. Under GI policy, we discover an interesting property on the optimal curve for the JRP, and we prove that the optimality structure of the JRP is piece-wise convex. By making use of the junction points in the optimality structure, we derive an effective (polynomial-time) search algorithm to secure a global solution for the JRP under GI policy. Evidently, we provide a numerical example to demonstrate the efficiency of the proposed algorithm.
關聯:	東海大學東海學報第42卷, p.23-40
显示于类别:	[工學院] 東海學報

文件中的档案:

档案	大小	格式	浏览次数
42-3.pdf	272Kb	Adobe PDF	745	检视/开启

在THUIR中所有的数据项都受到原著作权保护.