Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint

Table 10

The results of metrics for each algorithm used in mid- and high-dimensional problems.

No.	Time(s)		MID		SNS		DM		NPS
	MOSA	MOEAD	MOSA	MOEAD	MOSA	MOEAD	MOSA	MOEAD	MOSA	MOEAD
3	173.2312	171.9171	45128	45066	542.2878	1915.129	4336.2	1314.3	4	4
4	490.708	425.816	150620	142280	661.9441	11370.84	21569	1612.2	3	4
5	954.5742	846.1652	264590	230780	1619.275	13641.11	33162	3232.5	4	3
6	1693.4007	1474.5585	349960	336930	3799.9	43734.55	83724	5378	3	2
7	3456.254	3283.7964	935947.19	930970	18821.77	33256.27	74419.3722	32944	6	3
8	9167.7022	9059.0237	2405000	2436500	58758.09	54630	124940	138560	5	4
9	46908.3333	45855.676	10119000	10179000	354790	443370.4	912610	502130	4	2
10	6554.5178	6402.0004	124420000	112720000	2109300	17022889	29934000	2986800	3	2