By Topic

Parallel machine scheduling optimization based on roulette probability assignment encoding

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)
Liu Zhixiong ; Coll. of Machinery & Autom., Wuhan Univ. of Sci. & Technol., Wuhan, China ; Yang Guangxiang

Evolutionary strategy algorithm is employed to optimize the parallel machine scheduling problem, and a new kinds of the encoding method based on roulette probability assignment is introduced. The individual gene is sequenced and the probability of each gene is evaluated. Then, the solution of the parallel scheduling would be obtained while the machine assignment is achieved by the roulette. The initialization condition of the encoding based on roulette probability assignment is analyzed. A kind of recombination operation based on three-point crossover and interchange is used to generate the offspring individuals, and a kind of mutation operation is designed that some gene in the encoding is stochastically generated. From the computational results of two parallel machine scheduling problems, particle swam optimization algorithm based on roulette probability assignment encoding can effectively optimize the parallel machine scheduling problems, the encoding method based on roulette probability assignment can effectively avoid the infeasible schedule solution.

Published in:

Control Conference (CCC), 2010 29th Chinese

Date of Conference:

29-31 July 2010