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

<div>The comparison of the three algorithms. (a) <i>n</i> = 20, <i>k</i> = 4. (b) <i>n</i> = 50, <i>k</i> = 6. (c) <i>n</i> = 100, <i>k</i> = 8.</div>

Mathematical Problems in Engineering

fig3

Figure 3

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