Evaluation of scatter search and genetic algorithm at resource constrained project scheduling problems

T. Sari, V. Cakir, S. Kilic, E. Ece
{"title":"Evaluation of scatter search and genetic algorithm at resource constrained project scheduling problems","authors":"T. Sari, V. Cakir, S. Kilic, E. Ece","doi":"10.1109/INES.2011.5954732","DOIUrl":null,"url":null,"abstract":"Basic elements of project planning are activity scheduling and resource allocation. In this study, meta-heuristic methods reviewed as an appropriate solution tool for resource-constrained project scheduling problem and the success of two meta-heuristic methods discussed. Resource constrained project scheduling problem which is an NP-hard problem solved with scatter search and genetic algorithm. Both algorithms do not disrupt the feasible search space during population generation. Algorithms compared in terms of resulting time and working principles.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 15th IEEE International Conference on Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INES.2011.5954732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Basic elements of project planning are activity scheduling and resource allocation. In this study, meta-heuristic methods reviewed as an appropriate solution tool for resource-constrained project scheduling problem and the success of two meta-heuristic methods discussed. Resource constrained project scheduling problem which is an NP-hard problem solved with scatter search and genetic algorithm. Both algorithms do not disrupt the feasible search space during population generation. Algorithms compared in terms of resulting time and working principles.
资源约束下项目调度问题的分散搜索与遗传算法评价
项目计划的基本要素是活动安排和资源分配。本研究回顾了元启发式方法作为解决资源受限项目调度问题的合适工具,并讨论了两种元启发式方法的成功。资源约束下的项目调度问题是一个用分散搜索和遗传算法求解的np困难问题。两种算法在种群生成过程中都不会破坏可行搜索空间。算法在结果时间和工作原理方面进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信