Cart (Loading....) | Create Account
Close category search window
 

Multi-objective scheduling problems subjected to special process constraint

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

4 Author(s)
Jiaquan Gao ; Zhijiang Coll., Zhejiang Univ. of Technol., Hangzhou ; Guixia He ; Yushun Wang ; Feng Liu

The problem of parallel machine multi-objective scheduling subjected to special process constraint in the textile industries, as one of the most important combinational optimization problems, is different from other parallel machine scheduling problems in the following characteristics. On one hand, processing machines are non-identical; on the other hand, the sort of job processed on every machine can be restricted Considering one of the multi-objective problems, either minimizing the maximum completion time among all the machines(makespan) or minimizing the total earliness/tardiness penalty of all the jobs has been cornerstone of most studies done so far. However, under special process constraint, taking them into account as a multi-objective problem has not been well studied Therefore, in this paper, a multi-objective model based on them is presented and a new parallel genetic algorithm based on a vector group coding method is also proposed in order to effectively solve this model. The algorithm shows the following advantages: the coding method is simple and can effectively reflect the virtual scheduling policy, which can vividly reflect the numbers and sequences of these processed jobs on every machine, and then enables the individuals generated by crossover and mutation to satisfy process constraint. Numerical experiments show that it is efficient, and is better than the common genetic algorithm, and has the better parallel efficiency. A much better prospect of application can be optimistically expected.

Published in:

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference:

1-6 June 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.