Greedy randomized adaptive search procedure for independent tasks assignment
Yiwen Zhong · Jisuanji gongcheng yu sheji · 2006
A greedy randomized adaptive search procedure is presented to tackle the independent tasks assignment problem in heteroge-neous environments.A randomized min-min complete time algorithm is used to construct an initial solution,and then a variable neigh-borhood descent algorithm is used to improve the solution.In order to improve its exploration ability,bad solution is accepted in the outer local search.Tabu list is used to keep the algorithm from cycling search.Using those strategies,the proposed algorithm get good balance between diversification and intensification.The simulation results comparing with typical algorithm in the fields show that the proposed algorithm produces good results.