The Comparison of Performance for Solving the Economic Lot Inspection and Scheduling Problem by Using the Power of Two and General Integer Policies

• Main Authors: Chan, Chih-Chin, 詹智欽
• Other Authors: Chang, Yu-Jen
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/49440334814315713495

碩士 === 東海大學 === 資訊管理學系 === 99 === In this paper, we present a study on the Economic Lot Inspection and Scheduling Problem (ELISP) in an imperfect production/inventory system. It addresses the problem of cyclic production and inspection schedules of multi-items in one facility as minimizing the total cost per unit time. Inspection plays an important role which saves the cost from producing defective items though they incur extra inspection cost at the same time. It would avoid the defective units be sent to customer and save a large warranty or returning costs. The concerned problem is an extension of the Economic Lot Scheduling Problem, and we solve the ELISP under the extended basic period and basic period approaches by using the general integer policy in this study. We propose a genetic algorithm for obtaining close-to-optimal solutions. Furthermore, we compare the performance for solving the economic lot inspection and scheduling problem by using the power of two and general integer policies. Our proposed algorithm could be a favorable decision support tool for managers in industries to efficiently obtain their production scheduling and lot-sizing strategies for deteriorating items.