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

Table 4

The experiment levels of parameters for MOEA/D.

Algorithm parameters		First level	Second level	Third level
Maximum of iteration	MaxIt	90	100	120
Number of populations	nPop	40	60	80
Maximum number of archive	nArchive	10	20	30
The coefficient of creating harmony in the intersection operator	Gamma	0.5	0.6	0.7