推荐文档列表

Multi-agentBasedIntegrationofSchedul

时间:2021-10-01 09:49:14 计算机论文 我要投稿

Multi-agentBasedIntegrationofSchedulingAlgorithms

Multi-agent Based Integration of Scheduling Algorithms 注意:本文已在Proceedings of the IASTED International Conference-Intelligent

Systems and Control,2001.11:55-59 发表,

使用者请注明文章出处

Dr. Bo Zhao, Prof. Dr. Yushun Fan Department of Automation, Tsinghua University Tsinghua Yuan, Beijing 100084 P. R. China ABSTRACT: Up to date more and more research of scheduling use Multi-agent System (MAS) technique. In this paper MAS is used to realize integration of scheduling algorithms. Firstly, Multi-agent Scheduling System (MASS) is divided into two types: Entity-type MASS and Process-type MASS. Some of the researches are introduced. Secondly, the concept of integration of scheduling algorithms is put forward. Thirdly, the models of agents, computing agent and manager, are proposed. Then a Process-type MASS of multi-agent based integration of scheduling algorithms, which compose above two sorts of agents, is built. Finally, we conclude by describing the significance of our research and highlighting future extensions.

KEY WORDS: Scheduling, Multi-agent System, Integration of Scheduling Algorithms, Multi-agent Scheduling System

1. Introduction Algorithm is the key for the scheduling theory. The principle of scheduling is to find an optimal scenario of job allocation or resource distribution with scheduling algorithms. In the past decades many algorithms originated from other fields have been used in scheduling research and therefore formed the so-called scheduling algorithms. These works have enriched scheduling theory. However, any single algorithm that people have used so far are only applicable to a few special environments and can not adapt to dynamic production environment. This makes scheduling algorithms have not exerted all of their power in practical production. It is often the case that the plan formulated by scheduling algorithms is disabled because of some disturbance such as ma

[1] [2] [3] [4] [5]