Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics

被引:0
作者
Felix Hübner
Patrick Gerhards
Christian Stürck
Rebekka Volk
机构
[1] Karlsruhe Institute of Technology (KIT),Institute for Industrial Production (IIP)
[2] Helmut Schmidt University,Institute of Computer Science
[3] Helmut Schmidt University,Institute for Management Science and Operations Research
来源
Journal of Scheduling | 2021年 / 24卷
关键词
Project scheduling; Multi-mode resource investment problem; Mixed-integer programming; Constraint programming; Metaheuristic; Nuclear dismantling project scheduling problem;
D O I
暂无
中图分类号
学科分类号
摘要
Scheduling of megaprojects is very challenging because of typical characteristics, such as expected long project durations, many activities with multiple modes, scarce resources, and investment decisions. Furthermore, each megaproject has additional specific characteristics to be considered. Since the number of nuclear dismantling projects is expected to increase considerably worldwide in the coming decades, we use this type of megaproject as an application case in this paper. Therefore, we consider the specific characteristics of constrained renewable and non-renewable resources, multiple modes, precedence relations with and without no-wait condition, and a cost minimisation objective. To reliably plan at minimum costs considering all relevant characteristics, scheduling methods can be applied. But the extensive literature review conducted did not reveal a scheduling method considering the special characteristics of nuclear dismantling projects. Consequently, we introduce a novel scheduling problem referred to as the nuclear dismantling project scheduling problem. Furthermore, we developed and implemented an effective metaheuristic to obtain feasible schedules for projects with about 300 activities. We tested our approach with real-life data of three different nuclear dismantling projects in Germany. On average, it took less than a second to find an initial feasible solution for our samples. This solution could be further improved using metaheuristic procedures and exact optimisation techniques such as mixed-integer programming and constraint programming. The computational study shows that utilising exact optimisation techniques is beneficial compared to standard metaheuristics. The main result is the development of an initial solution finding procedure and an adaptive large neighbourhood search with iterative destroy and recreate operations that is competitive with state-of-the-art methods of related problems. The described problem and findings can be transferred to other megaprojects.
引用
收藏
页码:269 / 290
页数:21
相关论文
共 65 条
[11]  
Leus R(1996)Efficient priority rules for the resource-constrained project scheduling problem Journal of Operations Management 14 179-192
[12]  
Hsu C-C(2018)Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems European Journal of Operational Research 266 472-486
[13]  
Kim DS(2018)IBM ILOG CP optimizer for scheduling Constraints 23 210-250
[14]  
Iguchi Y(2016)The irace package: Iterated racing for automatic algorithm configuration Operations Research Perspectives 3 43-58
[15]  
Kanehira Y(2013)Multi-start methods for combinatorial optimization European Journal of Operational Research 226 1-8
[16]  
Tachibana M(1984)Minimizing costs of resource requirements in project networks subject to a fixed completion time Operations Research 32 89-120
[17]  
Johnsen T(2006)An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 455-472
[18]  
Józefowska J(2016)On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations OR Spectrum 38 283-303
[19]  
Mika M(2017)On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs Operations Research Perspectives 4 1-11
[20]  
Różycki R(2007)A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty European Journal of Operational Research 181 86-101