An improved heuristic for solving the economic lot scheduling problem in flow shops under power-of-two policy

Jia Yen Huang*, Ming-Jong Yao

*Corresponding author for this work

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

This paper proposes a new heuristic for solving the economic lot scheduling problem in flow shops under the Power-of-Two policy. A review of relevant literature shows that the heuristic in Ouenniche and Boctor [15] not only solves this problem with the best objective function value among the existing solution approaches, but also generates a feasible production schedule. However there are several problems when implementing Ouenniche and Boctor's heuristic. Therefore, we are motivated to propose an improved heuristic in this study. To evaluate the performance of the improved heuristic, a total of 1,800 instances were randomly generated and then solved by both solution approaches in our experiments. The numerical results conclude that the improved heuristic significantly outperforms Ouenniche and Boctor's heuristic.

原文English
頁(從 - 到)127-140
頁數14
期刊Journal of the Chinese Institute of Industrial Engineers
23
發行號2
DOIs
出版狀態Published - 1 一月 2006

指紋 深入研究「An improved heuristic for solving the economic lot scheduling problem in flow shops under power-of-two policy」主題。共同形成了獨特的指紋。

引用此