Multiobjective permutation flow shop scheduling using a memetic algorithm with an NEH-based local search

Tsung Che Chiang*, Hsueh Chien Cheng, Li Chen Fu

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

2 引文 斯高帕斯(Scopus)

摘要

In this paper we address scheduling of the permutation flow shop with minimization of makespan and total flow time as the objectives. We propose a memetic algorithm (MA) to search for the set of non-dominated solutions (the Pareto optimal solutions). The proposed MA adopts the permutation-based encoding and the fitness assignment mechanism of NSGA-II. The main feature is the introduction of an NEH-based neighborhood function into the local search procedure. We also adjust the size of the neighborhood dynamically during the execution of the MA to strike a balance between exploration and exploitation. Forty public benchmark problem instances are used to compare the performance of our MA with that of twenty-seven existing algorithms. Our MA provides close performance for small-scale instances and much better performance for large-scale instances. It also updates more than 90% of the net set of non-dominated solutions for the large-scale instances.

原文英語
主出版物標題Emerging Intelligent Computing Technology and Applications - 5th International Conference on Intelligent Computing, ICIC 2009, Proceedings
頁面813-825
頁數13
DOIs
出版狀態已發佈 - 2009
事件5th International Conference on Intelligent Computing, ICIC 2009 - Ulsan, 大韓民國
持續時間: 2009 九月 162009 九月 19

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5754 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

其他

其他5th International Conference on Intelligent Computing, ICIC 2009
國家/地區大韓民國
城市Ulsan
期間2009/09/162009/09/19

ASJC Scopus subject areas

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「Multiobjective permutation flow shop scheduling using a memetic algorithm with an NEH-based local search」主題。共同形成了獨特的指紋。

引用此