Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

Algorithm 1

First condition: unparallelism of two masses.

For (byte 𝑗=0; 𝑗<𝑗_num −1 ; 𝑗++)

  K _best [𝑗]=−1;

for (byte 𝑖=0; i <= mass_num − 1; i++ )

   {

    if (Loc_arr [0,𝑖] >= n)

     Loc_arr [0,𝑖] = n − 1;

    if (Loc_arr [1,𝑖] >= n)

     Loc_arr [1,𝑖] = n − 1;

    if (Loc_arr [0,𝑘] != Loc_arr [0,𝑖])

     {

   for (byte j = 0; j < mass_num − 1; j++ )

    if (K_best [𝑗] == −1)

     {

     K_best[j] = arr[Loc_arr [0,𝑖], Loc_arr [1,𝑖]];

        break;

        }

   }

}