DocumentCode
3383476
Title
Flexible job-shop scheduling study based on multi-swarm hybrid particle swarm arithmetic
Author
Xuejing, Yu ; Huangxin, Gu ; Xuelian, Yu
Author_Institution
Dept. of Inf. Broadcast, Ind. Univ. of Changchun, Changchun, China
Volume
3
fYear
2010
fDate
9-10 Oct. 2010
Firstpage
218
Lastpage
221
Abstract
Due to the complex computation and restrictive condition in flexible job-shop scheduling problem, common arithmetic can not get best solution. The article makes use of multi-swarm hybrid particle swarm arithmetic to solve the problem. Through multi-swarm evolution simultaneity and best solution concentration, the arithmetic´s efficiency is increased to get better flexible job-shop scheduling. The emulation experiment shows that the arithmetic can solve flexible job-shop scheduling problem effectively.
Keywords
fuzzy set theory; job shop scheduling; particle swarm optimisation; arithmetic efficiency; flexible job-shop scheduling problem; fuzzy aim; multiswarm evolution; multiswarm hybrid particle swarm arithmetic; flexible job-shop scheduling; fuzzy aim; hybrid particle swarm arithmetic; multi-swarm;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Information Technology and Management Engineering (FITME), 2010 International Conference on
Conference_Location
Changzhou
Print_ISBN
978-1-4244-9087-5
Type
conf
DOI
10.1109/FITME.2010.5654692
Filename
5654692
Link To Document