A three-dimensional spatial resource-constrained project scheduling problem: Model and heuristic

被引:1
作者
Zhang, Jingwen [1 ]
Li, Lubo [1 ,2 ]
Demeulemeester, Erik [2 ]
Zhang, Haohua [1 ,2 ]
机构
[1] Northwestern Polytech Univ, Sch Management, Xian 710129, Shaanxi, Peoples R China
[2] Katholieke Univ Leuven, Fac Econ & Business, Res Ctr Operat Management, B-3000 Leuven, Belgium
基金
中国国家自然科学基金;
关键词
Three-dimensional spatial resources; Time-space conflicts; Project scheduling problem; Space allocation strategies; Priority rules; LOADING PROBLEM; BIN PACKING; ALGORITHM; MANAGEMENT; SYSTEM;
D O I
10.1016/j.ejor.2024.07.018
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
For a class of complex engineering projects executed in limited construction sites, spatial resources with three dimensions usually become a bottleneck that hampers their smooth implementation. Serious time-space conflicts frequently occur when multiple activities are carried out in parallel during some time periods. We propose a new project scheduling problem with three-dimensional spatial resource constraints (3D-sRCPSP), and a four-dimensional time-space is adopted to build the model for our 3D-sRCPSP. Firstly, in order to express the impacts of constrained sites on scheduling activities, two types of spatial constraints are refined and modeled: non-overlapping among active subspaces and not exceeding the total space, and then an integer programming model for the 3D-sRCPSP is formalized. Secondly, a novel heuristic algorithm is developed to solve the 3D-sRCPSP, which is embedded with 36 priority rules (PRs) and 3 instructive space allocation strategies. Besides 25 PRs for the traditional RCPSP, 11 new forms of PRs are extracted based on the features of 3D spatial resources. Thirdly, extensive numerical experiments are implemented to validate our model and heuristics. The instances are obtained by configuring the specific parameters of 3D spatial resources for benchmarks from PSPLIB library. One distinctive finding is that some existing PRs that perform well in the traditional RCPSP do not act best in the 3D-sRCPSP. On the other hand, the optimal solutions of very smallscale instances can be obtained by Gourbi solver, but our customized heuristic algorithm is more effective than Gourbi for general instances with medium/large sizes. Overall, the designed heuristics can effectively eliminate time-space conflicts in the planning stage of a project. Finally, as extension studies, the decision tree model is constructed to adaptively select the best PRs for each instance according to the indicators of project instances. These results can help project managers schedule activities and allocate spatial resources more accurately when encountering narrow construction sites.
引用
收藏
页码:943 / 966
页数:24
相关论文
共 64 条
  • [1] Formalization and automation of time-space conflict analysis
    Akinci, B
    Fischen, M
    Levitt, R
    Carlson, R
    [J]. JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2002, 16 (02) : 124 - 134
  • [2] On-line three-dimensional packing problems: A review of off-line and on-line solution approaches
    Ali, Sara
    Ramos, Antonio Galrao
    Carravilla, Maria Antonia
    Oliveira, Jose Fernando
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 168
  • [3] Alvarez-Valdes R., 1989, Advances in Project Scheduling, P113
  • [4] CHAMP: Creating heuristics via many parameters for online bin packing
    Asta, Shahriar
    Ozcan, Ender
    Parkes, Andrew J.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 63 : 208 - 221
  • [5] Bedworth D. D., 1973, Industrial systems: planning, analysis, control
  • [6] A COMPARATIVE-EVALUATION OF HEURISTICS FOR CONTAINER LOADING
    BISCHOFF, EE
    MARRIOTT, MD
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) : 267 - 276
  • [7] SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY
    BLAZEWICZ, J
    LENSTRA, JK
    KAN, AHGR
    [J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 11 - 24
  • [8] SOME EFFICIENT MULTI-HEURISTIC PROCEDURES FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING
    BOCTOR, FF
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 49 (01) : 3 - 13
  • [9] Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem
    Caprara, Alberto
    Furini, Fabio
    Malaguti, Enrico
    [J]. INFORMS JOURNAL ON COMPUTING, 2013, 25 (03) : 560 - 571
  • [10] Efficient priority rules for the stochastic resource-constrained project scheduling problem
    Chen, Zhi
    Demeulemeester, Erik
    Bai, Sijun
    Guo, Yuntao
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (03) : 957 - 967