Title :
Hybrid Genetic Algorithm for Flow Shop Scheduling Problem
Author :
Tang, Jianchao ; Zhang, Guoji ; Lin, Binbin ; Zhang, Bixi
Author_Institution :
Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China
Abstract :
The flow shop scheduling problem (FSSP) is a NP-HARD combinatorial problem with strong industrial background. Among the meta-heuristics, genetic algorithms attracted a lot of attention. However, lacking the major evolution direction, the effectiveness of regular genetic algorithm is restricted. In this paper, the particle swarm optimization algorithm (PSO) is introduced for better initial group. By combining PSO with GA, a hybrid optimization algorithm for FSSP is proposed. This method is validated on a series of benchmark datasets. Experimental results indicate that this method is efficient and competitive compared to some existing methods.
Keywords :
combinatorial mathematics; flow shop scheduling; genetic algorithms; particle swarm optimisation; FSSP; NP-hard combinatorial problem; PSO; benchmark datasets; flow shop scheduling problem; hybrid genetic algorithm; industrial background; metaheuristics; particle swarm optimization algorithm; Automation; Computer science; Electronics packaging; Encoding; Genetic algorithms; Job shop scheduling; Particle swarm optimization; Processor scheduling; Scheduling algorithm; Technology management; flow shop scheduling problem; genetic algorithm; hybrid algorithm; particle swarm optimization algorithm;
Conference_Titel :
Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on
Conference_Location :
Changsha
Print_ISBN :
978-1-4244-7279-6
Electronic_ISBN :
978-1-4244-7280-2
DOI :
10.1109/ICICTA.2010.767