Research Article
A FJSSP Method Based on Dynamic Multi-Objective Squirrel Search Algorithm
Table 1
Six task scheduling examples.
| | Job number | Process number | Machine number and corresponding processing time of each process | | 1 | 2 | 3 | 4 | 5 | 6 |
| | 1 | 1 | 2 | 3 | 4 | — | — | — | | 1 | 2 | — | 3 | — | 2 | 4 | — | | 1 | 3 | 1 | 4 | 5 | — | — | — | | 2 | 1 | 3 | — | 5 | — | 2 | — | | 2 | 2 | 4 | 3 | — | — | 6 | — | | 2 | 3 | — | — | 4 | — | 7 | 11 | | 3 | 1 | 5 | 6 | — | — | — | — | | 3 | 2 | — | 4 | — | 3 | 5 | — | | 3 | 3 | — | — | 13 | — | 9 | 12 | | 4 | 1 | 9 | — | 7 | 9 | — | — | | 4 | 2 | — | 6 | — | 4 | — | 5 | | 4 | 3 | 1 | — | 3 | — | — | 3 |
|
|
