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

Research output: Contribution to journalConference article

8 Citations (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.

Original languageEnglish
Article number4811333
Pages (from-to)541-546
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Publication statusPublished - 2008 Dec 1
Event2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore
Duration: 2008 Oct 122008 Oct 15



  • Batch scheduling
  • Memetic algorithm
  • Parallel machine
  • Total weighted tardiness

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Cite this