Summary: In the project scheduling literature, nonrenewable resources are assumed to be available in full amount at the beginning of the project. However, in practice, it is very common that these resources are procured along the project horizon according to some pre-scheduled plan. In this paper, we study an extended form of the resource-constrained project scheduling problem that is subject to this type of nonrenewable resources in addition to the renewable resources. In order to solve this problem, we propose a branch and cut algorithm. We incorporate with the algorithm some technics and fathoming rules to shorten the solving process. The algorithm is capable of specifying lower bounds for the problem in any middle stage of the solving process. The lower bounds can be useful to deal with large instances, for which the solving processes may be too long. We point out parameters affecting the degree of difficulty of the problem, generate extensive sets of sample instances for the problem, and perform comprehensive experimental analysis using our algorithm and also CPLEX solver. We analyze the algorithm behavior respect to the changes in instances degree of difficulties and compare its performances in different cases with the CPLEX solver.