数学优化
整数规划
标杆管理
作业车间调度
计算机科学
调度(生产过程)
线性规划
稳健优化
集合(抽象数据类型)
资源限制
护士排班问题
数学
地铁列车时刻表
流水车间调度
分布式计算
营销
业务
程序设计语言
操作系统
作者
Matthew Bold,Marc Goerigk
标识
DOI:10.1016/j.orl.2022.08.003
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI