By Topic

A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems

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)
Hongbo Liu ; Sch. of Comput. Sci., Dalian Maritime Univ., Dalian ; Abraham, A. ; Grosan, C.

This paper introduces a hybrid metaheuristic, the variable neighborhood particle swarm optimization (VNPSO), consisting of a combination of the variable neighborhood search (VNS) and particle swarm optimization (PSO). The proposed VNPSO method is used for solving the multi-objective flexible job-shop scheduling problems (FJSP). The details of implementation for the multi-objective FJSP and the corresponding computational experiments are reported. The results indicate that the proposed algorithm is an efficient approach for the multi-objective FJSP. especially for large scale problems.

Published in:

Digital Information Management, 2007. ICDIM '07. 2nd International Conference on  (Volume:1 )

Date of Conference:

28-31 Oct. 2007