Solving the Economic Lot and Inspection Scheduling Problem Using the Extended Basic Period Approach

摘要

The focus of this study is to solve the Economic Lot and Inspection Scheduling Problem (ELISP) using the Extended Basic Period (EBP) approach under Power-of-Two (PoT) policy. This paper is an extension study of the conventional Economic Lot Scheduling Problem, and its objective is to determine an optimal cycle time and an optimal production and inspection schedule so as to minimize the total cost per unit time. We formulate a mathematical model by taking into accounts the constraints for both production capacity and inspection capacity. Also, we propose a genetic algorithm (GA) and a four-phase heuristic for obtaining a close-to-optimal solution. Our numerical results demonstrate that the proposed GA is an efficient solution approach for solving the ELISP.