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.
|頁（從 - 到）||541-546|
|期刊||Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics|
|出版狀態||已發佈 - 2008|
|事件||2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, 新加坡|
持續時間: 2008 十月 12 → 2008 十月 15
ASJC Scopus subject areas