By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hua Jiang ; College of Computer Sciencet, Liaocheng University, China ; Yun Bao ; Liping Zheng ; Yanxiu Liu

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.

Published in:

Systems and Informatics (ICSAI), 2012 International Conference on

Date of Conference:

19-20 May 2012