By Topic

Pareto-optimality approach based on uniform design and fuzzy evolutionary algorithms for flexible job-shop scheduling problems (FJSPs)

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

3 Author(s)
Kacem, I. ; Lab. d''Automatique et Informatique de Lille, Ecole Centrale de Lille, Villeneuve d''Ascq, France ; Hammadi, S. ; Borne, P.

In our previous work (2002), we have proposed a Pareto-optimality approach for solving multiobjective optimization problems (MOPs) based on the hybridization of fuzzy logic and evolutionary algorithms (EAs). Such an approach makes it possible to construct a set of satisfactory solutions in order to provide flexibility to the decision-maker. In this work, we aim to enhance the suggested approach and propose a new variant of such a hybridization. Thereafter, we show how a uniform design can be used for finding a set of Pareto optimality solutions uniformly scattered. We briefly describe the Pareto-optimality concepts used for solving MOPs and those especially applied in EAs. Then, the mathematical formulation of FJSP is presented. The proposed hybrid approach is described. We illustrate the suggested approach by applying it to solving FJSP and highlights some practical aspects of the application of such an approach for solving hard combinatorial problems. Finally, we conclude with some future research directions.

Published in:

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

Date of Conference:

6-9 Oct. 2002