A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals

Hsueh Chien Cheng, Tsung Che Chiang, Li Chen Fu

研究成果: 雜誌貢獻會議論文同行評審

9 引文 斯高帕斯(Scopus)

摘要

The identical parallel batch machine scheduling problem is addressed in this paper. Incompatible job families and dynamic job arrivals are considered, and the objective is to minimize total weighted tardiness. A memetic algorithm is proposed to assign the batches to machines and to determine their processing sequences. The proposed approach is shown to outperform an existing approach in terms of solution quality and computational efficiency through comprehensive experiments.

原文英語
文章編號4811333
頁(從 - 到)541-546
頁數6
期刊Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs
出版狀態已發佈 - 2008
事件2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, 新加坡
持續時間: 2008 十月 122008 十月 15

ASJC Scopus subject areas

  • 電氣與電子工程
  • 控制與系統工程
  • 人機介面

指紋

深入研究「A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals」主題。共同形成了獨特的指紋。

引用此