The Joint Replenishment Problem with Warehouse-Space Restriction

• Main Authors: Yen-Fei Lin, 林晏妃
• Other Authors: Ming-Jong Yao
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/61939675595710042352

碩士 === 東海大學 === 工業工程與經營資訊學系 === 92 === This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts the warehouse-space restrictions. The focus of this study is to determine the lot sizes of each product under power-of-two policy to minimize the total costs per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space. In order to test the feasibility of any given solution, we propose a new heuristic, namely, Proc FT. Also, we propose a search algorithm and a genetic algorithm to secure the optimal solution (i.e., the replenishment frequencies of multiple products and the basic period) in this study. By our numerical experiments, we demonstrate that both solution approaches could effectively solve the JRP with warehouse-space restrictions. Also, for the decision makers who face this problem, we provide the guidelines to take an appropriate solution approach as their decision-support tool under different decision-making scenarios.