The Satellite Range Scheduling Problem

Antonio José Vázquez Álvarez and Richard Scott Erwin
Additional contact information
Antonio José Vázquez Álvarez: National Research Council
Richard Scott Erwin: Space Vehicles Directorate, Kirtland

Chapter Chapter 3 in An Introduction to Optimal Satellite Range Scheduling, 2015, pp 21-47 from Springer

Abstract: 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) (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-25409-8_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319254098

DOI: 10.1007/978-3-319-25409-8_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().