The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
NP-complete scheduling problems
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Optimal scheduling for two-processor systems
Coffman, E. G., & Graham, R. L. (1972) · Acta Informatica · doi:10.1007/bf00288685 · Cited by 614
Scheduling independent tasks to reduce mean finishing time
Bruno, J., Coffman, E. G., & Sethi, R. (1974) · Communications of the ACM · doi:10.1145/361011.361064 · Cited by 504
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Garey, M. R., & Johnson, D. S. (1975) · SIAM Journal on Computing · doi:10.1137/0204035 · Cited by 493
Bounds on multiprocessing anomalies and related packing algorithms
Graham, R. L. (1971) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1478873.1478901 · Cited by 118
Complete register allocation problems
Sethi, R. (1973) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800125.804049 · Cited by 80
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Kwok, Y.-K., & Ahmad, I. (1999) · ACM Computing Surveys · doi:10.1145/344588.344618 · Cited by 1,314
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Hall, N. G., & Sriskandarajah, C. (1996) · Operations Research · doi:10.1287/opre.44.3.510 · Cited by 842
List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table
Arabnejad, H., & Barbosa, J. G. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.57 · Cited by 653
Workflow Scheduling Algorithms for Grid Computing
Yu, J., Buyya, R., & Ramamohanarao, K. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-69277-5_7 · Cited by 388
Metadata
- Authors
- Ullman, J. D.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1975-06
- Volume
- 10
- Issue
- 3
- Pages
- 384-393
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2057392949
- Cited by
- 1,452
- References
- 8
- FWCI
- 66.17
- Type
- journal article
- Language
- en
- Open access
- bronze
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: NP-complete scheduling problems. https://app.cochat.ai/papers/10.1016/s0022-0000(75)80008-0
- The paper
- Ullman, J. D. (1975). NP-complete scheduling problems. Journal of Computer and System Sciences. https://doi.org/10.1016/s0022-0000(75)80008-0
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.