A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

Tsung Che Chiang, Hsueh Chien Cheng, Li Chen Fu*

*此作品的通信作者

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

54 引文 斯高帕斯(Scopus)

摘要

This paper addresses a scheduling problem motivated by scheduling of diffusion operations in the wafer fabrication facility. In the target problem, jobs arrive at the batch machines at different time instants, and only jobs belonging to the same family can be processed together. Parallel batch machine scheduling typically consists of three types of decisionsbatch forming, machine assignment, and batch sequencing. We propose a memetic algorithm with a new genome encoding scheme to search for the optimal or near-optimal batch formation and batch sequence simultaneously. Machine assignment is resolved in the proposed decoding scheme. Crossover and mutation operators suitable for the proposed encoding scheme are also devised. Through the experiment with 4860 problem instances of various characteristics including the number of machines, the number of jobs, and so on, the proposed algorithm demonstrates its advantages over a recently proposed benchmark algorithm in terms of both solution quality and computational efficiency.

原文英語
頁(從 - 到)2257-2269
頁數13
期刊Computers and Operations Research
37
發行號12
DOIs
出版狀態已發佈 - 2010 十二月

ASJC Scopus subject areas

  • 電腦科學(全部)
  • 建模與模擬
  • 管理科學與經營研究

指紋

深入研究「A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival」主題。共同形成了獨特的指紋。

引用此