A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm

<table class="table-group" id="tab5"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left">Sequencing rule</td><td align="center">Execution time</td><td align="center">Optimal makespan</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">FIFO</td><td align="center">15.67</td><td align="center">148.05</td></tr><tr><td align="left">SPT</td><td align="center">16.99</td><td align="center">149.04</td></tr><tr><td align="left">LPT</td><td align="center">16.76</td><td align="center">238.06</td></tr><tr><td align="left">Johnson’s algorithm</td><td align="center">18.22</td><td align="center">269.06</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Optimal makespan with traditional job sequencing and dispatching rules.

Journal of Industrial Engineering

tab5

Table 5

Table 5: A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm 