A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy
Open Access
- 18 April 2013
- journal article
- research article
- Published by Hindawi Limited in The Scientific World Journal
- Vol. 2013, 1-11
- https://doi.org/10.1155/2013/304047
Abstract
Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments.Keywords
This publication has 13 references indexed in Scilit:
- A Lagrangian heuristic for satellite range scheduling with resource constraintsComputers & Operations Research, 2011
- Rolling-horizon scheduling for energy constrained distributed real-time embedded systemsJournal of Systems and Software, 2011
- Tests for global EDF schedulability analysisJournal of Systems Architecture, 2011
- Satellite scheduling considering maximum observation coverage time and minimum orbital transfer fuel costActa Astronautica, 2010
- Rolling Horizon Approach for Dynamic Parallel Machine Scheduling Problem with Release TimesIndustrial & Engineering Chemistry Research, 2009
- Constraint-based modeling of discrete event dynamic systemsJournal of Intelligent Manufacturing, 2008
- Three Scheduling Algorithms Applied to the Earth Observing Systems DomainManagement Science, 2000
- On a satellite coverage problemIEEE Transactions on Aerospace and Electronic Systems, 1995
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup timesInternational Journal of Production Research, 1994
- Some investigations on FCFS scheduling in hard real time applicationsJournal of Computer and System Sciences, 1992