Solving a generalised precedence multi‐objective multi‐mode time‐cost‐quality trade‐off project scheduling problem using a modified NSGA‐II algorithm

In this paper, a new mathematical formulation is proposed to model a generalised precedence multi‐objective multi‐mode time‐cost‐quality trade‐off project scheduling problem (GPDTCQTP). Afterwards, a modified NSGA‐II algorithm is developed to solve the proposed GPDTCQTP. The modified NSGA‐II utilises a dynamic parameter tuning and a heuristic self‐adaptive constraint handling strategy. These properties result in proper performance in regenerating the Pareto front of the GPDTCQTP. Investigating the efficiency of proposed algorithm several benchmark instances are systematically generated and solved. The proposed procedure is straightforward and results are promising.