A Hybridized Metaheuristic Algorithm To Solve the Robust Resource Constrained Multi-Project Scheduling Problem

In this paper, the multi-project scheduling problem is studied. the duration of the activities is subjected to the considerable uncertainty and the robust optimization approach is considered to deal with the uncertainty. the maximum total tardiness of the projects is defined as the objective function which should be minimized. in order to allocate the constrained resources to the multi-projects, two models are proposed. in the first model, the projects are scheduled separately while in the second model, the multiproject approach is applied and the resource sharing policy is used. it is demonstrated that how the tardiness of the projects will be decreased when the multiproject approach is applied. also, the adaptive bee genetic algorithm (abga) is designed as a hybrid metaheuristic algorithm and proposed in this paper to solve the first stage model of the robust resource constrained multiproject scheduling problem (rrcmpsp ). the results of abga is compared with the results of scenariorelaxation algorithm as an exact algorithm for the small size problems. also, the performance of abga is studied compared to the genetic algorithm (ga) and artificial bee colony (abc) as two basic algorithms for the large size problems. the results show the effectiveness of the proposed algorithm in solving the rrcmpsp.