By Topic

Solving Permutation Problems with Differential Evolution: An Application to the Jobshop 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
$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

3 Author(s)
Antonin Ponsich ; Dept. de Comput., CINVESTAV-IPN, Mexico City, Mexico ; Ma. Guadalupe Castillo Tapia ; Carlos A. Coello Coello

This study addresses the solution of jobshop scheduling problems using differential evolution (DE). The issue of representing permutations through real numbers constitutes the key issue for developing an efficient implementation. Several techniques are empirically validated on problem instances traditionally adopted in the specialized literature. We also present a simple hybridization of DE with tabu search, which produces significant performance gains.

Published in:

2009 Ninth International Conference on Intelligent Systems Design and Applications

Date of Conference:

Nov. 30 2009-Dec. 2 2009