AN EFFICIENT ALGORITHM FOR GENERALIZED SS/TDMA SCHEDULING WITH SATELLITE CLUSTER AND INTERSATELLITE LINKS
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.
- Publisher
- JOHN WILEY SONS LTD
- Issue Date
- 1995
- Language
- English
- Article Type
- Article
- Citation
INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS, v.13, no.1, pp.31 - 37
- ISSN
- 0737-2884
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 4 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.