A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
DOI10.1016/J.COR.2016.04.014zbMATH Open1349.90895OpenAlexW3123398230MaRDI QIDQ342441FDOQ342441
Authors: Jianjiang Wang, Dishan Qiu, Erik Demeulemeester
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/460886
Recommendations
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
- Multi satellites scheduling algorithm based on task merging mechanism
- A branch and bound algorithm for agile earth observation satellite scheduling
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
chance constraint programmingbranch and cutEarth observation satellitesproactive schedulingsample approximationuncertainties of clouds
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15)
Cites Work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- An integer programming approach for linear programs with probabilistic constraints
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Preselective strategies for the optimization of stochastic project networks under resource constraints
- Algorithmic approaches to preselective strategies for stochastic scheduling problems
- Maximizing the value of an Earth observation satellite orbit
- 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
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Three scheduling algorithms applied to the Earth observing systems domain
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Title not available (Why is that?)
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Graph colouring approaches for a satellite range scheduling problem
- Maximizing the value of a space mission
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- Upper bounds for revenue maximization in a satellite scheduling problem
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- A Lagrangian heuristic for satellite range scheduling with resource constraints
Cited In (13)
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- Multi satellites scheduling algorithm based on task merging mechanism
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite
- Distance preserving recombination operator for Earth observation satellites operations scheduling
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- Scheduling of Earth observing satellites using distributed constraint optimization
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
This page was built for publication: A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342441)