A Tabu Search Algorithm for Satellite Imaging Scheduling
Abstract
This paper deals with the daily imaging scheduling problem for a low-orbit, earth observation satellite, which belongs to a class of single-machine scheduling problems. Its salient features include sequence-dependent setup effects, job-assembly characteristics, and time window constraints. Instead of looking for the global optimal solutions, we adopt a promising evolutionary approach, tabu search, to solve this scheduling problem. Numerical results demonstrate that the approach is effective and efficient in applications to the real problems.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
Vasquez, M., & Hao, J.-K. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011203002719 · Cited by 239 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation
Cho, D.-H., Kim, J.-H., Choi, H.-L., & Ahn, J. (2018) · Journal of Aerospace Information Systems · doi:10.2514/1.i010620 · Cited by 98 · see citing works
Robust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70 · see citing works
- Authors
- Lin, W.-C., & Liao, D.-Y.
- Affiliations
- National Taiwan University (TW)
- National Chi Nan University (TW)
- Venue
- 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)
- Publisher
- IEEE
- Published
- 2005-03-31
- Volume
- 2
- Pages
- 1601-1606
- ISSN
- 1062-922X (ISSN-L)
- OpenAlex
- W2112589996
- Cited by
- 24
- References
- 1
- Citations by year
- 2025: 1 · 2024: 1 · 2023: 1 · 2021: 1 · 2019: 4 · 2018: 3 · 2017: 1 · 2016: 3 · 2015: 2 · 2014: 1 · 2013: 1 · 2012: 2
- FWCI
- 0.99
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics (publishedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
- Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
- Keywords
- tabu search, single machine scheduling, sequence-dependent setup times, time windows, evolutionary algorithms
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