Scheduling Auction (SA) is a VCG auction, which requires to solve multiple optimization problems to determine the payment of each player. SA loses its desirable properties if it cannot obtain the exact solutions of the problems. We have proposed a Scheduling Auction mechanism utilizing a Distributed Genetic Algorithm to mitigate the adverse effects caused by the infeasibility of rigorously solving the optimization problems. This paper provides some ingenuity of the migration operation among the optimization problems being solved by GA in parallel.