Multi-agent Based Integration of Scheduling Algorithms

dapt requirement of complicated production environment by defining a process-type MASS. The agents in our architecture map scheduling algorithms.

 The rest of the paper is organized as follow. In section 2, we introduce concept of integration of scheduling algorithms. In section 3, we detail the solution of multi-agent based integration of scheduling algorithms. In the last section, we conclude by describing the significance of our research and highlighting future extensions.

 2. INTEGRATION  OF  SCHEDULING ALGORITHMS

 Different scheduling algorithms have their own feature and using condition or area. As units, their capabilities are limited. But they can be used to solve complex scheduling problem if only they are combined together. Integration of Scheduling Algorithms (ISA) is such a process or mechanism of integrating various scheduling algorithms to generate a single architecture, which process more applicability.

 To some extent, some mixed algorithms, which are compose of other algorithms, are particular instances of ISA. But these combination are simple and immovable, and the result, which are also single algorithm, is still limited to some special production environments and we are not interested in it here. 

ISA that be defined here is a flexible and intelligent scenario of collaboration among scheduling algorithms. It can dynamically call or joint different algorithms together for different environment under various conditions and constraints. Each algorithm (we call it atomic algorithm) joining the scenario is independent.  

There are two cases of ISA. One is that atomic algorithms store in a system are dynamically called to response the change of environments. The other is that scheduling problem is divided into several subproblems. Each subproblem is sloved by one atomic algorithm. The whole problem is solved by dynamic collaboration of several atomic algorithms.

 We may design an intelligent system that consists of a rule base, an algorithm base, a reason machine and other components. The rule base stores knowledge of using algorithm. The

algorithm base stores all sorts of scheduling algorithms. The system can make estimation in reason machine and select a good algorithm from algorithm base according to rules from rule base. Theoretically it can solve any complex scheduling problem. But its efficiency is hard to ensure because we have too many algorithms and rules of how to use these algorithms. To retrieve rules and algorithms need very long time.

 Then, of course, we think of distributed structure. MAS is surely a good architecture to help realizing ISA.

 3. MULTI-AGENT BASED ISA

 

A scheduling algorithm is a process of solving scheduling problems. The process needs to keep contact with the environment. Assembled with a rule base, an analysis module, an interface (to contact with outside), and a reason machine, etc., a scheduling algorithm can be characterized as an intelligent agent. The agent can make decisions based on the response from the environment and take action (computation). We name this agent computing agent. The dynamic integration of scheduling algorithms is the integration of different computing agents under the scheduling of a ma

《Multi-agent Based Integration of Scheduling Algorithms(第3页)》