The DOI matches its Crossref record.
A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness
Overview
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
Complexity of Machine Scheduling Problems
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,197
Minimizing Total Tardiness on One Machine is NP-Hard
Du, J., & Leung, J. Y.-T. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.3.483 · Cited by 744
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.1.52.7712 · Cited by 306
Scheduling jobs on parallel machines with sequence-dependent setup times
Lee, Y. H., & Pinedo, M. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(95)00376-2 · Cited by 273
A new dominance rule to minimize total weighted tardiness with unequal release dates
Akturk, M. S., & Ozdemir, D. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00319-2 · Cited by 54
Metadata
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: A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness. https://app.cochat.ai/papers/10.1016/s0167-5060(08)70742-8
- The paper
- Lawler, E. L. (1977). A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness. Annals of Discrete Mathematics. https://doi.org/10.1016/s0167-5060(08)70742-8
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.