Resource-constrained project scheduling problem (RCPSP) is one of the most important problems in the context of project scheduling. When each activity can be executed in different modes we have the MRCPSP problem that is considered in this paper. Another issue is that in most cases some problems like disruption in planned scheduled that is created by additional time that might be required for rework and correction of detected defects, will be happened. Executing time that is considered for every mode of an activity of the problem is probabilistic. At first we have provided a bi-objective model for this problem with minimizing malespan and maximizing robustness objectives. In this model the executing time of each activity mode is normally distributed. Since this problem in simplest way is strongly NP-hard, for solving, using metaheuristic algorithms like SA and GA is more reasonable. Finally the solution approaches for the problem is mentioned.
