Cart (Loading....) | Create Account
Close category search window
 

Dynamic grid scheduling algorithm based on self-adaptive Tabu Search

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
$31 $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

5 Author(s)
Xiaohong Kong ; Sch. of Mech. & Electr. Eng., Henan Inst. of Sci. & Technol., Xinxiang, China ; Hong Shen ; Xiqu Chen ; Chao Wang
more authors

In this paper, a self-adaptive algorithm based on Tabu Search (TS) is proposed to minimize the makespan, which is suitable to the grid dynamic characteristic. The process of scheduling is divided into partial scheduling, and last partial information is exploited to decide the next partial scheduling parameters set, which is self-adaptive to the stochastic environment. The algorithm was simulated in GridSim toolkit and the results demonstrated that the proposed algorithm improved performance compared to existing scheduling techniques.

Published in:

Computer Design and Applications (ICCDA), 2010 International Conference on  (Volume:2 )

Date of Conference:

25-27 June 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.