摘要：Theresource constrained multi-project scheduling problem (RCMPSP) is an important issue in businessapplications. In this paper, a modified differential evolution algorithm is introducedto achieve higher computational efficiency forRCMPSP. Two parallel mutation operations are used to improve the search ability with a modified DE/rand-best/1/bin strategy. The selection operation is used to choose best individual from target vector and two trail vector. The computationalresults show that the modified DE algorithm performs better than several other algorithms of deterministic and heuristic nature.
