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

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.