The DOI matches its Crossref record.
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Bandit processes and dynamic allocation indices
Gittins, J. C. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01068.x · Cited by 1,487
Approximation Algorithms for Bin-Packing — An Updated Survey
Coffman, E. G., Garey, M. R., & Johnson, D. S. (1984) · CISM International Centre for Mechanical Sciences · doi:10.1007/978-3-7091-4338-4_3 · Cited by 433
A taxonomy for task allocation problems with temporal and ordering constraints
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.10.008 · Cited by 252
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
Efficient algorithms for collision avoidance at intersections
Colombo, A., & Del Vecchio, D. (2012) · Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control · doi:10.1145/2185632.2185656 · Cited by 134
AFSCN scheduling: How the problem and solution have evolved
Barbulescu, L., Howe, A., & Whitley, D. (2006) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2005.12.004 · Cited by 69
On the tractability of satellite range scheduling
Vazquez, A. J., & Erwin, R. S. (2015) · Optimization Letters · doi:10.1007/s11590-014-0744-8 · Cited by 61
Tanaka, S., & Fujikuma, S. (2012) · Journal of Scheduling · doi:10.1007/s10951-011-0242-0 · Cited by 52
Dalyac, C., Henriet, L., Jeandel, E., Lechner, W., Perdrix, S., Porcheron, M., & Veshchezerova, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00100-3 · Cited by 46
(2005) · Cited by 38
Minimizing Total Weighted Tardiness on a Single Machine with Release Dates and Equal-Length Jobs
van den Akker, J. M., Diepen, G., & Hoogeveen, J. A. (2010) · Journal of Scheduling · doi:10.1007/s10951-010-0181-1 · Cited by 30
Metadata
- Authors
- Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R.
- Venue
- Annals of Discrete Mathematics
- Publisher
- Elsevier
- Published
- 1979
- Pages
- 287-326
- ISSN
- 0167-5060 (ISSN-L)
- OpenAlex
- W1488422606
- Cited by
- 5,854
- References
- 0
- FWCI
- 74.96
- Type
- book chapter
- Language
- en
- Open access
- green
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.
