Nuclear Power Plant Construction Scheduling Problem with Time Restrictions: A Particle Swarm Optimization Approach

Table 4

The experimental results (time spanning).

Time spanning (seconds)	⁢ (Number of nuclear power plants, number of construction; teams, and number of reactor installation teams)
	(6, 1, 1)	(6, 2, 1)	(6, 1, 2)	(6, 2, 2)	(6, 2, 3)	(6, 3, 2)
The optimal solution of LINGO 11	534	200	196	413	386	568
The solution of the proposed method	1.56	0.82	1.04	1.32	0.89	1.65