Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Table 9

Paired -tests on the average RER for new problem set.

IG vs.	T^2S*	T^2S* + PR	SARS
Difference	0.2403	0.0984	0.0128
Degree of freedom	89	89	89
-value	6.6505	5.3869	3.3017
One-tailed significance	<0.0001	<0.0001	0.0007