Multiobjective job shop scheduling using rule-coded genetic local search

Tsung Che Chiang*, Li Chen Fu

*此作品的通信作者

研究成果: 會議貢獻類型會議論文同行評審

2 引文 斯高帕斯(Scopus)

摘要

The multiobjective job shop scheduling problem with mean tardiness and the maximum tardiness as the objectives is addressed. A genetic local search algorithm is proposed with several features. First, it uses a dispatching rule-based genome encoding scheme, and the encoded dispatching rules are chosen carefully. Second, its mating selection mechanism combines the advantages of two representative ones in the literature. Third, it enhances a recently proposed population-based local search procedure. The benefits of the proposed idea are verified through experiments on a public benchmark problem set. In the experiments, the proposed algorithm is also shown to significantly outperform a recent algorithm specific to the multiobjective job shop scheduling problem.

原文英語
頁面1764-1775
頁數12
出版狀態已發佈 - 2006 十二月 1
事件36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, 臺灣
持續時間: 2006 六月 202006 六月 23

其他

其他36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
國家/地區臺灣
城市Taipei
期間2006/06/202006/06/23

ASJC Scopus subject areas

  • 工業與製造工程

指紋

深入研究「Multiobjective job shop scheduling using rule-coded genetic local search」主題。共同形成了獨特的指紋。

引用此