论文信息 - A hybrid algorithm of Harmony Search and Simulated Annealing for multiprocessor task scheduling

A hybrid algorithm of Harmony Search and Simulated Annealing for multiprocessor task scheduling

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.

Liping Zheng | Hua Jiang | Yun Bao | Yanxiu Liu

[1] Parameswaran Ramanathan,et al. Real-time computing: a new discipline of computer science and engineering , 1994, Proc. IEEE.

[2] Pan Quan-ke. Discrete Particle Swarm Optimization Algorithm for Solving Independent Task Scheduling , 2008 .

[3] Krithi Ramamritham,et al. Scheduling algorithms and operating systems support for real-time systems , 1994, Proc. IEEE.

[4] Zhong Qiu. TASK MATCHING AND SCHEDULING BY USING GENETIC ALGORITHMS , 2000 .

[5] Zong Woo Geem,et al. A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[6] Nirwan Ansari,et al. A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[7] M. Fesanghary,et al. An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..