By Topic

Evaluation of mutation heuristics for solving a multiobjective flexible job shop by an evolutionary 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
$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)

This paper considers the solving of a multiobjective flexible job shop problem. This scheduling problem has two main characteristics: first, the flexibility of machines that have the potential to process all the operations with different processing times, and secondly taking into account the three criteria to be optimized simultaneously. The solving of this problem is based on a multiobjective evolutionary algorithm utilizing Pareto dominance. It makes use of direct coding of the solutions and exploits the NSGA II algorithm. A set of mutation heuristics are proposed in a view to direct mutation towards the best solutions. The efficiencies of these heuristics are compared with one another and also with lower bounds for every criteria.

Published in:

Systems, Man and Cybernetics, 2002 IEEE International Conference on  (Volume:5 )

Date of Conference:

6-9 Oct. 2002