Optimal Fixed Interval Satellite Range Scheduling

Antonio J. Vazquez, R. Scott Erwin

2014

Abstract

The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic or Lagrangian-relaxation techniques. Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best of our knowledge, no algorithm has been provided yet for solving multiple-location, prioritized scheduling problems optimally. We present an exact polynomial time algorithm for a fixed number of ground stations (or satellites), based on a modified algorithm from the general scheduling literature.

References

  1. Arkin, E. M. and Silverberg, E. B. (1987). Scheduling jobs with fixed start and end times. In Discrete Applied Mathematics, Vol. 18, pp. 1-8. North-Holland.
  2. Burrowbridge, S. E. (1999). Optimal allocation of satellite network resources. In Master Thesis. Virginia Polytechnic and State University.
  3. F. Marinelli, F. Rossi, S. N. S. S. (2005). A lagrangian heuristic for satellite range scheduling with resource constraints. In Computers & Operations Research, Vol. 38, Issue 11, pp. 1572-1583. Elsevier.
  4. H. Jung, M. Tambe, A. B. B. C. (2002). Enabling efficient conflict resolution in multiple spacecraft missions via dcsp. In Proceedings of the NASA workshop on planning and scheduling. NASA.
  5. L. Barbulescu, J. P. Watson, L. D. W. A. E. H. (2004). Scheduling space-ground communications for the air force satellite control network. In Journal of Scheduling, Vol. 7, Issue 1, pp. 7-34. Kluwer Academic Publishers.
  6. M. Y. Kovalyov, C. T. Ng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. In European Journal of Operations Research, Vol. 178, pp. 331-342. Elsevier.
  7. Musser, D. R. (1997). Introspective sorting and selection algorithms. In Software: Practice and Experience, Vol. 27, Issue 8, pp. 983-993. Wiley.
  8. Papadimitriou, C. H. and Yannakakis, M. (1989). Shortest paths without a map. In Lecture Notes in Computer Science, Vol. 372, pp. 610-620. Springer.
  9. Vallado, D. A. (2001). Fundamentals of astrodynamics and applications. Space Technology Library.
  10. Wolfe, W. J. and Sorensen, S. E. (2000). Three scheduling algorithms applied to the earth observing systems domain. In Management Sience, Vol. 46, No. 1, pp. 148-168. Informs.
Download


Paper Citation


in Harvard Style

J. Vazquez A. and Scott Erwin R. (2014). Optimal Fixed Interval Satellite Range Scheduling . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 401-408. DOI: 10.5220/0004760604010408


in Bibtex Style

@conference{icores14,
author={Antonio J. Vazquez and R. Scott Erwin},
title={Optimal Fixed Interval Satellite Range Scheduling},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={401-408},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004760604010408},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Optimal Fixed Interval Satellite Range Scheduling
SN - 978-989-758-017-8
AU - J. Vazquez A.
AU - Scott Erwin R.
PY - 2014
SP - 401
EP - 408
DO - 10.5220/0004760604010408