Research on task scheduling based on LDA

To cooperate effectively with its peers in the cooperative system, an agent must finish its tasks in time. Overload situations of an agent should be avoided at the beginning of task scheduling. We investigate the mathematical and computational aspects of agent workload to optimize task scheduling. We begin with definitions of some abstract representations such as workload and atomic activity set. Workload distribution algorithm and task scheduling algorithm are then presented, which are used for the optimization of task allocation. At last, we give some results of a simulation experiment, which shows that the two algorithms can be used in task scheduling optimization.