返回
A matheuristic-oriented iterated greedy algorithm for multi-mode resource-constrained project scheduling problem under uncertainty
DOI:10.1016/j.cie.2024.110333.png)
摘要
En 中文
Multi-mode resource-constrained project scheduling problem is one of the most important branches of combinatorial optimization problems. The aim is to find a feasible solution consisting of activity start time and execution mode so that the project makespan is minimized. However, there are a lot of uncertain events, that bring great challenges to project scheduling. We first propose a mixed integer linear programming model where the activity duration is uncertain. Then two uncertain parameters are introduced to describe the disturbance degree of uncertain activity duration and the allowable violation degree of constraints respectively, and the MILP model with uncertain activity duration is converted to its deterministic robust counterpart model. A matheuristic local optimization approach is proposed to balance computational time with the optimization of the computational result. A matheuristic-oriented iterated greedy algorithm that combines a matheuristic local optimization approach and an iterated greedy algorithm is proposed to solve this problem in this paper. Experimental results indicate that the robust counterpart model can obtain robust optimal solutions for small-scale instances in accepted computational time. Meanwhile, the proposed matheuristic-oriented iterated greedy algorithm can obtain robust near-optimal solutions for large-scale instances and is superior to other compared algorithms.
Keyword:
Project scheduling
Uncertainty
Robust counterpart model
Mixed integer linear programming
Matheuristic
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations具有批量流和机器重新配置的灵活作业车间调度问题的数学理论
Sleisenger and Fordtran's Gastrointestinal and Liver Disease: pathophysiology, diagnosis, management

