Abstract | ||
---|---|---|
The data transmission dynamic scheduling is a process that allocates the ground stations and available time windows to the data transmission tasks dynamically for improving the resource utilization. A novel heuristic is proposed to solve the data transmission dynamic scheduling problem. The characteristic of this heuristic is the dynamic hybridization of simple rules. Experimental results suggest that the proposed algorithm is correct, feasible, and available. The dynamic hybridization of simple rules can largely improve the efficiency of scheduling. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1155/2013/837659 | JOURNAL OF APPLIED MATHEMATICS |
Field | DocType | Volume |
Heuristic,Mathematical optimization,Fair-share scheduling,Scheduling (computing),Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Mathematics,Round-robin scheduling | Journal | 2013 |
Issue | ISSN | Citations |
null | 1110-757X | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hao Xu | 1 | 13 | 6.30 |
Yue Zhao | 2 | 104 | 18.48 |
Lining Xing | 3 | 16 | 8.51 |
You Zhou | 4 | 81 | 6.51 |