Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

Table 2

Specifications of group of instances.

Group	MRCPSP sets used	Value(s) of NC	Value(s) of 𝐸(𝜂)	Number of problems
I	𝑗10,𝑗12,𝑗14,𝑗16,𝑗18,𝑗20,𝑗30	2	0.5CPL*, CPL, 2CPL	20 randomly selected instances from each set for each combination of (𝐸(𝜂1), 𝐸(𝜂2)) summing up to 180 instances from each set and 1260 instances for the group
II	𝑗10,𝑗12,𝑗14,𝑗16,𝑗18,𝑗20,𝑗30	1, 2, 4	CPL	20 randomly selected instances from each set for each value of NC, summing up to 60 instances from each set and 420 instances for the group

∗Critical path length of the project.