Research Article
A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm
Table 4
Optimal makespan running the GA without improved initial population.
| | Population size | Execution time | Optimal makespan |
| | 250 | 17.9 | 252.86 | | 500 | 24.141 | 243.16 | | 1000 | 32.53 | 235.78 | | 5000 | 121.188 | 236.18 | | 10000 | 337.297 | 230.42 | | 20000 | 1068.2 | 228.62 | | 50000 | 5550 | 226.94 | | 100000 | 6720 | 215.42 |
|
|
