A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling

Tsung Che Chiang*, Hsiao Jou Lin

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

95 引文 斯高帕斯(Scopus)

摘要

This paper addresses the multiobjective flexible job shop scheduling problem (MOFJSP) regarding minimizing the makespan, total workload, and maximum workload. The problem is solved in a Pareto manner, whose goal is to seek for the set of Pareto optimal solutions. We propose a multiobjective evolutionary algorithm, which utilizes effective genetic operators and maintains population diversity carefully. A main feature of the proposed algorithm is its simplicity - it needs only two parameters. Performance of our algorithm is compared with seven state-of-the-art algorithms on fifteen popular benchmark instances. Only our algorithm can find 70% or more non-dominated solutions for every instance.

原文英語
頁(從 - 到)87-98
頁數12
期刊International Journal of Production Economics
141
發行號1
DOIs
出版狀態已發佈 - 2013 一月

ASJC Scopus subject areas

  • 商業、管理和會計 (全部)
  • 經濟學與計量經濟學
  • 管理科學與經營研究
  • 工業與製造工程

指紋

深入研究「A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling」主題。共同形成了獨特的指紋。

引用此