.png){kind=icon}
返回
A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.01.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a Path-Relinking (PR) algorithm for the well-known and NP-hard Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). This problem generalizes the Resource Constrained Project Scheduling Problem (RCPSP) where the project activities have a set of execution modes. For each execution mode, the processing time, the renewable and nonrenewable resource demands are given. The MRCPSP goal is to minimize the total makespan of the project. The PR algorithm works by travelling through the solution space between two solutions, it performs local search around the intermediate solutions. This work also presents computational tests using benchmark instances to compare our implementation with the most competitive methods from the literature. The PR's computational results improve the earlier results reported for the benchmark instance sets. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Project scheduling
MRCPSP
Path-Relinking
Metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers使用RCPSP和SAT求解器的多模式资源受限项目调度
OAAI
OAAI分享收藏Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
PREAI
分享收藏分享收藏A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem基于混合秩的进化算法应用于多模式资源受限项目调度问题
PREAI
分享收藏分享收藏
查看更多内容