The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Round robin 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
Cites
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Barahona, F., Grötschel, M., Jünger, M., & Reinelt, G. (1988) · Operations Research · doi:10.1287/opre.36.3.493 · Cited by 504
Logic-based methods for optimization: combining optimization and constraint satisfaction
(2001) · Choice Reviews Online · doi:10.5860/choice.38-3939 · Cited by 304
Practice and Theory of Automated Timetabling III
Burke, E. K., & Erben, W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44629-x · Cited by 175
A simulated annealing approach to the traveling tournament problem
Anagnostopoulos, A., Michel, L. D., Hentenryck, P. V., & Vergados, Y. (2006) · Journal of Scheduling · doi:10.1007/s10951-006-7187-8 · Cited by 172
de Werra, D. (1981) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73478-9 · Cited by 149
Practice and Theory of Automated Timetabling IV
Elkhyari, A., Guéret, C., & Jussien, N. (2003) · Lecture notes in computer science · doi:10.1007/b11828 · Cited by 122
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
Lim, A. E. B., Rodrigues, B., & Zhang, X. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.02.065 · Cited by 111
Devising a Cost Effective Schedule for a Baseball League
Russell, R. A., & Leung, J. M. Y. (1994) · Operations Research · doi:10.1287/opre.42.4.614 · Cited by 85
Global constraints for round robin tournament scheduling
Henz, M., Müller, T., & Thiel, S. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00101-2 · Cited by 75
Cited by
Zhu, X., Wen, S., Camtepe, S., & Xiang, Y. (2022) · ACM Computing Surveys · doi:10.1145/3512345 · Cited by 334
Volleyball Premier League Algorithm
Moghdani, R., & Salimifard, K. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.043 · Cited by 301
Haptic Codecs for the Tactile Internet
Steinbach, E., Strese, M., Eid, M., Liu, X., Bhardwaj, A., Liu, Q., Al-Ja'Afreh, M., Mahmoodi, T., Hassen, R., El Saddik, A., et al. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2867835 · Cited by 166
Metadata
- Authors
- Rasmussen, R. V., & Trick, M. A.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2008-08
- Volume
- 188
- Issue
- 3
- Pages
- 617-636
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W1965391651
- Cited by
- 343
- References
- 15
- FWCI
- 19.55
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Round robin scheduling – a survey. https://app.cochat.ai/papers/10.1016/j.ejor.2007.05.046
- The paper
- Rasmussen, R. V., & Trick, M. A. (2008). Round robin scheduling – a survey. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2007.05.046
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.