Multiobjective permutation flow shop scheduling using MOEA/D with local search

Yu Teng Chang, Tsung Che Chiang

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

5 引文 斯高帕斯(Scopus)

摘要

This paper addresses the multiobjective permutation flow shop scheduling problem, where makespan and total flow time are to be minimized simultaneously. We solve the problem by an extended version of the multiobjective evolutionary algorithm based on decomposition (MOEA/D). We investigate the effects of scalarization functions and the replacement mechanism. We also incorporate local search into MOEA/D and investigate design issues including individuals to do local search and resource allocation. Experiments are conducted on 90 public problem instances with different scale, and research findings are reported. Comparing with the state of the art, our algorithm shows competitive performance on small-scale instances and superior performance on medium- and large-scale instances.

原文英語
主出版物標題TAAI 2016 - 2016 Conference on Technologies and Applications of Artificial Intelligence, Proceedings
發行者Institute of Electrical and Electronics Engineers Inc.
頁面262-269
頁數8
ISBN(電子)9781509057320
DOIs
出版狀態已發佈 - 2017 3月 16
事件2016 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2016 - Hsinchu, 臺灣
持續時間: 2016 11月 252016 11月 27

出版系列

名字TAAI 2016 - 2016 Conference on Technologies and Applications of Artificial Intelligence, Proceedings

其他

其他2016 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2016
國家/地區臺灣
城市Hsinchu
期間2016/11/252016/11/27

ASJC Scopus subject areas

  • 人工智慧
  • 電腦網路與通信
  • 電腦科學應用
  • 控制和優化
  • 資訊系統

指紋

深入研究「Multiobjective permutation flow shop scheduling using MOEA/D with local search」主題。共同形成了獨特的指紋。

引用此