By Topic

A hybrid genetic algorithm approach for the “no-wait” flowshop 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 $31
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

3 Author(s)
Gonazelez, B. ; Univ. Central de Venezuela, Caracas, Venezuela ; Torres, M. ; Moreno, J.A.

We describe a hybrid genetic algorithm (GA) approach to the no-wait flowshop scheduling problem using the minimize makespan as objective function. The GA approach described produces comparable or better results on benchmark flowshop problems than known heuristic methods. The representation used is a variant of one used on GA treatments of the travelling salesman problem (TSP). The genetic operators include edge recombination and three additional operators designed on analogy to known heuristic methods. Experiments show that these new operators are very effective in enhancing the performance of the traditional GA. The present approach also promises to effectively address the general job-shop problem

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995