A multi-mode resource-constrained discrete time–cost tradeoff problem solving using an adjusted fuzzy dominance genetic algorithm

One of the most important problems in project scheduling applications is the discrete time-cost tradeoff problem (DTCTP). Due to real world resource-constraint situations in projects, this model is expanded to a multi-mode resource-constrained DTCTP model. In this model, each activity has multi modes to be performed. In each mode, the required resources for performing the activity are different, at least in one type. In addition, each activity can be done in either normal or crashing ways in each performing mode. The project cost consists of both direct and indirect costs. In this paper, we present the adjusted fuzzy dominance genetic algorithm to solve our proposed model. We explain the elements of the algorithm and solve some problems generated for this model, including large and small sizes, by this algorithm. The performance of our proposed algorithm is evaluated by comparison with four well-known algorithms; NSGAII, NRGA, PAES, MOIWO. The obtained results show the effectiveness of the proposed algorithm.