The DOI matches its Crossref record.
Nonclairvoyant scheduling
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Motwani et al. [24] showed that the round-robin algorithm has a competitive ratio of 2, which is optimal.”
From Improving Online Algorithms via ML Predictions (2024) · cites this paper as [24]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“A deterministic non-clairvoyant algorithm called round-robin (RR) yields a competitive ratio of 2 [24], which is known to be best possible.”
From Improving Online Algorithms via ML Predictions (2024) · cites this paper as [24]
Experimental — accuracy not yet measured
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
No references could be resolved yet.
Research works printed but not linked: 21
- Awerbuch, 1990, A dining philosophers algorithm with polynomial response time, Proc. 30th ACM Symp. on Foundations of Computers Science, 65, 10.1109/FSCS.1990.89525 · DOI
- Bartal, 1992, New algorithms for an ancient scheduling problem, Proc. 24th ACM Symp. on Theory of Computing, 51
- Chandy, 1984, The drinking philosophers problem, ACM TOPLAS, 6, 632, 10.1145/1780.1804 · DOI
- Chernoff, 1952, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. of Math. Statist., 23, 493, 10.1214/aoms/1177729330 · DOI
- Dijkstra, 1971, Hierarchical ordering of sequential processes, Acta Inform., 115, 10.1007/BF00289519 · DOI
- Feldmann, 1991, Dynamic scheduling on parallel machines, Proc. 32nd IEEE Symp. on Foundations of Computer Science, 111, 10.1109/SFCS.1991.185355 · DOI
- Graham, 1969, Bounds on multiprocessing anomalies, SIAM J. Appl. Math., 17, 263, 10.1137/0117039 · DOI
- Lawler, 1990, Sequencing and scheduling: algorithms and complexity, Vol. 4
- Lovasz, 1989, An online graph coloring algorithm with sublinear performance ratio, Discrete Math., 75, 319, 10.1016/0012-365X(89)90096-4 · DOI
- Lundelius, 1988, Synthesis of efficient drinking philosophers algorithms
- Lynch, 1981, Upper bounds for static resource allocation in a distributed system, J. Comput. System Sci., 23, 254, 10.1016/0022-0000(81)90015-5 · DOI
- McNaughton, 1959, Scheduling with deadlines and loss functions, Management Sci., 6, 1, 10.1287/mnsc.6.1.1 · DOI
- Motwani, 1993, Non-clairvoyant scheduling, Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, 422
- Rabin, 1981, On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem, Proc. 8th ACM Symp. POPL, 133
- Shmoys, 1991, Scheduling parallel machines on-line, Proc. 32nd IEEE Symp. on Foundations of Computer Science, 131, 10.1109/SFCS.1991.185361 · DOI
- Sleator, 1985, Amortized efficiency of list update and paging rules, CACM, 28, 202, 10.1145/2786.2793 · DOI · Paper page
- Smith, 1956, Various optimizers for single-stage production, Naval Res. Logist. Quart., 3, 59, 10.1002/nav.3800030106 · DOI
- Styer, 1988, Improved algorithms for distributed resource allocation, Proc. 7th ACM Symp. on Principles of Distributed Computing, 105
- Tanenbaum, 1985, Distributed operating systems, ACM Comput. Surveys, 17, 419, 10.1145/6041.6074 · DOI
- Vishwanathan, 1990, Randomized online graph coloring, Proc. 31st IEEE Symp. on Foundations of Computer Science, 464, 10.1109/FSCS.1990.89567 · DOI
- Yao, 1977, Probabilistic computations: towards a unified measure of complexity, Proc. 18th IEEE Symp. on Foundations of Computer Science, 222
Cited by
Sorted by citations
Improving Online Algorithms via ML Predictions
Kumar, R., Purohit, M., & Svitkina, Z. (2024) · arXiv · doi:10.48550/arxiv.2407.17712 · Cited by 111
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2012) · SIAM Journal on Discrete Mathematics · doi:10.1137/100794018 · Cited by 39
Metadata
- Authors
- Motwani, R., Phillips, S., & Torng, E.
- Affiliations
- Stanford University (US)
- Corresponding author
- Motwani, Rajeev
- ORCID
- Torng, Eric
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1994-08
- Volume
- 130
- Issue
- 1
- Pages
- 17-47
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W230344389
- Cited by
- 232
- References
- 0
- Citations by year
- 2026: 3 · 2025: 3 · 2024: 1 · 2023: 3 · 2022: 3 · 2021: 5 · 2020: 6 · 2019: 5 · 2018: 4 · 2017: 4 · 2016: 7 · 2015: 10 · 2014: 6 · 2013: 8 · 2012: 15
- FWCI
- 5.76
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Theoretical Computer Science (publishedVersion)
- Symposium on Discrete Algorithms
- Funders
- National Science Foundation (9010517, 9357849)
- National Defense Science and Engineering Graduate
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Physical Sciences › Computer Science › Hardware and Architecture › Real-Time Systems Scheduling
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Keywords
- preemptive scheduling, time-sharing operating systems, online scheduling, multiprocessor scheduling, single machine scheduling, job release times, job execution time, upper and lower bounds
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: Nonclairvoyant scheduling. https://app.cochat.ai/papers/10.1016/0304-3975(94)90151-1
- The paper
- Motwani, R., Phillips, S., & Torng, E. (1994). Nonclairvoyant scheduling. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(94)90151-1
