By Topic

The Schedulable Problem for Tasks with Utility in Multi-agent 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

3 Author(s)
Wu Jun ; Sch. of Inf. Eng., Yangzhou Univ., Yangzhou ; Zhang Xiaowei ; Li Bin

Tasks scheduling is a key problem in multi-agent system, traditional tasks scheduling methods canpsilat be applied to new application areas of the MAS such as emergency system. In order to apply agent method to these new areas, this paper proposes a new variant of task scheduling method considering utility. Based on our MAS model, we construct a flow network according to instance of task scheduling problem and add utility to it. We show that minimum cost flow algorithm can be use to task scheduling problem to maximize the utility of the system. Moreover, we use a mathematical method to ensure tasks are schedulable when maximizing the utility. Finally, a conclusion which can be used to determine whether there exists an efficient task scheduling is gained.

Published in:

Industrial and Information Systems, 2009. IIS '09. International Conference on

Date of Conference:

24-25 April 2009