Multi satellites scheduling algorithm based on task merging mechanism
DOI10.1016/j.amc.2013.12.109zbMath1410.90097OpenAlexW2060745884MaRDI QIDQ1644117
Chen Yingwu, Yao Feng, Bai Baocun, Liu Xiaolu
Publication date: 21 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.109
schedulingdynamic programmingadaptive ant colony optimizationdecomposition optimizationEarth observation satellitetask merging
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A new rank based version of the ant system. -- A computational study
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Maximizing the value of an Earth observation satellite orbit
This page was built for publication: Multi satellites scheduling algorithm based on task merging mechanism