Heuristics for scheduling resource-constrained projects in MPM networks

In the literature there are a large number of heuristics with priority rules for resource-constrained project scheduling problems in CPM networks but none for such problems in MPM networks. The reason is that MPM networks contain maximal distances and cycles and they have a much more complicated structure then CPM networks. In this paper heuristical methods are proposed to apply the conventional priority rules developed originally for CPM networks to MPM networks. The computational results have shown that the most promising method is to combine the conventional priority rules with some rules which consider the special structure of MPM networks.