TY - JOUR
T1 - A multi-agent system for distributed multiproject scheduling with two-stage decomposition
AU - Li, Feifei
AU - Xu, Zhe
N1 - Publisher Copyright:
© 2018 Li, Xu. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
PY - 2018/10
Y1 - 2018/10
N2 - A two-stage decomposition approach based on a novel multi-agent system (MAS) is proposed for the distributed resource constrained multi-project scheduling problem (DRCMPSP). In stage one, from the point of view of each local project manager, a forward-backward hybrid genetic algorithm (FBHGA) is developed to generate an initial local schedule with the objective of minimizing individual project makespan. In stage two, from the global perspective of project management office, a sequential game-based negotiation mechanism is employed to eliminate global resource conflicts with the objective of minimizing total tardiness cost (TTC). The proposed approach is tested on 140 benchmark problem instances. According to the computational results, high-quality local project schedules can be obtained by FBHGA in stage one. Furthermore, it is observed that our method is capable of dealing with various complex multiproject instances under different degrees of resource conflicts in reasonable CPU running time. Compared to the existing decentralized methods for DRCMPSP, the proposed approach with sequential game-based negotiation mechanism shows the superiority in producing multiproject schedules with lower TTC, especially for large-size and strong conflicting instances.
AB - A two-stage decomposition approach based on a novel multi-agent system (MAS) is proposed for the distributed resource constrained multi-project scheduling problem (DRCMPSP). In stage one, from the point of view of each local project manager, a forward-backward hybrid genetic algorithm (FBHGA) is developed to generate an initial local schedule with the objective of minimizing individual project makespan. In stage two, from the global perspective of project management office, a sequential game-based negotiation mechanism is employed to eliminate global resource conflicts with the objective of minimizing total tardiness cost (TTC). The proposed approach is tested on 140 benchmark problem instances. According to the computational results, high-quality local project schedules can be obtained by FBHGA in stage one. Furthermore, it is observed that our method is capable of dealing with various complex multiproject instances under different degrees of resource conflicts in reasonable CPU running time. Compared to the existing decentralized methods for DRCMPSP, the proposed approach with sequential game-based negotiation mechanism shows the superiority in producing multiproject schedules with lower TTC, especially for large-size and strong conflicting instances.
UR - https://www.scopus.com/pages/publications/85054717044
U2 - 10.1371/journal.pone.0205445
DO - 10.1371/journal.pone.0205445
M3 - 文章
C2 - 30300417
AN - SCOPUS:85054717044
SN - 1932-6203
VL - 13
JO - PLOS ONE
JF - PLOS ONE
IS - 10
M1 - e0205445
ER -