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

Author

Cheng, Hsueh-Chien ; Chiang, Tsung-Che ; Fu, Li-Chen

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei

fYear

2008

fDate

12-15 Oct. 2008

Firstpage

541

Lastpage

546

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 processing (computers); parallel machines; processor scheduling; resource allocation; dynamic job arrivals; identical parallel batch machine scheduling problem; incompatible job families; memetic algorithm; processing sequences; Biological cells; Data analysis; Data engineering; Drives; Dynamic scheduling; Electronic mail; Evolutionary computation; Fuzzy sets; Machine learning algorithms; Scheduling algorithm; batch scheduling; memetic algorithm; parallel machine; total weighted tardiness;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man and Cybernetics, 2008. SMC 2008. IEEE International Conference on

Conference_Location

Singapore

ISSN

1062-922X

Print_ISBN

978-1-4244-2383-5

Electronic_ISBN

1062-922X

Type

conf

DOI

10.1109/ICSMC.2008.4811333

Filename

4811333