By Topic

A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines

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
$33 $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

2 Author(s)
Shubin Xu ; School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200030 China. He is now visiting to Charles H. Lundquist College of Business, University of Oregon, Eugene, OR 97403 USA. e-mail: sxu@uoregon.edu ; James C. Bean

In this paper, we study the scheduling problem of minimizing makespan on parallel non-identical batch processing machines. We formulate the scheduling problem into an integer programming model. Due to the difficulty of the problem, it is hard to solve the problem with standard mathematical programming software. We propose a genetic algorithm based on random keys encoding to address this problem. Computational results show that this genetic algorithm consistently finds a solution in a reasonable amount of computation time

Published in:

2007 IEEE Symposium on Computational Intelligence in Scheduling

Date of Conference:

1-5 April 2007