Research Article

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

Table 7

The results of the first example.

SolverF1F2ciMIDDMSNSNPSCPU time

GAMS3.96846.3976846.3986833.279196.295469.4966438.319
3.2656931.1236931.124
18.3756735.416735.435

MOSA16.790927107.187107.0387125.348157.35410210.74361621.438
15.502937122.9777122.994
15.014597153.9927154.008
15.906687097.1387097.155
15.73377116.3957116.413
15.730397154.4647154.481

MOEA/D16.02436793.5236793.5356989.0047301.46386947.93552320.862
15.959497094.9877095.005
16.154067078.4497078.468