Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems

Algorithm 1

Pseudocode for neighborhood search.

while  New solution accepted = true

New solutions accepted = false

Determine the critical path, critical block in New schedule

List out the possible swaps of the operations

               for                       = 1 to total of possible swaps do

                                             Swap a pair of operations

                                             New schedule generated and makespan recalculated (New makespan)

                                             if                      New makespan  <  Current makespan

                                                                                                 Current makespan = New Makespan

                                                                                                New solution accepted = true

                                             end if

              end for

end while