说明：  贪婪随机自适应搜索法(GRASP)，使用随机化的最小最小完成时间算法来产生问题的初始解,再通过变邻域下降算法来改进这个解。
(Greedy randomized adaptive search method (GRASP), the minimum use of randomized algorithm to generate the minimum completion time of the initial solutions of the problem, and through the variable neighborhood descent algorithm to improve the solution.)