Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment

Tsung Che Chiang*, Li Chen Fu

*此作品的通信作者

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

5 引文 斯高帕斯(Scopus)

摘要

A job shop scheduling problem with total tardiness and the maximum tardiness as objectives is addressed. We solve it by a rule-coded genetic algorithm. Characteristics of three existing fitness assignment mechanisms are identified and then combined through the proposed cyclic fitness assignment mechanism. Experiments are conducted on a public benchmark problem set, and the results show that the proposed algorithm outperforms the existing ones.

原文英語
主出版物標題2006 IEEE Congress on Evolutionary Computation, CEC 2006
頁面3266-3273
頁數8
出版狀態已發佈 - 2006
對外發佈
事件2006 IEEE Congress on Evolutionary Computation, CEC 2006 - Vancouver, BC, 加拿大
持續時間: 2006 7月 162006 7月 21

出版系列

名字2006 IEEE Congress on Evolutionary Computation, CEC 2006

其他

其他2006 IEEE Congress on Evolutionary Computation, CEC 2006
國家/地區加拿大
城市Vancouver, BC
期間2006/07/162006/07/21

ASJC Scopus subject areas

  • 人工智慧
  • 軟體
  • 理論電腦科學

指紋

深入研究「Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment」主題。共同形成了獨特的指紋。

引用此