DocumentCode :
2794341
Title :
A hybrid based GA and HS algorithms in blocking flow shop scheduling problems
Author :
Bao, Yun ; Jing, Hua ; Zheng, Liping
Author_Institution :
Coll. of Comput. Sci., Liaocheng Univ., Liaocheng, China
fYear :
2011
fDate :
15-17 July 2011
Firstpage :
953
Lastpage :
956
Abstract :
This paper is concerned with solving the blocking flow shop scheduling problem based Harmony Search and GA for better result. The largest position value (LPV) rule is used to convert continuous harmony vectors into job permutations and an efficient initialization scheme based on a variant of the NEH heuristic, called NEHPWT, is used to construct the initial harmony memory with certain quality and diversity. In the hybrid, HS and GA is employed to solve the blocking flow shop scheduling problems, whereas a local search algorithm based on an insert neighborhood is embedded to enhance the local exploitation ability. The result shows that the hybrid algorithm is better than HS algorithm.
Keywords :
flow shop scheduling; genetic algorithms; search problems; NEH heuristic; NEHPWT; blocking flow shop scheduling problem; continuous harmony vectors; genetic algorithm; harmony search; hybrid based GA algorithm; hybrid based HS algorithm; initialization scheme; job permutations; largest position value rule; local exploitation ability enhancement; local search algorithm; Algorithm design and analysis; Genetic algorithms; Job shop scheduling; Phasor measurement units; Processor scheduling; Search problems; Blocking flow shop; Genetic algorithm; Harmony search; Local search; NEH heuristic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechanic Automation and Control Engineering (MACE), 2011 Second International Conference on
Conference_Location :
Hohhot
Print_ISBN :
978-1-4244-9436-1
Type :
conf
DOI :
10.1109/MACE.2011.5987089
Filename :
5987089
Link To Document :
بازگشت