Multiobjective permutation flowshop scheduling by an adaptive genetic local search algorithm

Hsueh Chien Cheng, Tsung Che Chiang, Li Chen Fu

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

3 引文 斯高帕斯(Scopus)

摘要

The multiobjective flowshop problem with makespan and total flow time as objectives is addressed. A genetic local search algorithm is proposed with the ability to allocate the computational resources through the dynamic population size and local search intensity. The proposed method is compared with existing algorithms for flowshop scheduling with a public benchmark problem set. The experimental results show that the proposed method is capable of discovering solutions with better quality and diversity. The proposed method yields the best known nondominated solutions for the commonly studied permutation flowshop benchmarks, and the set of best known solutions is useful for the evaluation of performance of future studies.

原文英語
主出版物標題2008 IEEE Congress on Evolutionary Computation, CEC 2008
頁面1596-1602
頁數7
DOIs
出版狀態已發佈 - 2008 十一月 14
事件2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, 中国
持續時間: 2008 六月 12008 六月 6

出版系列

名字2008 IEEE Congress on Evolutionary Computation, CEC 2008

其他

其他2008 IEEE Congress on Evolutionary Computation, CEC 2008
國家/地區中国
城市Hong Kong
期間2008/06/012008/06/06

ASJC Scopus subject areas

  • 計算機理論與數學
  • 理論電腦科學

指紋

深入研究「Multiobjective permutation flowshop scheduling by an adaptive genetic local search algorithm」主題。共同形成了獨特的指紋。

引用此