A Method for Multi-project with Resource Constraints Based on Greedy Strategy

Abstract

Resource conflict is an outstanding problem in concurrent multiple projects with sharing a common and limited resource pool, and it often results in lower performance of these projects. Therefore, it is important and urgent to find an effective method for scheduling multiple projects with limited resources. A mathematical model for the multi-project scheduling problem with resource-constrained is proposed, and a scheduling algorithm based on greedy strategy for the problem is analyzed. Its application in real projects and comparison with other scheduling schemes proves that the algorithm is feasible.