A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing

被引:16
|
作者
Van den Eeckhout, M. [1 ]
Vanhoucke, M. [1 ,2 ,3 ]
Maenhout, B. [1 ]
机构
[1] Univ Ghent, Fac Econ & Business Adm, Tweekerkenstr 2, B-9000 Ghent, Belgium
[2] Vlerick Business Sch, Technol & Operat Management Area, Ghent, Belgium
[3] UCL, UCL Sch Management, London, England
关键词
Multi-project scheduling; Personnel staffing; Column generation; Diving heuristic; Resource sharing; BRANCH-AND-PRICE; EMPLOYEE SCHEDULING PROBLEM; MATHEMATICAL-MODEL; NURSING STAFF; ALLOCATION; FLEXIBILITY; ALGORITHM; MOVEMENT; WORKERS; SHIFTS;
D O I
10.1016/j.cor.2020.105163
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Project managers are often responsible for the management of multiple projects and associated personnel budgeting decisions. In order to determine the workforce size and mix accurately, we integrate the multi project scheduling problem and personnel staffing problem. We construct a baseline personnel roster that takes the personnel scheduling constraints into account and model the workload stemming from the project activities as an endogenous variable in the model. In order to decrease the overall staffing budget, we consider the sharing of resources, i.e. personnel resources can be transferred between projects. In the problem under study, we consider unproductive resource transfer times and different restrictions related to the sharing of resources imposed on the schedule of individual workers, which is often neglected in the literature. We propose a multi-stage solution procedure that exploits the optimal linear programming solution, obtained via column generation, to find a high-quality integer solution based on a diving heuristic. In order to improve the computational performance, different speed-up mechanisms are included relying on a state space reduction. Detailed computational experiments are presented to evaluate and benchmark different alternative optimisation strategies. Managerial insights are provided which give insight in the benefits of resource sharing. ? 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:19
相关论文
共 47 条
  • [41] A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem
    Satic, U.
    Jacko, P.
    Kirkbride, C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 315 (02) : 454 - 469
  • [42] A graphical processing unit-based parallel hybrid genetic algorithm for resource-constrained multi-project scheduling problem
    Uysal, Furkan
    Sonmez, Rifat
    Isleyen, Selcuk Kursat
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (16):
  • [43] Multi-objective teaching-learning-based meta-heuristic algorithms to solve multi-skilled project scheduling problem
    Zabihi, Sina
    Kahag, Mahdi Rashidi
    Maghsoudlou, Hamidreza
    Afshar-Nadjafi, Behrouz
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 136 : 195 - 211
  • [44] Robust Optimization Based Heuristic Approach for Solving Stochastic Multi-Mode Resource Constrained Project Scheduling Problem
    Chakrabortty, R. K.
    Ryan, M. J.
    2020 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM), 2020, : 1157 - 1161
  • [45] A Two-Stage Algorithm Based on 12 Priority Rules for the Stochastic Distributed Resource-Constrained Multi-Project Scheduling Problem With Multi-Skilled Staff
    Yu, Yining
    Xu, Zhe
    Zhao, Song
    IEEE ACCESS, 2023, 11 : 29554 - 29565
  • [46] A decomposition-based multi-objective genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem
    Zhu, Lei
    Lin, Jian
    Li, Yang-Yuan
    Wang, Zhou-Jing
    KNOWLEDGE-BASED SYSTEMS, 2021, 225
  • [47] Q-learning based hyper-heuristic algorithm for solving multi-mode resource-constrained project scheduling problem
    Cui J.
    Lyu Y.
    Xu Z.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (05): : 1472 - 1481