A multi-objective scheduling algorithm for multi-mode resource constrained projects in the presence of uncertain resource availability

被引:1
|
作者
Mehrdad, Pouya [1 ]
Delgoshaei, Aidin [2 ]
Ali, Ahad [3 ]
机构
[1] Univ Kar, Dept Ind Engn, Alvand, Iran
[2] Ryerson Univ, Dept Mech & Ind Engn, Toronto, ON, Canada
[3] Lawrence Technol Univ, Southfield, MI USA
关键词
Multi-Objective Scheduling; Resource Constrained; Resources Over-allocation; Positive Cash Flow; GENETIC ALGORITHM; OPTIMIZATION; ALLOCATION; TIME;
D O I
10.14488/BJOPM.2021.007
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Goal: The issue of resource allocation is a major concern for project engineers in the scheduling process of a project. Resources over-allocation are often seen in practice after the scheduling of a project, which makes scheduling unhelpful. Modifying an over-allocated schedule is very complicated and requires a lot of effort and time. Besides, during the scheduling process of resource-constrained projects in the constructing companies, managers should concern more than one objective at the same time. This research aims to propose a new heuristic algorithm for minimizing project completion time, cost or maximizing quality of execution of activities simultaneously while multi-mode activities are taken into consideration. Design / Methodology / Approach: In this research, a new heuristic method is proposed for solving multi-objective scheduling problem for multi-mode resource constrained project scheduling problems (MRCPSPs) where the aim is maximizing the net present value (NPV) of project, minimize completion time and maximize the quality of executing activities simultaneously and along with emerging the uncertainty of resources availability and activity durations. The proposed method is then coded by Matlab (R) 2016. Results: The outcomes of solving small, medium and large scale case studies, the following results achieved: (i) the algorithm could solve all problems in different circumstances with no difficulties; (ii) the large scale problems (with 200 activities, 20 resources and 3 execution modes for each activity) could be solved in 4.43 seconds. (iii) in none of the studied cases over-allocation problem. The proposed method can be considered among the fastest scheduling algorithms found in the literature. In addition, it is found that makespan, NPV and quality have co-relation must be taken into consideration during the scheduling process. Limitations of the investigation: The main limitations of this research is that it only covers resource constrained project scheduling. Moreover, risk factors associated with the objectives of this research have yet to be addressed in future research studies. Practical implications: The performance of the algorithm is validated by using 24 series of dataset that are found in the literature. In order to verify its performance in real practice, it has been applied for a part of a construction project in Malaysia. The outcomes indicated that the algorithm scheduled the problem with 23 activities, 5 constrained resources and 2 execution modes in less than a second and with no over-allocations. The proposed multi-objective algorithm allows the project managers to consider NPV, completion time and quality of activities while scheduling a multi-mode project. In practice, this algorithm can provide a better atmosphere for managers while they aim to consider more than one objective during the scheduling process. Originality / Value: The proposed algorithm is original and can be of great value for future studies and managers in preventing resource over-allocation during the scheduling of multi-objective multi-mode resource constraint project scheduling. Moreover, it can help project managers to find near optimum solutions for complex multi-objective resource constraint projects faster and also with more accuracy.
引用
收藏
页数:26
相关论文
共 50 条
  • [31] Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling
    Tchao, Celso
    Martins, Simone L.
    [J]. LEARNING AND INTELLIGENT OPTIMIZATION, 2008, 5313 : 234 - +
  • [32] Simulated annealing for multi-mode resource-constrained project scheduling
    Józefowska, J
    Mika, M
    Rózycki, R
    Waligóra, G
    Weglarz, J
    [J]. ANNALS OF OPERATIONS RESEARCH, 2001, 102 (1-4) : 137 - 155
  • [33] A matheuristic approach to the multi-mode resource constrained project scheduling problem
    Fernandes, Gustavo Alves
    de Souza, Sergio Ricardo
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 162
  • [34] Modelling and Solving Multi-mode Resource-Constrained Project Scheduling
    Szeredi, Ria
    Schutt, Andreas
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, 2016, 9892 : 483 - 492
  • [35] Multi-Objective algorithms to multi-moue resource-constrained projects under mode change disruption
    Elloumi, Sonda
    Fortemps, Philippe
    Loukil, Taicir
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 106 : 161 - 173
  • [36] A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty
    Sadeghloo, Maryam
    Emami, Saeed
    Divsalar, Ali
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024, 339 (03) : 1637 - 1677
  • [37] Bi-objective optimization of a multi-mode, multi-site resource-constrained project scheduling problem
    Hessami, Shiba
    Davari-Ardakani, Hamed
    Javid, Youness
    Ameli, Mariam
    [J]. JOURNAL OF MODELLING IN MANAGEMENT, 2024, 19 (04) : 1136 - 1154
  • [38] An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem
    Wang, Ling
    Fang, Chen
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 449 - 460
  • [39] Scheduling Multi-Mode Resource-Constrained Projects Using Heuristic Rules Under Uncertainty Environment
    Abdel-Basset, Mohamed
    Sleem, Ahmed
    Atef, Asmaa
    Nam, Yunyoung
    Abouhawwash, Mohamed
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 70 (01): : 847 - 874
  • [40] A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem
    Fernandes Muritiba, Albert Einstein
    Rodrigues, Carlos Diego
    da Costa, Franciio Araujo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 92 : 145 - 154