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 条
  • [21] More mixed-integer linear programming models for solving three-stage remanufacturing system scheduling problem
    Wang, Wenjie
    Tian, Guangdong
    Luo, Mengqi
    Zhang, Honghao
    Yuan, Gang
    Niu, Kejia
    COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 194
  • [22] Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm
    Pan, Quan-Ke
    Suganthan, Ponnuthurai N.
    Chua, Tay J.
    Cai, T. X.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 46 (9-12): : 1229 - 1237
  • [23] Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm
    Quan-Ke Pan
    Ponnuthurai N. Suganthan
    Tay J. Chua
    T. X. Cai
    The International Journal of Advanced Manufacturing Technology, 2010, 46 : 1229 - 1237
  • [24] Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
    Naderi, Bahman
    Ruiz, Ruben
    Roshanaei, Vahid
    INFORMS JOURNAL ON COMPUTING, 2023, 35 (04) : 817 - 843
  • [25] Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming
    Mamedov K.S.
    Mamedov K.K.
    Elchueva S.K.
    Automatic Control and Computer Sciences, 2015, 49 (4) : 231 - 238
  • [26] Mixed-Integer Linear Programming, Constraint Programming and a Novel Dedicated Heuristic for Production Scheduling in a Packaging Plant
    Oujana, Soukaina
    Amodeo, Lionel
    Yalaoui, Farouk
    Brodart, David
    APPLIED SCIENCES-BASEL, 2023, 13 (10):
  • [27] A mixed-integer programming model for a single shift hierarchical employee scheduling problem
    Al-Yakoob, Salem M.
    KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 2006, 33 (01): : 13 - 25
  • [28] A MIXED-INTEGER GOAL-PROGRAMMING FORMULATION OF THE STANDARD FLOWSHOP SCHEDULING PROBLEM
    SELEN, WJ
    HOTT, DD
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1986, 37 (12) : 1121 - 1128
  • [29] MIXED-INTEGER PROGRAMMING FORMULATIONS FOR THE TRUCK SCHEDULING PROBLEM WITH FIXED OUTBOUND DEPARTURES
    Wolff, Pascal
    Huo, Jiazhen
    Pfohl, Hans-Christian
    LOGFORUM, 2021, 17 (02) : 243 - 251