A multi-PR&PSGS approach for distributed multi-project scheduling

Abstract

Abstract The research on the Distributed Resource Constrained Multi-Project Scheduling Problem (DRCMPSP) has gained significant importance. As a result, a Multi-PR&PSGS approach has been proposed. During the decision stage, a LFT & CPM algorithm is developed from the local decision-making perspective of each local project manager to generate a set of activities that can be scheduled while satisfying local resource constraints. Then, a Multi-PR heuristic algorithm that takes into account historical optimal simulation results of the Total Tardiness Cost (TTC) is used by the global project manager to obtain an optimal set of activities for scheduling. The proposed approach was tested using 140 benchmark problem instances from the Multi-Project Scheduling Problem Library (MPSPLIB). The computational results demonstrate that the proposed approach, consisting of a LFT & CPM algorithm and a Multi-PR & Simulation algorithm, can achieve a lower TTC compared to other existing methods for the DRCMPSP. Additionally, the longest CPU running time for the problem instances of MP120_20AC is 164.33s, making the approach a good choice for managing the DRCMPSP.