Solving the Economic Lot and Inspection Scheduling Problem Using the Extended Basic Period Approach under Power-of-Two policy

Ming-Jong Yao*, Shih Chieh Chen, Yu Jen Chang, Tsueng Yao Tseng

*Corresponding author for this work

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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. The objective of the ELISP is to determine an optimal cycle time and an optimal production and inspection schedule so as to minimize the total cost per unit time. Under PoT policy, we formulate a mathematical model by taking into account the constraints for both production and inspection capacities. Also, we propose a Hybrid Genetic Algorithm (HGA) which is equipped with a search algorithm that not only seeks to improve solution quality, but also assures a feasible solution for each chromosome obtained from the evolutionary processes. Our numerical experiments show that the proposed HGA effectively solves the ELISP using the EBP approach, and its solutions outperform the solutions from the ELISP using the Common Cycle approach.

原文English
頁(從 - 到)43-60
頁數18
期刊Journal of the Chinese Institute of Industrial Engineers
29
發行號1
DOIs
出版狀態Published - 1 一月 2012

指紋 深入研究「Solving the Economic Lot and Inspection Scheduling Problem Using the Extended Basic Period Approach under Power-of-Two policy」主題。共同形成了獨特的指紋。

引用此