Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems
Multiple-resource satellite scheduling problem (MuRRSP) is a complex and difficult scheduling problem, which schedules a large number of task requests onto ground-station antennas in order to communicate with the satellites. We first examined several exact algorithms that were previously implemented...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_ca |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/32239 |