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

Neural network applied to the coevolution of the memetic algorithm for solving the makespan minimization problem in parallel machine scheduling

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)
Bonfim, T.R. ; Sch. of Electr. & Comput. Eng., State Univ. of Campinas, Brazil ; Yamakami, A.

The problem discussed here is one of scheduling the tasks in identical parallel machines. In this problem, we deal with a set of n tasks and m identical parallel machines, with the objective of minimizing the makespan. The makespan is the total processing time of the most busy machine. This work presents an implementation of a memetic-neuro scheduler for solving this scheduling problem. The memetic algorithm, which is an hybrid version of genetic algorithm with local search, has been used to evolve good scheduling forms; and the neural network has been used to calculate the fitness for each individual of the population.

Published in:

Neural Networks, 2002. SBRN 2002. Proceedings. VII Brazilian Symposium on

Date of Conference:


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.