Graph colouring approaches for a satellite range scheduling problem
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001 · cited 1×
“Many variants of tabu search can be found, for example, in (Glover and Laguna 1997).”
BackgroundSelecting and scheduling observations of agile satellites
Lemaı̂tre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.-M., & Bataille, N. (2002) · Aerospace Science and Technology · doi:10.1016/s1270-9638(02)01173-2 · Cited by 472 · cited 2×
“…on satellite range scheduling problems (e.g., Bensana et al. 1999; Harrison et al. 1999; Pemberton 2000; Wolfe and Sorensen 2000; Verfaillie and Lemaitre 2001; Frank et al. 2001; Lemaitre et al. 2002; Gabrel and Murat 2003; Vasquez and Hao 2003; Globus et al. 2003, 2004; Cordeau and Laporte 2005).”
BackgroundVasquez, M., & Hao, J.-K. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011203002719 · Cited by 239 · cited 1×
“…on satellite range scheduling problems (e.g., Bensana et al. 1999; Harrison et al. 1999; Pemberton 2000; Wolfe and Sorensen 2000; Verfaillie and Lemaitre 2001; Frank et al. 2001; Lemaitre et al. 2002; Gabrel and Murat 2003; Vasquez and Hao 2003; Globus et al. 2003, 2004; Cordeau and Laporte 2005).”
BackgroundScheduling 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 · cited 29×
“In GENITOR for the MuRRSP, the population size is 200 and the algorithm stops as soon as 8000 applications of SB have been performed.”
BackgroundMethodInfluentialMaximizing the value of an Earth observation satellite orbit
Cordeau, J.-F., & Laporte, G. (2005) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601926 · Cited by 150 · cited 1×
“…on satellite range scheduling problems (e.g., Bensana et al. 1999; Harrison et al. 1999; Pemberton 2000; Wolfe and Sorensen 2000; Verfaillie and Lemaitre 2001; Frank et al. 2001; Lemaitre et al. 2002; Gabrel and Murat 2003; Vasquez and Hao 2003; Globus et al. 2003, 2004; Cordeau and Laporte 2005).”
BackgroundAFSCN scheduling: How the problem and solution have evolved
Barbulescu, L., Howe, A., & Whitley, D. (2006) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2005.12.004 · Cited by 69
Cited by
Oppositional biogeography-based optimization
Ergezer, M., Simon, D., & Du, D. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346043 · Cited by 300
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260
“This is due to that a real-world observation planning procedure of AEOSs consists of two parts: observation scheduling (AEOSSP) and data download planning (RSSP).”
BackgroundInfluentialGenetic Algorithms for Satellite Scheduling Problems
Xhafa, F., Sun, J., Barolli, A., Biberaj, A., & Barolli, L. (2012) · Mobile Information Systems · doi:10.1155/2012/717658 · Cited by 108
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
Satellite downlink scheduling problem: A case study
Karapetyan, D., Mitrovic Minic, S., Malladi, K. T., & Punnen, A. P. (2015) · Omega · doi:10.1016/j.omega.2015.01.001 · Cited by 75
Metadata
- Authors
- Zufferey, N., Amstutz, P., & Giaccari, P.
- Venue
- Journal of Scheduling
- Published
- 2008-08
- Volume
- 11
- Issue
- 4
- Pages
- 263-277
- ISSN
- 1094-6136 (ISSN-L)
- 1099-1425
- OpenAlex
- W1985603248
- Cited by
- 177
- References
- 6
- FWCI
- 22.29
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.