By Topic

Scheduling multi-processor tasks with resource and timing constraints using genetic algorithm

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)
Shu-Chen Cheng ; Dept. of Eng. Sci., Nat. Cheng Kung Univ., Tainan, Taiwan ; Yueh-Min Huang

The job-shop scheduling problems have been categorized as NP-complete problems. The exponential growth of the time required to obtain an optimal solution makes the exhaustive search for global optimal schedules very difficult or even impossible. Recently, genetic algorithms have shown the feasibility to solve the job-shop scheduling problems. However, a pure GA-based approach tends to generate illegal schedules due to the crossover and the mutation operators, it is often the case that the gene expression or the genetic operators need to be specially designed to fit the problem domain or some other schemes may be combined to solve the scheduling problems. This paper presents a GA-based approach with a feasible energy function to generate good-quality schedules. In our work, we design an easy-understood genotype to generate legal schedules and the proposed approach converges rapidly.

Published in:

Computational Intelligence in Robotics and Automation, 2003. Proceedings. 2003 IEEE International Symposium on  (Volume:2 )

Date of Conference:

16-20 July 2003