Satellite data transmission planning of multi-satellite and multi-station is how to allocate the time of satellites and grand stations when one of the follow cases happens: A) a satellite could access several grand stations, or B) a grand station could be accessed by several satellites, even C) the mixture of case A) and B). The problem is viewed as a matrix transform firstly, and each matrix element is a time windows’ set which belongs a pair of satellite and grand station; the model is built on matrix secondly; the feature of optimum value is found and proved thirdly; lastly, the greedy algorithm is applied to solve the model. The simulation result shows that the greedy algorithm is more than 90% of the upper threshold of optimum value.