Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems

  • Authors:
  • Hongbo Liu;Ajith Abraham;Okkyung Choi;Seong Hwan Moon

  • Affiliations:
  • School of Computer Science, Dalian Maritime University, Dalian, China;School of Computer Science, Dalian Maritime University, Dalian, China;School of Computer Science and Engineering, Chung-Ang University, Seoul, Korea;Department of Science and Technology, Education for Life, Seoul National University of Education, Seoul, Korea

  • Venue:
  • SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.