Data redistribution has been widely studied in the literature. In recent years, several papers proposed scheduling algorithms to execute redistributions under different constraints in a minimal amount of time. More recently, with the expansion of grid computing, several algorithms have been proposed to schedule the messages in a redistribution taking place between two distant clusters. Here, we describe different existing scheduling methods and explain the differences among them. We present a comparison between them for the cases of local redistributions and inter-cluster redistributions.