Name
Abstract | ||
|---|---|---|
The Earth Observation Satellites Scheduling problem (SMS) involves scheduling tasks to be performed by a satellite, where new task requests can arrive at any time, non-deterministically, and must be scheduled in real-time. This paper describes a new Satellite Mission Scheduling algorithm based on Constraint Satisfaction Problem (CPP). We describe the dynamic scheduling problem as a dynamic weighted maximal CSP in which constraints can be changed dynamically. It is usually undesirable to drastically modify the previous schedule in the re-scheduling process. This paper presents a new Satellite Mission Scheduling problem based on Constraint Satisfaction Problem (SMSCSP). The simulation results show that the proposed approach is effective and efficient in applications to the real problems. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/CSSE.2008.577 | CSSE (4) |
Keywords | Field | DocType |
scheduling,operations research,real time,schedules,dynamic scheduling,artificial satellites,cost accounting,scheduling problem,imaging,earth,earth observation,scheduling algorithm,satellites,constraint satisfaction problem | Multiprocessor scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Nurse scheduling problem,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
Volume | Issue | Citations |
4 | null | 2 |
PageRank | References | Authors |
0.40 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baolin Sun | 1 | 67 | 11.74 |
| Wenxiang Wang | 2 | 18 | 1.28 |
| Qianqing Qi | 3 | 2 | 0.40 |