Table 1 An example for PFSP.
From: An improved salp swarm algorithm for permutation flow shop vehicle routing problem
Machines | Orders | |||
---|---|---|---|---|
1Â s | 2Â s | 3Â s | 4Â s | |
1 | 1Â s | 7Â s | 8Â s | 4Â s |
2 | 5Â s | 3Â s | 9Â s | 5Â s |
3 | 7Â s | 3Â s | 4Â s | 3Â s |
From: An improved salp swarm algorithm for permutation flow shop vehicle routing problem
Machines | Orders | |||
---|---|---|---|---|
1Â s | 2Â s | 3Â s | 4Â s | |
1 | 1Â s | 7Â s | 8Â s | 4Â s |
2 | 5Â s | 3Â s | 9Â s | 5Â s |
3 | 7Â s | 3Â s | 4Â s | 3Â s |