Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

<table class="table-group" id="tab13"><tr><td><table class="table"><tr><td class="thead-hr" colspan="6"><hr/></td></tr><tr class="thead"><td class="align_left">Optimization</td><td class="align_center">LB1</td><td class="align_center">LB2</td><td class="align_center">EPRA</td><td class="align_center">ESRA</td><td class="align_center">ESPRA</td></tr><tr><td class="thead-hr" colspan="6"><hr/></td></tr><tr><td class="align_left">2347</td><td class="align_center">2138</td><td class="align_center">2278</td><td class="align_center">2623</td><td class="align_center">2591</td><td class="align_center">2403</td></tr><tr class="table-tr"><td colspan="6"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Mathematical Problems in Engineering

tab13

Table 13

Table 13: Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times 