With an instance, it has proved that the upper bounds of the performance ratio of the aggregation algorithm are achievable for the MAFS scheduling problem.

• 用一实例证明，MAFS排序问题的归并算法的性能比是上界可达的。