An efficient algorithm for generalized SS/TDMA scheduling with satellite cluster

We consider the satellite cluster scheduling problem, which is one of the most interesting problems in the satellite communication scheduling area. This problem is known to be NP-complete, and a couple of heuristic algorithms have been developed. In this paper, we suggest another algorithm for this problem which has the same computational complexity as the best existing one and provides much better solution quality. Extensive computational simulation results are reported.