By Topic

Genetic algorithm application to the hybrid flow shop scheduling problem

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

2 Author(s)
Yong Zhan ; Coll. of Mech. & Electr. Eng., Harbin Eng. Univ., Harbin ; Changhua Qiu

The hybrid flow shop scheduling problem becomes more and more important, and has gained wide attention both in academic and engineering fields. this paper addresses an attempt to evolve genetic algorithm by a particular genetic programming method to solve this problem. In the algorithm proposed in this paper, the representation of chromosome is composed of two subparts: allocation string and sequencing string, which can be encode and decoded easily. In generating initial population, a special constraint of load balancing between parallel machines is used to reduce the number of individuals. And crossover operation and mutation operation based on evolutionary mechanism are used, so that the exploration and exploitation abilities of the algorithm can be well improved. At last, the scheduling problems of steel treatment jobshops in shipyard are used to evaluate the proposed algorithm, and numerical example shows good result.

Published in:

Mechatronics and Automation, 2008. ICMA 2008. IEEE International Conference on

Date of Conference:

5-8 Aug. 2008