Advertisement

The Satellite Range Scheduling Problem

Chapter
  • 697 Downloads
Part of the Springer Optimization and Its Applications book series (SOIA, volume 106)

Abstract

Existing literature has provided several different suboptimal algorithms for the Satellite Range Scheduling problem. The authors present a precise mathematical definition of the problem, and provide a detailed classification of different variants of the problem. Compared to previous publications by the authors, this chapter provides better definitions of a number of the classification terms, additional examples for illustrating the mathematical model, and new results on the complexity of some of the variants of the problem. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Keywords

Satellite Range Scheduling Visibility Windows General Scheduling Problem Time-varying Graphs (TVG) Ground Station Network (GSN) 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).

References

  1. 1.
    W.J. Wolfe, S.E. Sorensen, Three scheduling algorithms applied to the Earth observing systems domain. Manag. Sci. 46(1), 148–168 (2000)CrossRefzbMATHGoogle Scholar
  2. 2.
    L. Barbulescu, J.P. Watson, L.D. Whitley, A.E. Howe, Scheduling space-ground communications for the Air Force Satellite Control Network. J. Sched. 7(1), 7–34 (2004)CrossRefzbMATHGoogle Scholar
  3. 3.
    F. Marinelli, F. Rossi, S. Nocella, S. Smriglio, A Lagrangian heuristic for satellite range scheduling with resource constraints. Comput. Oper. Res. 38(11), 1572–1583 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    M. Schmidt, Ground station networks for efficient operation of distributed small satellite systems. PhD Thesis, University of Wurzburg (2011)Google Scholar
  5. 5.
    L.V. Barbulescu, Oversubscribed scheduling problems. Thesis Proposal (2002)Google Scholar
  6. 6.
    H. Jung, M. Tambe, A. Barret, B. Clement, Enabling efficient conflict resolution in multiple spacecraft missions via DCSP, in Proceedings of the 3rd NASA Workshop on Planning and Scheduling (NASA, Houston, 2002)Google Scholar
  7. 7.
    S.E. Burrowbridge, Optimal allocation of satellite network resources. MSc Thesis, Virginia Polytechnic and State University (1999)Google Scholar
  8. 8.
    M.Y. Kovalyov, C.T. Ng, T.C. Edwin, Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178, 331–342 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    A.J. Vazquez, R.S. Erwin, On the tractability of satellite range scheduling. Optim. Lett. 9(2), 311–327, Springer (2015)Google Scholar
  10. 10.
    D.A. Vallado, Fundamentals of Astrodynamics and Applications. Space Technology Library (Microcosm Press, Hawthorne, CA, 2001)Google Scholar
  11. 11.
    D.A. Parish, A genetic algorithm approach to automating satellite range scheduling. Master Thesis, Air Force Institute of Technology (1994)Google Scholar
  12. 12.
    R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy, Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. Discret. Optim. II 5, 287–326 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979). ISBN-13 978-0-7167-1044-8Google Scholar
  14. 14.
    E.M. Arkin, E.B. Silverberg, Scheduling jobs with fixed start and end times. Discret. Appl. Math. 18, 1–8 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    M.R. Fellows, D. Hermelin, F. Rosamond, S. Vialette, On the parametrized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53–61 (2009)CrossRefzbMATHGoogle Scholar
  16. 16.
    A.W.J. Kolen, J.K. Lenstra, C.H. Papadimitrou, F.C.R. Spieksma, Interval scheduling: a survey. Nav. Res. Logist. 54(5), 530–543 (2007)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.National Research CouncilAlbuquerqueUSA
  2. 2.Air Force Research LaboratorySpace Vehicles Directorate, KirtlandAlbuquerqueUSA

Personalised recommendations