A Global Optimum Search Algorithm for the Joint Replenishment Problem under Power-of-Two Policy

• Main Authors: Fang-Chuan Lee, 李芳娟
• Other Authors: Ming-Jong Yao
• Format: Others
• Language: en_US
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/16030425895654530441

碩士 === 東海大學 === 工業工程學系 === 89 === In this study, we perform theoretical analysis and derive a global optimum search algorithm for the Joint Replenishment Problem (JRP) under Power-of-Two (PoT) 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. PoT policy requires replenishment frequency of each product, denoted by ki, to be a PoT integer, i.e., ki = 2p where p = 0, 1, 2, …. By utilizing a 10-product example, we graphically present the curve of the optimal total cost with respect to the values of basic period. Under PoT policy, 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 search algorithm to secure a global optimal solution for the JRP under PoT policy. Evidently, we provide a numerical example to demonstrate the efficiency of the proposed algorithm.