Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
type: Item
instance of: scholarly article
title: Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
zbMATH Open document ID: 1407.90392
DOI: 10.1155/2014/234928
author: Maocai Wang
author: Guangming Dai
author: Massimiliano Vasile
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7015952
Wikidata QID: Q59064052
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/234928
OpenAlex ID: W2119328119
cites work: Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
cites work: Upper bounds for the SPOT 5 daily photograph scheduling problem
cites work: Graph colouring approaches for a satellite range scheduling problem
cites work: A Lagrangian heuristic for satellite range scheduling with resource constraints
cites work: A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
cites work: Scheduling space-ground communications for the air force satellite control network
description: scientific article; zbMATH DE number 7015952