.png){kind=icon}
返回
Integer programming for multi-mode resource-constrained project scheduling
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-025-06572-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Project scheduling is a vital management task in many organizations across various industries. A project typically consists of activities that require time and scarce resources for execution. In many projects, there are trade-offs between the resource requirements and the duration of activities. These trade-offs can be represented via multiple execution modes of activities, which are considered in the multi-mode resource-constrained project scheduling problem (MRCPSP). The MRCPSP comprises determining the activities' start times and execution modes to minimize the project completion time while respecting precedence relations and availabilities of renewable and nonrenewable resources. In this paper, we propose several discrete-time (DT) and one continuous-time (CT) mixed-integer linear programming (MILP) model for the MRCPSP based on models for the single-mode resource-constrained project scheduling problem (RCPSP). We first analyze the models' LP relaxations and show an equivalence between DT models. Then, we compare the computational performance of the models on benchmark instances. Our results indicate that the proposed CT model outperforms the state-of-the-art models on large problem instances and problem instances with relatively long activity durations, while it is competitive on smaller problem instances. A possible explanation for this outperformance is that the LP relaxations of the proposed CT model can be solved considerably faster than the LP relaxations of the state-of-the-art models.
Keyword:
Project scheduling
Mixed-integer linear programming
Multi-mode resource-constrained project scheduling
Experimental comparison
