Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems

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.

DOI: 10.1007/11903697_26

Extracted Key Phrases

5 Figures and Tables

Statistics

0102020072008200920102011201220132014201520162017
Citations per Year

73 Citations

Semantic Scholar estimates that this publication has 73 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Liu2006VariableNP, title={Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems}, author={Hongbo Liu and Ajith Abraham and Okkyung Choi and Seong Hwan Moon}, booktitle={SEAL}, year={2006} }