Research Article
Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net
Algorithm 1
First condition: unparallelism of two masses.
For (byte ; _num
−1
; | K _best ; | for (byte ; i <= mass_num − 1; i++ | { | if (Loc_arr >= n) | Loc_arr = n − 1; | if (Loc_arr >= n) | Loc_arr = n − 1; | if (Loc_arr != Loc_arr | { | for (byte j = 0; j < mass_num − 1; j++ | if (K_best == −1) | { | K_best[j] = arr[Loc_arr , Loc_arr ; | break; | } | } |
}
|
|