A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
From MaRDI portal
Publication:336398
Recommendations
- A branch and bound algorithm for agile earth observation satellite scheduling
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Three scheduling algorithms applied to the Earth observing systems domain
- A heuristic for an earth observing satellite constellation scheduling problem with download considerations
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
- Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches
Cites work
- scientific article; zbMATH DE number 2050786 (Why is no real title available?)
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Ant colony optimization.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Strong formulation for the spot 5 daily photograph scheduling problem
- Three scheduling algorithms applied to the Earth observing systems domain
- Upper bounds for the SPOT 5 daily photograph scheduling problem
Cited in
(16)- A branch and bound algorithm for agile earth observation satellite scheduling
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- Multi satellites scheduling algorithm based on task merging mechanism
- Metaheuristics for the tabu clustered traveling salesman problem
- Across neighborhood search for numerical optimization
- Distance preserving recombination operator for Earth observation satellites operations scheduling
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
- A mixed integer linear programming model for multi-satellite scheduling
- Approximate path searching method for single-satellite observation and transmission task planning problem
This page was built for publication: A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336398)
