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

Table 4

Number of instances of each set of group II out of 60 solved to optimality in 20 seconds.

Sample problems sets	CPLEX Solver	PTA	EAA	MDAA	MFSA
𝑗10	60	60	60	59	60
𝑗12	60	60	60	60	60
𝑗14	56	60	60	58	60
𝑗16	50	60	56	47	50
𝑗18	38	60	53	48	34
𝑗20	27	55	45	38	36
𝑗30	8	3	0	14	9