论文标题
更快的精确方法，用于解决鲁棒的多模式资源约束项目调度问题
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem
论文作者
论文摘要
本文为多模式资源约束的项目调度问题提供了一种混合整数线性编程公式，但活动持续时间不确定。我们考虑了一种两阶段的强大优化方法，并找到解决方案，以最大程度地减少最差的项目Makepan，同时假设活动持续时间位于预算的不确定性集中。计算实验表明，这种易于实现的公式比目前的最新解决方案方法要快得多，同时求解了超过40％的实例，以在同一基准测试集中求最优化。
This paper presents a mixed-integer linear programming formulation for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. We consider a two-stage robust optimisation approach and find solutions that minimise the worst-case project makespan, whilst assuming that activity durations lie in a budgeted uncertainty set. Computational experiments show that this easy-to-implement formulation is many times faster than the current state-of-the-art solution approach for this problem, whilst solving over 40% more instances to optimality over the same benchmarking set.
