Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites

Maocai Wang, Guangming Dai, Massimiliano Vasile

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)
132 Downloads (Pure)


Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.
Original languageEnglish
Article number234928
Number of pages11
JournalMathematical Problems in Engineering
Publication statusPublished - 17 Jul 2014


  • satellite scheduling
  • heuristic algorithms
  • dynamic tasks
  • earth observation satellites


Dive into the research topics of 'Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites'. Together they form a unique fingerprint.

Cite this