On the tractability of satellite range scheduling

DOI10.1007/s11590-014-0744-8zbMath1310.90057OpenAlexW2141163456MaRDI QIDQ2017833

Antonio J. Vazquez, Richard Scott Erwin

Publication date: 23 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0744-8

zbMATH Keywords

scheduling algorithmEarth observation satelliteground station network

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (5)

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 ⋮ Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm ⋮ Scheduling for single agile satellite, redundant targets problem using complex networks theory ⋮ Approximate path searching method for single-satellite observation and transmission task planning problem

Cites Work

• Unnamed Item
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Scheduling jobs with fixed start and end times
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• Interval scheduling: A survey
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling space-ground communications for the air force satellite control network

This page was built for publication: On the tractability of satellite range scheduling