Site-based and resource-constrained project scheduling problem: Model and heuristics

In this paper, we present a site-based and resource-constrained project scheduling problem with generalized precedence relation (SRCPSP-GPR) by extending the RCPSP-GPR, in which the site constraints are considered to minimize project durations. After formalizing the SRCPSP-GPR, we give three concepts, i.e., Same-site activities, SubNet and Combined-SubNet, based on the precedence and site constraints. Then, we propose two heuristic algorithms to resolve this problem, the SubNet based search (SNBS) algorithm and the Combined-SubnNet based search (CSNBS) algorithm. The experimental results show that CSNBS is much more effective than SNBS, i.e., it can get more minimum project durations. However, the computational complexity of CSNBS is obviously larger than that of SNBS.