Research On Multi-Project RCPSP Problem Considering Robustness And Resource Dispatching Cost

With the diversified development of enterprises,the operation of multi-projects is becoming increasingly prevalent,whereas,multi-project execution means that different teams will compete for scarce resources,so overall planning and rational allocation of resources is the core problem of multi-project scheduling.As with RCPSP problem,in addition to ensuring that all projects are completed in the shortest time,multi-project scheduling should also take into account the transfer cost of renewable resources within and between projects in the process of resource allocation,what's more,it is also very important to develop a robust multi-project scheduling plan considering the uncertainties.This topics focus on the multi-project cost scheduling and multi-project robust scheduling,and study the impact of resource allocation on resource dispatching cost and robustness of project planning from the perspective of resource flow network optimization.In this thesis,firstly,we construct a resource-based multi-project scheduling optimization model with the consideration of the constraints of the total resources,the demand constraints of activities on resources,and the tight constraints of project activities.Then,combined with the advantages of GA and SA algorithm,the GSA algorithm is designed to solve the model,meanwhile,an experiment is designed to compare the performance of the three algorithms,thus verifying the effectiveness of the GSA algorithm.Finally,a real case is introduced to be molded and solved.Through the simulation,we observe the performance of solution in the simulation environment,and compare it with the stochastic resource a llocation scheme and the single-objective optimization resource al ocation scheme,and then verify the effectiveness of the model.