文献类型：期刊文献

英文题名：A three-stage decomposition algorithm for decentralized multi-project scheduling under uncertainty

作者：Liu, Dongning[1];Xu, Zhe[1];Li, Feifei[2]

第一作者：Liu, Dongning

通讯作者：Xu, Z[1]

机构：[1]Beihang Univ, Coll Econ & Management, Beijing 100191, Peoples R China;[2]Beijing Union Univ, Coll Management, Beijing 100101, Peoples R China

第一机构：Beihang Univ, Coll Econ & Management, Beijing 100191, Peoples R China

通讯机构：[1]corresponding author), Beihang Univ, Coll Econ & Management, Beijing 100191, Peoples R China.

年份：2021

卷号：160

外文期刊名：COMPUTERS & INDUSTRIAL ENGINEERING

收录：;EI(收录号：20213010685520);Scopus(收录号：2-s2.0-85111051293);WOS:【SCI-EXPANDED(收录号:WOS:000694743900001)】；

基金：We gratefully acknowledge the support given by the National Natural Science Foundation of China (71571005) , and Natural Science Foundation of Beijing Municipality (9214024) .

语种：英文

外文关键词：Multi-project scheduling; Decentralized scheduling; Resource disruption; Priority rule

摘要：Decentralized management of multiple projects is a common practice in areas such as maintenance service, supply chain management, and globalized manufacturing. Nevertheless, the resolution of resource conflicts among multiple projects caused by management independence is a challenging task in generating a multi-project baseline schedule. Various unexpected events may also affect the project execution phase, leading to resource disruptions that can cause the baseline schedule to become infeasible and necessitate its repair. Here, we study the decentralized multi-project scheduling problem subject to global resource disruption, which is NP-hard. To obtain high-quality baseline schedules and effectively repair disrupted schedules, we formulated a three-stage decomposition model. Then, we developed a three-stage decomposition algorithm with a task-scoring mechanism (TDA-TS), which is generic for the processes of schedule generation and repair. Proposed new priority rules were developed that used information about the local schedules and were organized as TDA-TS to further improve its performance. A comprehensive experiment was conducted on the Multi-Project Scheduling Problem LIBrary dataset. The experimental results indicated that the proposed algorithm outperformed several existing centralized and distributed algorithms in the generation of baseline schedules and that it could effectively repair disrupted schedules even for large instances. Furthermore, we saw that the newly proposed priority rule embedded in TDA-TS significantly outperformed other priority rules in repairing the disrupted schedules. The results of this research are valuable for managers who need to effectively repair disrupted schedules in a decentralized multi-project environment facing various disruptions.