A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds

DOI10.1016/j.cor.2016.04.014zbMath1349.90895OpenAlexW3123398230MaRDI QIDQ342441

Dishan Qiu, Jianjiang Wang, Erik L. 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

zbMATH Keywords

branch and cutchance constraint programmingEarth observation satellitesproactive schedulingsample approximationuncertainties of clouds

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem ⋮ Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem ⋮ Scheduling of a constellation of satellites: creating a mixed-integer linear model ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling

Cites Work

• Unnamed Item
• 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 Lagrangian heuristic for satellite range scheduling with resource constraints
• Graph colouring approaches for a satellite range scheduling problem
• An integer programming approach for linear programs with probabilistic constraints
• A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
• Maximizing the value of a space mission
• A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
• Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
• Upper bounds for the SPOT 5 daily photograph scheduling problem
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Upper bounds for revenue maximization in a satellite scheduling problem
• Strengthened 0-1 linear formulation for the daily satellite mission planning
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• 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
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• 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
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite

This page was built for publication: A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds