This paper proposes a GRASP algorithm to solve the SumCut minimization problem. In the SumCut problem one is given a graph with n nodes and must label the nodes in a way that each node receives a unique label from the set 1, 2, … , !, in order to minimize the sum cut of the generated solution. The SumCut problem is really important in archeology (in seriation tasks) and in genetics, helping in the Human Genoma Project. This problem is equivalent to the Profile problem, but giving the reverse solution. Both problems are graph layout problems, and they are equivalent, because a solution for SumCut is reversal solution for Profile problem. This paper will solve only the SumCut problem, so in order to obtain a solution for the Profile problem it is only need to reverse the given solution.