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

Author

Liu, Hongbo ; Abraham, Ajith ; Grosan, Crina

Author_Institution

Sch. of Comput. Sci., Dalian Maritime Univ., Dalian

Volume

1

fYear

2007

fDate

28-31 Oct. 2007

Firstpage

138

Lastpage

145

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.

Keywords

job shop scheduling; particle swarm optimisation; search problems; hybrid metaheuristic; multiobjective flexible job-shop scheduling problems; variable neighborhood particle swarm optimization; variable neighborhood search; Computer science; Genetic algorithms; Humans; Job shop scheduling; Large-scale systems; Particle swarm optimization; Processor scheduling; Quality of service; Routing; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Information Management, 2007. ICDIM '07. 2nd International Conference on

Conference_Location

Lyon

Print_ISBN

978-1-4244-1475-8

Electronic_ISBN

978-1-4244-1476-5

Type

conf

DOI

10.1109/ICDIM.2007.4444214

Filename

4444214