상세정보
학술대회
CFTUE: “Construct First-finished Task avoiding Unconditional Exclusion” Algorithm for Single-Resource Satellite Mission Scheduling
Cited 1 time in 
Download 0 time
Share 
Download 0 time
Share
- 발행일
- 200704
- 출처
- AIAA International Communications Satellite Systems Conference (ICSSC) 2007, pp.1-8
- 협약과제
- 07MR1100, 통신해양기상위성 개발, 이성팔
- 초록
- In this paper, we propose an Construct First-finished Task avoiding Unconditional Exclusion (CFTUE) Algorithm for Single-Resource Satellite Mission Scheduling. At each step of the algorithm, the task which is able to be finished first is considered earlier to be scheduled based on a greedy approach. By selecting the task, however, another task might be discarded even though both of them may coexist. In this case, we schedule the discarded one instead of the former one. This principle does not follow the conventional wisdom that the current partial schedule should be compressed as much as possible so that more tasks are to be inserted later. However, performance evaluation shows that CFTUE algorithm contains more tasks than Construct First-finished Task (CFT) algorithm. © 2007 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.
- KSP 제안 키워드
- Greedy approach, Mission scheduling, Performance evaluation, Resource satellite, satellite mission