最小化三个协作代理的总加权完成时间

2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI) Pub Date : 2018-07-01 DOI:10.1109/IIAI-AAI.2018.00129

Wen-Chiung Lee, Jen-Ya Wang

{"title":"最小化三个协作代理的总加权完成时间","authors":"Wen-Chiung Lee, Jen-Ya Wang","doi":"10.1109/IIAI-AAI.2018.00129","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":309975,"journal":{"name":"2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizing the Total Weighted Completion Time for Three Cooperating Agents\",\"authors\":\"Wen-Chiung Lee, Jen-Ya Wang\",\"doi\":\"10.1109/IIAI-AAI.2018.00129\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":309975,\"journal\":{\"name\":\"2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIAI-AAI.2018.00129\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIAI-AAI.2018.00129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在作业调度领域，多智能体调度已经研究多年。过去的研究只关注两个代理人，以及他们如何争夺有限的资源。在本研究中，我们引入了一个三智能体调度问题。在这个问题中，这些代理可以在最小化总加权完成时间上进行合作。实验结果表明，这些协作代理实现了较低的目标成本和较短的处理时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)

自引率

0.00%

发文量