By Topic

Solving task scheduling in peer-to-peer by 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)
Junqing Li ; Sch. of Comput., Liaocheng Univ., Liaocheng, China ; Shengxian Xie ; Tao Sun ; Yuting Wang
more authors

In this study, we propose a tabu search algorithm for solving the task scheduling problem in peer-to-peer networking system. The communication costs for given tasks are considered in the proposed algorithm. The operating sequences among tasks are also discussed, which make the problem more realistic. The objective is to minimize the completion time of all tasks. Experimental results on several random generated cases verified the efficiency and effectiveness of the proposed algorithm.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012