A hybrid discrete particle swarm algorithm for open-shop problems

Authors:
Qingyun Yang;Jigui Sun;Juyang Zhang;Chunjie Wang
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China;Basic Sciences of ChangChun University of Technology, ChangChun University of Technology, Changchun, China
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 5
Cited 0

Variable neighborhood search

Computers and Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems

Proceedings of the 5th International Conference on Genetic Algorithms
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems

Computers and Industrial Engineering
Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hybrid discrete particle swarm algorithm is presented in this paper to solve open-shop problems. The operations are redefined in the discrete particle swarm algorithm. To improve the performance the simulated annealing algorithm is combined with discrete particle swarm. We use SA to enhance the results of local best positions instead of current positions. The experimental results show that our hybrid discrete particle swarm algorithm is effective and efficient to solve open-shop problems.