• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.13-20
• /
• 1994

We consider the satellite cluster scheduling problem which is one of the most interesting problems in satellite communication scheduling area. This problem is known to be NP-complete and a couple of heuristic algorithms had 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• IE interfaces
• /
• v.12 no.1
• /
• pp.19-25
• /
• 1999

The time slot scheduling problem for a satellite cluster with an arbitrary number of satellite is considered, which is one of the most interesting problems in the satellite communication scheduling area. This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, a new efficient algorithm is suggested, which has lower computational complexity and provides much better solution than other existing algorithms.