New tabu search heuristic in scheduling earth observation satellites
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Scheduling system of low earth orbit (LEO) satellite operations is one of the important tasks performed in satellites. Satellite specific constraints, satellite priorities, priorities of certain payload and special operations, as well as visibility conflicts are taken into consideration while generating the operations schedules in an optimum way. This paper proposes a tabu search heuristic for earth observation satellite scheduling problem, where as earth observing operations have to be scheduled on several resources while respecting time constraint and taking the priorities of the operations into account with the objective of scheduling as many operations as possible within its time window. The computational results indicate that this approach is typically effective to generate a near optimal and feasible schedule for imaging operations of the satellite.
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
Daily imaging scheduling of an earth observation satellite
Lin, W.-C., Liao, D.-Y., Liu, C.-Y., & Lee, Y.-Y. (2005) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.843380 · Cited by 173
Cited by
Genetic 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
Evaluation of struggle strategy in Genetic Algorithms for ground stations scheduling problem
Xhafa, F., Herrero, X., Barolli, A., Barolli, L., & Takizawa, M. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.01.023 · Cited by 51
“Some approaches proposed in the literature include Genitor [4], Branch-and-Bound Algorithm [4], Graph Colouring [13], Tabu Search [10], Hill Climbing [4], Fuzzy techniques [1].”
MethodTask Scheduling for Optimal Power Management and Quality-of-Service Assurance in CubeSats
Rigo, C. A., Seman, L. O., Camponogara, E., Morsch Filho, E., & Bezerra, E. A. (2021) · Acta Astronautica · doi:10.1016/j.actaastro.2020.11.016 · Cited by 44
DRL-Based Dynamic Destroy Approaches for Agile-Satellite Mission Planning
Huang, W., Li, Z., He, X., Xiang, J., Du, X., & Liang, X. (2023) · Remote Sensing · doi:10.3390/rs15184503 · Cited by 11
A Hill Climbing Algorithm for Ground Station Scheduling
Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M. (2013) · Lecture Notes in Electrical Engineering · doi:10.1007/978-94-007-6996-0_14 · Cited by 1
Metadata
- Authors
- Sarkheyli, A., Ghorbani Vaghei, B., & Bagheri, A.
- Venue
- 2010 2nd International Conference on Software Technology and Engineering
- Publisher
- IEEE
- Published
- 2010-10
- OpenAlex
- W1971108677
- Cited by
- 35
- References
- 1
- FWCI
- 7.03
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New tabu search heuristic in scheduling earth observation satellites. https://app.cochat.ai/papers/10.1109/icste.2010.5608821
- The paper
- Sarkheyli, A., Ghorbani Vaghei, B., & Bagheri, A. (2010). New tabu search heuristic in scheduling earth observation satellites. 2010 2nd International Conference on Software Technology and Engineering. https://doi.org/10.1109/icste.2010.5608821
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.