CoChat

A Lagrangian heuristic for satellite range scheduling with resource constraints

Marinelli, Fabrizio, Nocella, Salvatore, Rossi, Fabrizio, Smriglio, Stefano · 2011 · Computers & Operations Research
Cited by 177

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.cor.2011.01.016

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 19

  1. 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
  2. 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
  3. 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
  4. Burrowbridge SE. Optimal allocation of satellite network resources. Master thesis, Virginia Polytechnic Institute and State University, 1999.
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. Fischetti, 2003, Local branching, Mathematical Programming, 98, 23, 10.1007/s10107-003-0395-5 · doi:10.1007/s10107-003-0395-5
  11. Gupta, 1982, Efficient algorithms for interval graphs and circular-arc graphs, Networks, 12, 459, 10.1002/net.3230120410 · DOI
  12. 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
  13. Lee, 1997, Current trends in deterministic scheduling, Annals of Operations Research, 70, 1, 10.1023/A:1018909801944 · DOI
  14. Lübbecke, 2005, Selected topics in column generation, Operations Research, 53, 1007, 10.1287/opre.1050.0234 · DOI · Paper page
  15. 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
  16. 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
  17. Sousa, 1992, A time indexed formulation of non-preemptive single machine scheduling problems, Mathematical Programming, 54, 353, 10.1007/BF01586059 · DOI
  18. 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
  19. 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

See all 177

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.