application of grouping genetic algorithm to solve resource constrined multi project scheduling via priorities and total budget

in this paper, a mathematical model is proposed for resource-constraint multi-project scheduling problem which involves multi-mode activities, priority strategies, and total budget. the problem is formulated as a non-linear mixed integer programming and attempts to minimize total weighted tardiness. due to the complexity and combinatorial nature of the model, a grouping genetic algorithm (gga) is proposed to solve the non-linear model. in order to show the efficiency of this proposed algorithm, simple genetic algorithm (sga) and gams solver are also applied. to evaluate the performance of gga, a number of xperiments is run. our computational results show that our proposed gga in almost all cases outperforms sga and gams solver.