By Topic

Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search

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)
Nhu Binh Ho ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore ; Joe Cing Tay

Finding realistic schedules for flexible job shop problems has attracted many researchers recently due to its nondeterministic polynomial time (NP) hardness. In this paper, we present an efficient approach for solving the multiple-objective flexible job shop by combining evolutionary algorithm and guided local search (GLS). Instead of applying random local search to find neighboring solutions, we introduce a GLS procedure to accelerate the process of convergence to Pare to-optimal solutions. The main improvement of this combination is to help diversify the population toward the Pareto front. A branch and bound algorithm for finding the lower bounds of multiple-objective solutions is also proposed. Experimental results indicate that the multiple-objective Pareto-optimal solutions of our algorithms dominate previous designs for solving the same benchmarks while incurring less computational time.

Published in:

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on  (Volume:38 ,  Issue: 5 )