Hybrid Algorithms for Satellite Imaging Scheduling
Abstract
This paper presents the research and development of the hybridization of a mathematical programming approach with a promising evolution on the daily imaging scheduling problem for the newest generation of low-orbit, earth observation satellite, FORMOSAT-2. This NP-hard satellite scheduling problem belongs to a class of single-machine scheduling problems with salient features of job-assembly characteristic, sequence-dependent setup effect, and constraint of operating time window. We construct innovative hybrid techniques that incorporate the best of Lagrangian relaxation and Tabu search solution approaches to solve this scheduling problem. Numerical results demonstrate that the proposed hybrid algorithms are 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., & Chang, S.-C.
- Affiliations
- WuFeng University (TW)
- National Taiwan University (TW)
- Venue
- 2005 IEEE International Conference on Systems, Man and Cybernetics
- Publisher
- IEEE
- Published
- 2006-01-18
- Volume
- 3
- Pages
- 2518-2523
- ISSN
- 1062-922X (ISSN-L)
- OpenAlex
- W1607631963
- Cited by
- 27
- References
- 1
- Citations by year
- 2025: 1 · 2022: 1 · 2021: 2 · 2019: 6 · 2018: 2 · 2016: 2 · 2015: 3 · 2014: 4 · 2013: 1 · 2012: 2
- FWCI
- 0.92
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics (publishedVersion)
- Funders
- National Space Organization
- 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
- FORMOSAT-2, hybrid algorithm, Lagrangian relaxation, tabu search, single machine scheduling, sequence-dependent setup times, time windows, NP-hard scheduling
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