Title :
A hybrid algorithm of Harmony Search and Simulated Annealing for multiprocessor task scheduling
Author :
Jiang, Hua ; Bao, Yun ; Zheng, Liping ; Liu, Yanxiu
Author_Institution :
Coll. of Comput. Sci., Liaocheng Univ., Liaocheng, China
Abstract :
Based on characteristics of Harmony Search and Simulated Annealing algorithm, a hybrid algorithm is designed to solve the multiprocessor task scheduling problem. Comparing with other typical optimization algorithm, the simulation results demonstrate that the hybrid algorithm is superior to Simulated Annealing and Harmony Search algorithm. It can improve the global search abilities and convergence speed and can escape local minimizer to look for better solutions.
Keywords :
processor scheduling; search problems; simulated annealing; convergence speed; global search abilities; harmony search algorithm; hybrid algorithm; multiprocessor task scheduling problem; simulated annealing algorithm; Algorithm design and analysis; Educational institutions; Heuristic algorithms; Processor scheduling; Search problems; Simulated annealing; Harmony Search; Multiprocessor Task Scheduling; Simulated Annealing; hybrid policy;
Conference_Titel :
Systems and Informatics (ICSAI), 2012 International Conference on
Conference_Location :
Yantai
Print_ISBN :
978-1-4673-0198-5
DOI :
10.1109/ICSAI.2012.6223111
