A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
From MaRDI portal
Publication:336398
DOI10.1016/j.cor.2013.02.009zbMath1348.90457MaRDI QIDQ336398
Jin Liu, Manhao Ma, Dishan Qiu, Guo-Hua Wu
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.009
90B35: Deterministic scheduling theory in operations research
90B90: Case-oriented studies in operations research
Related Items
A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, Scheduling for single agile satellite, redundant targets problem using complex networks theory, Metaheuristics for the tabu clustered traveling salesman problem, Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events, A mixed integer linear programming model for multi-satellite scheduling, Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, Across neighborhood search for numerical optimization, An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling, Approximate path searching method for single-satellite observation and transmission task planning problem, QUEST -- a new quadratic decision model for the multi-satellite scheduling problem, A branch and bound algorithm for agile earth observation satellite scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Strong formulation for the spot 5 daily photograph scheduling problem
- 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
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite