A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

<table><tr><td><table class="algorithm" id="alg1"><tr><td colspan="2">Procedure the GSO algorithm </td></tr><tr><td colspan="2"> <i> </i> Initial population </td></tr><tr><td colspan="2"> <i> </i> While (criterion)</td></tr><tr><td colspan="2">      Choose the producers and perform the producing </td></tr><tr><td colspan="2">      Choose the scroungers and perform the scrounging </td></tr><tr><td colspan="2">      Disperse the rest individuals to perform ranging </td></tr><tr><td colspan="2">      Evaluate the individuals </td></tr><tr><td colspan="2"> <i> </i>  End while</td></tr><tr><td colspan="2">End procedure</td></tr></table></td></tr></table>

The procedure of the basic GSO algorithm.

Mathematical Problems in Engineering

alg1

Algorithm 1

Algorithm 1: A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown 