• 제목/요약/키워드: satellite cluster scheduling problem

검색결과 3건 처리시간 0.018초

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

  • Kim, Sehun;Kim, Soo-Hyun
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • 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.

위성간 링크가 있는 위성군집시스템의 트래픽 스케줄링 (Traffic Scheduling Algorithms for a SS/TDMA Cluster with Inter-Satellite Links)

  • Kim, Soo-Hyun;Chang, Kun-Nyeong;Kim, Sehun
    • 한국경영과학회지
    • /
    • 제28권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.

위성간 링크를 가진 SS/TDMA 망에 대한 타임슬롯 스케줄링 알고리즘 (Time Slot Scheduling Algorithm for SS/TDMA Networks with Intersatellite Links)

  • 장근녕
    • 산업공학
    • /
    • 제12권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.

  • PDF