资源受限项目调度的多智能体优化方法

Y. Shou, Wenjin Hu, Changtao Lai, Y. Ying
{"title":"资源受限项目调度的多智能体优化方法","authors":"Y. Shou, Wenjin Hu, Changtao Lai, Y. Ying","doi":"10.4018/IJITPM.2019010102","DOIUrl":null,"url":null,"abstract":"A multi-agent optimization method is proposed to solve the preemptive resource-constrained project scheduling problem in which activities are allowed to be preempted no more than once. The proposed method involves a multi-agent system, a negotiation process, and two types of agents (activity agents and schedule agent). The activity agents and the schedule agent negotiate with each other to allocate resources and optimize the project schedule. Computational experiments were conducted using the standard project scheduling problem sets. Compared with prior studies, results of the proposed method are competitive in terms of project makespan. The method can be extended to other preemptive resource-constrained project scheduling problems.","PeriodicalId":375999,"journal":{"name":"Int. J. Inf. Technol. Proj. Manag.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Multi-Agent Optimization Method for Preemptive Resource-Constrained Project Scheduling\",\"authors\":\"Y. Shou, Wenjin Hu, Changtao Lai, Y. Ying\",\"doi\":\"10.4018/IJITPM.2019010102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A multi-agent optimization method is proposed to solve the preemptive resource-constrained project scheduling problem in which activities are allowed to be preempted no more than once. The proposed method involves a multi-agent system, a negotiation process, and two types of agents (activity agents and schedule agent). The activity agents and the schedule agent negotiate with each other to allocate resources and optimize the project schedule. Computational experiments were conducted using the standard project scheduling problem sets. Compared with prior studies, results of the proposed method are competitive in terms of project makespan. The method can be extended to other preemptive resource-constrained project scheduling problems.\",\"PeriodicalId\":375999,\"journal\":{\"name\":\"Int. J. Inf. Technol. Proj. Manag.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Inf. Technol. Proj. Manag.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJITPM.2019010102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Inf. Technol. Proj. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJITPM.2019010102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对资源受限的项目调度问题,提出了一种多智能体优化方法,该方法允许活动被抢占不超过一次。该方法涉及一个多智能体系统、一个协商过程和两种类型的智能体(活动智能体和计划智能体)。活动代理和进度代理相互协商,分配资源,优化项目进度。采用标准的项目调度问题集进行了计算实验。与前人的研究结果相比,本文方法在项目最大完工时间方面具有一定的竞争力。该方法可推广到其他资源受限的抢占式项目调度问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multi-Agent Optimization Method for Preemptive Resource-Constrained Project Scheduling
A multi-agent optimization method is proposed to solve the preemptive resource-constrained project scheduling problem in which activities are allowed to be preempted no more than once. The proposed method involves a multi-agent system, a negotiation process, and two types of agents (activity agents and schedule agent). The activity agents and the schedule agent negotiate with each other to allocate resources and optimize the project schedule. Computational experiments were conducted using the standard project scheduling problem sets. Compared with prior studies, results of the proposed method are competitive in terms of project makespan. The method can be extended to other preemptive resource-constrained project scheduling problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信