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

doi:10.1109/ICSMC.2008.4811333

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 journal › Conference article › peer-review

10 Citations (Scopus)

Abstract

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 language	English
Article number	4811333
Pages (from-to)	541-546
Number of pages	6
Journal	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs	https://doi.org/10.1109/ICSMC.2008.4811333
Publication status	Published - 2008
Externally published	Yes
Event	2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore Duration: 2008 Oct 12 → 2008 Oct 15

Keywords

Batch scheduling
Memetic algorithm
Parallel machine
Total weighted tardiness

ASJC Scopus subject areas

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

Access to Document

10.1109/ICSMC.2008.4811333

Cite this

@article{d6584eeb84db449db1ac68e2ed602635,

title = "A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals",

abstract = "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.",

keywords = "Batch scheduling, Memetic algorithm, Parallel machine, Total weighted tardiness",

author = "Cheng, {Hsueh Chien} and Chiang, {Tsung Che} and Fu, {Li Chen}",

year = "2008",

doi = "10.1109/ICSMC.2008.4811333",

language = "English",

pages = "541--546",

journal = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

issn = "1062-922X",

note = "2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 ; Conference date: 12-10-2008 Through 15-10-2008",

}

TY - JOUR

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

AU - Cheng, Hsueh Chien

AU - Chiang, Tsung Che

AU - Fu, Li Chen

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Batch scheduling

KW - Memetic algorithm

KW - Parallel machine

KW - Total weighted tardiness

UR - http://www.scopus.com/inward/record.url?scp=69949177574&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69949177574&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2008.4811333

DO - 10.1109/ICSMC.2008.4811333

M3 - Conference article

AN - SCOPUS:69949177574

SN - 1062-922X

SP - 541

EP - 546

JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

M1 - 4811333

T2 - 2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008

Y2 - 12 October 2008 through 15 October 2008

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this