Abstract
PurposeThis paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.Design/methodology/approachThis paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.FindingsThe results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.Originality/valueThe paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference51 articles.
1. An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem;European Journal of Operational Research,2019
2. Baumann, P., Fündeling, C.U. and Trautmann, N. (2015), “The resource-constrained project scheduling problem with work-content constraints”, in Schwindt, C. and Zimmermann, J. (Eds), International Handbooks on Information Systems, Springer, Cham, pp. 534-544.
3. Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound;4OR,2011
4. Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities;OR Spectrum,2016
5. The total adjustment cost problem with variable activity durations and intensities;European Journal of Industrial Engineering,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献