By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hsueh-Chien Cheng ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei ; Tsung-Che Chiang ; Li-Chen Fu

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.

Published in:

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

Date of Conference:

12-15 Oct. 2008