Minimizing the Total Weighted Completion Time for Three Cooperating Agents

摘要

In the field of job scheduling, multi-agent scheduling has been studied for years. Past research focused on only two agents and how they compete for limited resources. In this study, we introduce a three-agent scheduling problem. In the problem, these agents can cooperate on minimizing the total weighted completion time. Experimental results show that these cooperating agents achieve lower objective costs and shorter processing times.