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
相关论文
共 50 条
  • [1] Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics
    Hubner, Felix
    Gerhards, Patrick
    Stuerck, Christian
    Volk, Rebekka
    JOURNAL OF SCHEDULING, 2021, 24 (03) : 269 - 290
  • [2] Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
    Meng, Leilei
    Zhang, Chaoyong
    Ren, Yaping
    Zhang, Biao
    Lv, Chang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 142
  • [3] The use of Mixed-Integer and Constraint Programming to solve the Job Shop Scheduling Problem
    Neuenfeldt Junior, Alvaro
    DIRECCION Y ORGANIZACION, 2019, 69 : 27 - 35
  • [4] A mixed-integer linear programming model for solving fuzzy stochastic resource constrained project scheduling problem
    Yagub Alipouri
    Mohammad Hassan Sebt
    Abdollah Ardeshir
    Mohammad Hossein Fazel Zarandi
    Operational Research, 2020, 20 : 197 - 217
  • [5] A mixed-integer linear programming model for solving fuzzy stochastic resource constrained project scheduling problem
    Alipouri, Yagub
    Sebt, Mohammad Hassan
    Ardeshir, Abdollah
    Zarandi, Mohammad Hossein Fazel
    OPERATIONAL RESEARCH, 2020, 20 (01) : 197 - 217
  • [6] Solving the unrelated parallel batch machine scheduling problem with mixed-integer programming
    Bakir, Merve
    Sebatli-Saglam, Asli
    Cavdur, Fatih
    JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI, 2023, 26 (02): : 653 - 663
  • [7] Mixed-integer/linear and constraint programming approaches for activity scheduling in a nuclear research facility
    Polo-Mejia, Oliver
    Artigues, Christian
    Lopez, Pierre
    Basini, Virginie
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020, 58 (23) : 7149 - 7166
  • [8] Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods
    Harjunkoski, I
    Grossmann, IE
    COMPUTERS & CHEMICAL ENGINEERING, 2002, 26 (11) : 1533 - 1552
  • [9] Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems
    Harjunkoski, I
    Jain, V
    Grossman, IE
    COMPUTERS & CHEMICAL ENGINEERING, 2000, 24 (2-7) : 337 - 343
  • [10] Solving the Traveling Telescope Problem with Mixed-integer Linear Programming
    Handley, Luke B.
    Petigura, Erik A.
    Misic, Velibor V.
    ASTRONOMICAL JOURNAL, 2024, 167 (01):