A branch and bound algorithm for agile earth observation satellite scheduling
From MaRDI portal
Publication:2314755
DOI10.1155/2017/7345941zbMath1453.90235OpenAlexW2751670160MaRDI QIDQ2314755
Yuning Chen, Xiaogeng Chu, Li-Ning Xing
Publication date: 30 July 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/7345941
Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Orbital mechanics (70M20)
Related Items (2)
An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
Cites Work
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Time-dependent scheduling
- A generic arc-consistency algorithm and its specializations
- A concise survey of scheduling with time-dependent processing times
- A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations
- Time–dependent Simple Temporal Networks: Properties and Algorithms
- Solution of a Large-Scale Traveling-Salesman Problem
This page was built for publication: A branch and bound algorithm for agile earth observation satellite scheduling
