.png){kind=icon}
返回
Differential evolution for solving multi-mode resource-constrained project scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.11.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and minimization of the makespan. To solve this problem, we propose a differential evolution (DE) algorithm. We focus on the performance of this algorithm to solve the problem within small time per activity. Finally, we present the results of our thorough computational study. Results obtained on six classes of test problems and comparison with other algorithms from the literature show that our algorithm gives better solutions. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Differential evolution
Scheduling
MRCPSP
Makespan
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm一种简单、通用、功能强大的排序算法实现多模式资源受限项目调度
PREAI
分享收藏
查看更多内容