We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An efficient local search for grid scheduling problem in learning system

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

4 Author(s)
Chih-Ming Wang ; Dept. of Comput. Sci. & Eng., Nat. Sun Yat-sen Univ., Kaohsiung, Taiwan ; Chun-Wei Tsai ; Ming-Chao Chiang ; Chu-Sing Yang

Grid scheduling is an NP-complete problem which the objective is to minimize the completion time (makespan). This paper is motivated by the requirement that the feedback analysis service of e-learning system needs to distribute the computing jobs for balancing the workload and getting the fast response. We propose an efficient local search method embed into the differential evolution algorithm (DE) to find a feasible solution. DE is efficiently in the computing time and the proposed local search method tries to enhance the result of DE for minimizing the makespan. Comparing with DE, our proposed algorithm reduces the makespan with the ratio 64% in the best case. Simulation results demonstrate the proposed method.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012