Complexity / 2022 / Article / Tab 7 / 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.
Solver F1 F2 ci MID DM SNS NPS CPU time GAMS 3.9 6846.397 6846.398 6833.279 196.2954 69.49664 3 8.319 3.265 6931.123 6931.124 18.375 6735.41 6735.435 MOSA 16.79092 7107.18 7107.038 7125.3481 57.354102 10.74361 6 21.438 15.50293 7122.977 7122.994 15.01459 7153.992 7154.008 15.90668 7097.138 7097.155 15.7337 7116.395 7116.413 15.73039 7154.464 7154.481 MOEA/D 16.0243 6793.523 6793.535 6989.0047 301.463869 47.93552 3 20.862 15.95949 7094.987 7095.005 16.15406 7078.449 7078.468