A reactive scheduling approach for the resource-constrained project scheduling problem with dynamic resource disruption

被引:4
作者
Xu, Jiaojiao [1 ]
Bai, Sijun [1 ]
机构
[1] Northwestern Polytech Univ, Sch Management, Xian, Peoples R China
关键词
Project scheduling; Dynamic resource disruption; Reactive schedule; Hybrid genetic algorithm; VACATIONS; ALGORITHM; SEARCH; MODELS;
D O I
10.1108/K-09-2022-1339
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2007 / 2028
页数:22
相关论文
共 51 条
[1]   An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem [J].
Arkhipov, Dmitry ;
Battaia, Olga ;
Lazarev, Alexander .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (01) :35-44
[2]  
Baumann P, 2015, INT HANDB INFORM SYS, P533, DOI 10.1007/978-3-319-05443-8_24
[3]   The total adjustment cost problem with variable activity durations and intensities [J].
Bianco, Lucio ;
Caramia, Massimiliano ;
Giordani, Stefano .
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2017, 11 (06) :708-724
[4]   Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities [J].
Bianco, Lucio ;
Caramia, Massimiliano ;
Giordani, Stefano .
OR SPECTRUM, 2016, 38 (02) :405-425
[5]   Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound [J].
Bianco, Lucio ;
Caramia, Massimiliano .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2011, 9 (04) :371-389
[6]   Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting [J].
Buddhakulsomsiri, Jirachai ;
Kim, David S. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (01) :279-295
[7]   Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting [J].
Buddhakulsomsiri, Jirachai ;
Kim, David S. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (02) :374-390
[8]   An event-based reactive scheduling approach for the Resource Constrained Project Scheduling Problem with unreliable resources [J].
Chakrabortty, Ripon K. ;
Rahman, Humyun Fuad ;
Haque, Khan M. A. ;
Paul, Sanjoy Kumar ;
Ryan, Michael J. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 151
[9]   Efficient priority rules for project scheduling under dynamic environments: A heuristic approach [J].
Chakrabortty, Ripon K. ;
Rahman, Humyun Fuad ;
Ryan, Michael J. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 140
[10]   Single mode resource constrained project scheduling with unreliable resources [J].
Chakrabortty, Ripon K. ;
Sarker, Ruhul A. ;
Essam, Daryl L. .
OPERATIONAL RESEARCH, 2020, 20 (03) :1369-1403