Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
From MaRDI portal
Publication:1717905
DOI10.1155/2014/234928zbMath1407.90392OpenAlexW2119328119WikidataQ59064052 ScholiaQ59064052MaRDI QIDQ1717905
Maocai Wang, Guangming Dai, Massimiliano Vasile
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/234928
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ Judgement theorems and an approach for solving the constellation-to-ground coverage problem ⋮ An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
Cites Work
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- Graph colouring approaches for a satellite range scheduling problem
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Scheduling space-ground communications for the air force satellite control network
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
This page was built for publication: Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
