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

Table 8

The results of the second example.

Solver	F1	F2	ci	MID	DM	SNS	NPS	CPU time
GAMS	96.687	17083.71	17083.99	16316.24	2975.562	510.3927	7	53.866
	96.954	16364.31	16364.6
	93.629	16275.86	16276.13
	11.918	14512.08	14512.08
	101.701	17486.18	17486.48
	105.125	16964.74	16965.07
	95.016	16292.83	16293.1
MOSA	83.29856	16175.07	16175.29	15846.64	1811.04972	297.0425	6	50.040
	83.86166	15761.25	15761.47
	83.60755	16997.18	16997.38
	87.97861	15654.26	15654.51
	9331055	15304.49	15304.77
	94.26282	15186.16	15186.46
MOEA/D	85.18027	16962.28	16962.49	16337.45	1582.83487	305.2107	6	49.029
	85.52582	15986.74	15986.97
	85.66592	15900.14	15900.37
	90.99155	15899.48	15899.74
	84.44851	17428.74	17428.95
	92.54549	15845.93	15846.2