By Topic

Static Task Scheduling Using Genetic Algorithm and Reinforcement Learning

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)
Najafabadi, M.M. ; Dept. of ECE, Tehran Univ. ; Zali, M. ; Taheri, S. ; Taghiyareh, F.

Task scheduling in a multiprocessor system is defined as assigning a set of tasks to a set of processors. The goal is to minimize the execution time while meeting a set of constraints. A wide variety set of deterministic and heuristic methods are proposed to solve the problem. The main problem is that the proposed methods cannot deal with big search spaces and cannot guarantee to find the optimal solution. In this research a novel approach based on reinforcement learning and genetic algorithm is proposed. Being divided using genetic algorithm, the smaller problems can be solved with reinforcement learner scheduler. The result of the method is a set of task processor pairs. Simulation results in standard problem set show that the method outperforms some studied GA based scheduling methods

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007