有限资源agent间动态任务共享的分散算法比较

Hisashi Hayashi
{"title":"有限资源agent间动态任务共享的分散算法比较","authors":"Hisashi Hayashi","doi":"10.1145/3486622.3493924","DOIUrl":null,"url":null,"abstract":"Dynamic task sharing among organizations is attracting attention in research as the COVID-19 pandemic continues and many hospitals are filled with patients. Here, the task is, for example, the treatment of patients requiring resources such as beds and medical staffs for certain periods of time. This task must be started before its completion becomes overdue. However, because these tasks are created dynamically, the task-handling cannot be scheduled in advance; in addition, these tasks are handled by multiple independent organizations. Because the distribution of tasks are not uniform across the organizations, some tasks should be transferred to unoccupied organizations. In this study, we present and compare some decentralized algorithms for dynamic task sharing among organizations with limited resources. We aim to minimize the number of unstarted tasks within the time limit.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"38 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparing Decentralized Algorithms for Dynamic Task Sharing among Agents with Limited Resources\",\"authors\":\"Hisashi Hayashi\",\"doi\":\"10.1145/3486622.3493924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dynamic task sharing among organizations is attracting attention in research as the COVID-19 pandemic continues and many hospitals are filled with patients. Here, the task is, for example, the treatment of patients requiring resources such as beds and medical staffs for certain periods of time. This task must be started before its completion becomes overdue. However, because these tasks are created dynamically, the task-handling cannot be scheduled in advance; in addition, these tasks are handled by multiple independent organizations. Because the distribution of tasks are not uniform across the organizations, some tasks should be transferred to unoccupied organizations. In this study, we present and compare some decentralized algorithms for dynamic task sharing among organizations with limited resources. We aim to minimize the number of unstarted tasks within the time limit.\",\"PeriodicalId\":89230,\"journal\":{\"name\":\"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology\",\"volume\":\"38 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3486622.3493924\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3486622.3493924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着新型冠状病毒感染症(COVID-19)大流行的持续,医院人满为患,组织间的动态任务共享正在引起研究领域的关注。例如,这里的任务是在一定时期内对需要床位和医务人员等资源的病人进行治疗。此任务必须在超时完成之前启动。但是,由于这些任务是动态创建的,因此无法提前调度任务处理;此外,这些任务由多个独立的组织处理。由于任务在各个组织中的分配并不统一,因此应该将一些任务转移到未占用的组织中。在本研究中,我们提出并比较了资源有限的组织之间动态任务共享的一些分散算法。我们的目标是在时间限制内尽量减少未开始的任务数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparing Decentralized Algorithms for Dynamic Task Sharing among Agents with Limited Resources
Dynamic task sharing among organizations is attracting attention in research as the COVID-19 pandemic continues and many hospitals are filled with patients. Here, the task is, for example, the treatment of patients requiring resources such as beds and medical staffs for certain periods of time. This task must be started before its completion becomes overdue. However, because these tasks are created dynamically, the task-handling cannot be scheduled in advance; in addition, these tasks are handled by multiple independent organizations. Because the distribution of tasks are not uniform across the organizations, some tasks should be transferred to unoccupied organizations. In this study, we present and compare some decentralized algorithms for dynamic task sharing among organizations with limited resources. We aim to minimize the number of unstarted tasks within the time limit.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信