返回
Exact solution methods for the Resource Constrained Project Scheduling Problem with a flexible Project Structure
DOI:10.1016/j.ejor.2024.10.029.png)
摘要
En 中文
The Resource Constrained Project Scheduling Problem with a flexible Project Structure (RCPSP-PS) is a generalization of the Resource Constrained Project Scheduling Problem (RCPSP). In the RCPSP, the goal is to determine a minimal makespan schedule subject to precedence and resource constraints. The generalization introduced in the RCPSP-PS is that, instead of executing all activities, only a subset of all activities has to be executed. We present a model that is based on two graphs: one representing precedence relations and one representing the activity selection structure. The latter defines which subset of activities has to be executed. Additionally, we present theoretical properties of this model and give an exact solution method that makes use of these properties by generating cutting planes and setting bounds on variables. Furthermore, three problem properties are introduced to classify problems in the literature. We compare our model to a model from literature on instances that possess a subset of these three problem properties and find a reduction in computing time. Furthermore, by comparing results on instances that possess all problem properties, it is shown that the computing times are decreased and better lower bounds are found by the cutting planes and variable bounds presented in this paper.
Keyword:
Project scheduling
Resource Constrained Project Scheduling
Problem
Integer programming
Flexible project structure
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs具有替代子图的资源受限项目调度问题的禁忌搜索程序

