Insert_among_Factories

Remove a job from πF∗ and reinsert it into the position selected from one of its available factories F_r randomly.

The above mutation operators can be executed for 15 cycles at most in the paper. If π′ is generated by the one of the mutation operators performed on the parent food source π in a certain cycle. If f(π^’)≺ f(π), then π ←π′, limit = 0 and the cycle is terminated If the f(π′) and f(π) do not dominate each other, then f(π′) will be compared with other individuals in the populations (denotes as π″) to see if there is a dominant relationship between them. If there is a dominant relationship, the dominant solution will be abandoned and continue with next cycle. If there is no solution that can dominate f(π) at the end of 15 cycles, then limit = limit + 1. The pseudocode of the mutation operators is as follows, and F_* is the critical factory with the greatest makespan among all factories.