A Novel Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems
Cached
Download Links
- [www.softcomputing.net]
- [falklands.globat.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 2 - 0 self |
BibTeX
@MISC{Liu_anovel,
author = {Hongbo Liu and Ajith Abraham and Crina Grosan and Ningning Li},
title = {A Novel Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 multiobjective 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. 1
