Optimization-based scheduling for the single-satellite, multi-ground station communication problem
From MaRDI portal
Recommendations
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
- A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
- Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
- An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem
- A constraint-based approach to satellite scheduling
Cites work
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A constraint-based approach to satellite scheduling
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Earth observation satellite management
- Scheduling space-ground communications for the air force satellite control network
- Three scheduling algorithms applied to the Earth observing systems domain
Cited in
(20)- An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem
- scientific article; zbMATH DE number 7155759 (Why is no real title available?)
- scientific article; zbMATH DE number 2221460 (Why is no real title available?)
- Robust integrated planning for LEO satellite network design and service operations
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- Scheduling pumpoff operations in onshore oilfields with electric-power constraints and variable cycle time
- Stochastic satellite tracking with constrained budget via structured-chromosome genetic algorithms
- Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
- Multi-objective approaches to ground station scheduling for optimization of communication with satellites
- Judgement theorems and an approach for solving the constellation-to-ground coverage problem
- A mixed integer linear programming model for multi-satellite scheduling
- Approximate path searching method for single-satellite observation and transmission task planning problem
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- Optimal balancing of satellite queues in packet transmission to ground stations
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
- Application of unified methodical approach to online planning of target operation of satellite monitoring and communication systems
- A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
- Optimizing ground station networks for free space optical communications: maximizing the data transfer
- A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes
This page was built for publication: Optimization-based scheduling for the single-satellite, multi-ground station communication problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337472)
