当前位置: X-MOL 学术J. Sched. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
Journal of Scheduling ( IF 1.4 ) Pub Date : 2022-06-06 , DOI: 10.1007/s10951-022-00735-9
Kai Watermeyer , Jürgen Zimmermann

This paper deals with the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints with the objective to minimize the project duration. The consideration of partially renewable resources allows to integrate the decision about the availability of a resource for a specific time period into the scheduling process. Together with general temporal constraints, which permit to establish minimum and maximum time lags between activities, even more aspects of real-life projects can be taken into account. We present a branch-and-bound algorithm for the stated problem that is based on a serial schedule-generation scheme. For the first time it is shown how a dominance criterion can be applied on the associated generation scheme to reduce the start times in each scheduling step. To improve the performance of the solution procedure, we integrate consistency tests and lower bounds from the literature and devise new pruning techniques. In a comprehensive experimental performance analysis we compare our exact solution procedure with all available branch-and-bound algorithms for partially renewable resources. Additionally, we investigate a directly derived priority rule-based approximation method from our new enumeration scheme. The results of the computational study demonstrate the efficiency of our branch-and-bound algorithm and reveal that the derived approximation method is only suited to solve small- and medium-sized instances.



中文翻译:

具有部分可再生资源和一般时间约束的项目工期问题的建设性分支定界算法

本文处理具有部分可再生资源和一般时间约束的资源受限项目调度问题,目标是最小化项目工期。对部分可再生资源的考虑允许将有关特定时间段内资源可用性的决策集成到调度过程中。连同允许在活动之间建立最小和最大时间滞后的一般时间约束,甚至可以考虑实际项目的更多方面。我们提出了一种基于串行调度生成方案的所述问题的分支定界算法。首次展示了如何将优势标准应用于相关的发电方案,以减少每个调度步骤的开始时间。为了提高求解过程的性能,我们整合了文献中的一致性测试和下限,并设计了新的剪枝技术。在全面的实验性能分析中,我们将我们的精确求解过程与所有可用的部分可再生资源的分支定界算法进行比较。此外,我们从我们的新枚举方案中研究了一种直接派生的基于优先级规则的近似方法。计算研究的结果证明了我们的分支定界算法的效率,并表明派生的近似方法仅适用于解决中小型实例。在全面的实验性能分析中,我们将我们的精确求解过程与所有可用的部分可再生资源的分支定界算法进行比较。此外,我们从我们的新枚举方案中研究了一种直接派生的基于优先级规则的近似方法。计算研究的结果证明了我们的分支定界算法的效率,并表明派生的近似方法仅适用于解决中小型实例。在全面的实验性能分析中,我们将我们的精确求解过程与所有可用的部分可再生资源的分支定界算法进行比较。此外,我们从我们的新枚举方案中研究了一种直接派生的基于优先级规则的近似方法。计算研究的结果证明了我们的分支定界算法的效率,并表明派生的近似方法仅适用于解决中小型实例。

更新日期:2022-06-06
down
wechat
bug