A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Abstract

We study a base-agent scheduling problem of two identical parallel machines: P2jCoj P T A , C B max . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed in order to achieve the optimum of task agents, which contains two agents: agent A and agent B. The objective is divided into two classes. The objective of agent A and agent B is to minimize total tardiness time and minimize makespan, respectively. In this article, we research character of two identical parallel machines that one category job can be processed by one machine agent only or two machine agents and propose a new multi-agent model on two identical parallel machines, divided into two subsystems. For subsystem 1, it is applied by a dynamic scheduling environment. Shortest processed time order is proposed to solve jobs' priorities. Single distribution strategy is proposed to solve assignment of jobs to machine agents. For subsystem 2, centralized distribution strategy applied to a static scheduling environment is addressed. The new model performs more efficiently and owns a stronger ability to deal with complex and dynamic scheduling environments.

Modeling, scheduling, and control in advanced production systems

“…To adapt to such uncertainties, an algebraic-logical metal-modelbased approach is proposed and a hybrid algorithm is developed to construct a solution. The ninth article, authored by Yu et al, 17 reports a study on the scheduling problem of two identical parallel machines to minimize both the total tardiness time and makespan. A multi-agent scheduling method is proposed for the problem.…”