The DOI matches its Crossref record.
Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
Abstract
The basic problem considered is that of scheduling n unit-time tasks, with arbitrary release times and deadlines, so as to minimize the maximum task completion time. Previous work has shown that this problem can be solved rather easily when all release times are integers. We are concerned with the general case in which noninteger release times are allowed, a generalization that considerably increases the difficulty of the problem even for only a single processor. Our results are for the one-processor case, where we provide an $O(n\log n)$ algorithm based on the concept of “forbidden regions”.
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
Chapter 9 Sequencing and scheduling: Algorithms and complexity
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80189-6 · Cited by 761
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Fisher, M. L., & Kedia, P. (1990) · Management Science · doi:10.1287/mnsc.36.6.674 · Cited by 253
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
Metadata
- Authors
- Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E.
- Venue
- SIAM Journal on Computing
- Published
- 1981-05
- Volume
- 10
- Issue
- 2
- Pages
- 256-269
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2055849951
- Cited by
- 206
- References
- 0
- FWCI
- 9.17
- Type
- journal article
- Language
- en
- Open access
- closed
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: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines. https://app.cochat.ai/papers/10.1137/0210018
- The paper
- Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E. (1981). Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines. SIAM Journal on Computing. https://doi.org/10.1137/0210018
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.