A Lagrangian heuristic for satellite range scheduling with resource constraints
The DOI matches its Crossref record; 2 of the 2 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
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 · cited 6×
“Air Force Satellite Control Network [2] and also by the engineers of Telespazio S.”
BackgroundMethodInfluentialDaily 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
Research works printed but not linked: 19
- Avella, 2005, Near-optimal solutions of large-scale single-machine scheduling problems, INFORMS Journal of Computing, 17, 183, 10.1287/ijoc.1040.0069 · doi:10.1287/ijoc.1040.0069
- Beraldi, 2006, Fix and relax heuristic for a stochastic lot-sizing problem, Computational Optimization and Applications, 33, 303, 10.1007/s10589-005-3055-2 · doi:10.1007/s10589-005-3055-2
- Brucker, 1996, Polynomial algorithms for resource constrained and multiprocessor task scheduling problems with a fixed number of task type, European Journal of Operational Research, 90, 214, 10.1016/0377-2217(95)00350-9 · doi:10.1016/0377-2217(95)00350-9
- Burrowbridge SE. Optimal allocation of satellite network resources. Master thesis, Virginia Polytechnic Institute and State University, 1999.
- Chen, 1999, General multiprocessor task scheduling, Naval Research Logistics, 46, 57, 10.1002/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H · doi:10.1002/(sici)1520-6750(199902)46:1<57::aid-nav4>3.0.co;2-h
- Danna, 2005, Exploring relaxation induced neighbourhoods to improve mip solutions, Mathematical Programming, Series A, 102, 71, 10.1007/s10107-004-0518-7 · DOI · Paper page
- Dillenberger, 1994, On practical resource allocation for production planning and scheduling with period overlapping setups, European Journal of Operational Research, 5, 275, 10.1016/0377-2217(94)90074-4 · doi:10.1016/0377-2217(94)90074-4
- Drozdowski, 1996, Scheduling multiprocessor tasks—an overview, European Journal of Operational Research, 94, 215, 10.1016/0377-2217(96)00123-3 · doi:10.1016/0377-2217(96)00123-3
- Escudero, 2005, On a fix-and-relax framework for a class of project scheduling problems, Annals of Operations Research, 140, 163, 10.1007/s10479-005-3970-8 · doi:10.1007/s10479-005-3970-8
- Fischetti, 2003, Local branching, Mathematical Programming, 98, 23, 10.1007/s10107-003-0395-5 · doi:10.1007/s10107-003-0395-5
- Gupta, 1982, Efficient algorithms for interval graphs and circular-arc graphs, Networks, 12, 459, 10.1002/net.3230120410 · DOI
- Kedad-Sidhoum, 2008, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, European Journal of Operational Research, 189, 1305, 10.1016/j.ejor.2006.05.052 · doi:10.1016/j.ejor.2006.05.052
- Lee, 1997, Current trends in deterministic scheduling, Annals of Operations Research, 70, 1, 10.1023/A:1018909801944 · DOI
- Lübbecke, 2005, Selected topics in column generation, Operations Research, 53, 1007, 10.1287/opre.1050.0234 · DOI · Paper page
- Mannino, 2007, The independent set problem and the thinness of a graph, Operations Research Letters, 35, 1, 10.1016/j.orl.2006.01.009 · doi:10.1016/j.orl.2006.01.009
- Möhring, 2003, Solving project scheduling problems by minimum cut computations, Management Science, 49, 330, 10.1287/mnsc.49.3.330.12737 · doi:10.1287/mnsc.49.3.330.12737
- Sousa, 1992, A time indexed formulation of non-preemptive single machine scheduling problems, Mathematical Programming, 54, 353, 10.1007/BF01586059 · DOI
- Van den Akker, 2000, Time-indexed formulations for machine-scheduling problems: column generation, INFORMS Journal of Computing, 12, 111, 10.1287/ijoc.12.2.111.11896 · DOI
- Wolfe, 2000, Three scheduling algorithms applied to the Earth observing systems domain, Management Science, 46, 148, 10.1287/mnsc.46.1.148.15134 · DOI · Paper page
Cited by
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).”
BackgroundInfluentialLiu, X., Laporte, G., Chen, Y., & He, R. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.04.006 · Cited by 250
Optimization-Based Scheduling for the Single-Satellite, Multi-Ground Station Communication Problem
Spangelo, S., Cutler, J., Gilson, K., & Cohn, A. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.11.004 · Cited by 120
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
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
Metadata
- Authors
- Marinelli, F., Nocella, S., Rossi, F., & Smriglio, S.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2011-11
- Volume
- 38
- Issue
- 11
- Pages
- 1572-1583
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2015592825
- Cited by
- 177
- References
- 2
- FWCI
- 13.17
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
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.