Scheduling of a constellation of satellites: creating a mixed-integer linear model
From MaRDI portal
Publication:2055368
DOI10.1007/s10957-021-01875-2zbMath1481.90232OpenAlexW3166215860MaRDI QIDQ2055368
Publication date: 1 December 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01875-2
schedulingsimulated annealingmixed integer linear optimizationconstellation of satelliteslinear battery propagation model
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Optimization-based scheduling for the single-satellite, multi-ground station communication problem
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- Graph colouring approaches for a satellite range scheduling problem
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Maximizing the value of a space mission
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Maximizing the value of an Earth observation satellite orbit
- 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: Scheduling of a constellation of satellites: creating a mixed-integer linear model
