.png){kind=icon}
返回
An activity-list-based nested partitions algorithm for resource-constrained project scheduling
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2015.1065353.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The resource-constrained project scheduling problem (RCPSP) has received wide attention. In this paper, an activity-list-based nested partitions algorithm (ALNP) is developed for solving the RCPSP and a P-ALNP is proposed to improve ALNP with local adjustment. In the algorithms, to improve the search efficiency, a partial double justification is employed as local search mechanism. The computational experiments on the PSPLIB and analysis on robustness of the algorithms show that ALNP outperforms the traditional serial scheduling scheme for solving the large-scale, complex RCPSPs, and P-ALNP can improve ALNP and obtain better results. P-ALNP is a competitive algorithm for solving the RCPSP.
Keyword:
resource-constrained project scheduling
nested partitions
activity list
serial scheduling scheme
double justification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
PREAI
分享收藏分享收藏A hybrid genetic algorithm for the resource-constrained project scheduling problem一种求解资源受限项目调度问题的混合遗传算法
PREAI
分享收藏An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
OAAI
OAAI分享收藏
查看更多内容