Research Article
A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates
Table 1
Performance comparison of MGS and DSJF (uniform distribution %).
| | | = 3 | = 5 | = 10 |
| 50 jobs | = 1 | | | | = 2 | | | | = 5 | | | | = 8 | | | |
| 100 jobs | = 1 | | | | = 2 | | | | = 5 | | | | = 8 | | | |
| 200 jobs | = 1 | | | | = 2 | | | | = 5 | | | | = 8 | | | |
| 500 jobs | = 1 | | | | = 2 | | | | = 5 | | | | = 8 | | | |
| 1000 jobs | = 1 | | | | = 2 | | | | = 5 | | | | = 8 | | | |
|
|