The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the tractability of satellite range scheduling
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The conventional satellite data transmission scheduling problem is NP-hard.
“This highly constrained problem has been proven to be NP-hard [5,6].”
From A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics (2020) · cites this paper as [5]
Citations
Cites
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,900
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
Wolfe, W. J., & Sorensen, S. E. (2000) · Management Science · doi:10.1287/mnsc.46.1.148.15134 · Cited by 318
Scheduling jobs with fixed start and end times
Arkin, E. M., & Silverberg, E. B. (1987) · Discrete Applied Mathematics · doi:10.1016/0166-218x(87)90037-0 · Cited by 307
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Barbulescu, L., Watson, J.-P., Whitley, L. D., & Howe, A. E. (2004) · Journal of Scheduling · doi:10.1023/b:josh.0000013053.32600.3c · Cited by 232
Kolen, A. W. J., Lenstra, J. K., Papadimitriou, C. H., & Spieksma, F. C. R. (2007) · Naval Research Logistics (NRL) · doi:10.1002/nav.20231 · Cited by 224
A Lagrangian heuristic for satellite range scheduling with resource constraints
Marinelli, F., Nocella, S., Rossi, F., & Smriglio, S. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.01.016 · Cited by 178
Optimal Allocation of Satellite Network Resources
Burrowbridge, S. E. (1999) · VTechWorks (Virginia Tech) · Cited by 32
Ground Station Networks for Efficient Operation of Distributed Small Satellite Systems
Schmidt, M. (2011) · doi:10.25972/opus-4984 · Cited by 12
Enabling Efficient Conflict Resolution in Multiple Spacecraft Missions via DCSP
Jung, H., Tambe, M., Barrett, A., et al. (2002) · Cited by 6
Oversubscribed Scheduling Problems
Barbulescu, L. (2002) · Cited by 2
Flagged first, then by citations
Cited by
Sorted by citations
Deep Reinforcement Learning Method for Satellite Range Scheduling Problem
Ou, J., Xing, L., Yao, F., Li, M., Lv, J., He, Y., Song, Y., Wu, J., & Zhang, G. (2023) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101233 · Cited by 91
MOEA based memetic algorithms for multi-objective satellite range scheduling problem
Du, Y., Xing, L., Zhang, J., Chen, Y., & He, Y. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100576 · Cited by 69
Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
Liu, Z., Feng, Z., & Ren, Z. (2019) · Engineering Optimization · doi:10.1080/0305215x.2018.1558445 · Cited by 24
Approach for earth observation satellite real-time and playback data transmission scheduling
Chen, H., Li, L., Zhong, Z., & Li, J. (2015) · Journal of Systems Engineering and Electronics · doi:10.1109/jsee.2015.00107 · Cited by 18
A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics
Chen, H., Zhai, B., Wu, J., Du, C., & Li, J. (2020) · International Journal of Aerospace Engineering · doi:10.1155/2020/2180674 · Cited by 12
“This highly constrained problem has been proven to be NP-hard [5, 6].”
Background
Metadata
- Authors
- Vazquez, A. J., & Erwin, R. S.
- Affiliations
- Kirtland Air Force Base (US)
- ORCID
- Erwin, R. Scott
- Venue
- Optimization Letters
- Published
- 2014-04-10
- Volume
- 9
- Issue
- 2
- Pages
- 311-327
- ISSN
- 1862-4472 (ISSN-L)
- 1862-4480
- OpenAlex
- W2141163456
- Cited by
- 61
- References
- 11
- Citations by year
- 2026: 7 · 2025: 4 · 2024: 10 · 2023: 6 · 2022: 7 · 2021: 3 · 2020: 2 · 2019: 4 · 2018: 5 · 2017: 5 · 2016: 1 · 2015: 7
- FWCI
- 6.40
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Optimization Letters (publishedVersion)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Keywords
- complexity analysis, polynomial-time solvability, computational tractability, NP-hardness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
