Title :
Flow shop scheduling problem using hybrid quantum particle swarm optimization algorithm(HQPSO)
Author_Institution :
Electron. Inf. Sch., Shanghai Dianji Univ., Shanghai, China
Abstract :
The flow shop scheduling problem is a combinatorial optimization problem known to be NP-hard, which has captured the interest of a great number of researchers. Many different methods have been applied to solve FSSP and have obtained effective results, but these methods are not satisfying. Based on the quantum theory and particle swarm optimization ,this paper presents an HQPSO algorithm to solve FSSP. Experimental results show that the HQPSO algorithm for FSSP improves the search performance and shows the effectiveness of the algorithm to solve optimization problems..
Keywords :
flow shop scheduling; particle swarm optimisation; quantum theory; HQPSO algorithm; NP-hard problem; flow shop scheduling problem; particle swarm optimization; quantum theory; PSO; flow shop; optimization; quantum; scheduling;
Conference_Titel :
Computational Intelligence and Natural Computing Proceedings (CINC), 2010 Second International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-7705-0
DOI :
10.1109/CINC.2010.5643845