Article ID: | iaor20041946 |
Country: | United Kingdom |
Volume: | 30 |
Issue: | 9 |
Start Page Number: | 1319 |
End Page Number: | 1333 |
Publication Date: | Aug 2003 |
Journal: | Computers and Operations Research |
Authors: | Yao Ming-Jong, Lee Fang-Chuan |
Keywords: | scheduling, optimization |
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