A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detach-graph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster's priority, and task potentiality for tasks' priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six bench-marks of the nines.
