Reference health

Proportionate progress: A notion of fairness in resource allocation

https://doi.org/10.1007/bf01940883
CiteStamped reference-health badge
10/10 checkable references clean · checked 2026-08-12

Every reference with a DOI or an arXiv id in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

4 with no DOI or arXiv id: not checked. A reference deposited without a DOI is checked only when it names an arXiv id, under that id’s DataCite DOI. The rest are never matched by title or guessed at; they stay outside the checked set, and this line says so.

The 10 checked references that resolve
resolves10.1007/BF01995675
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
resolves10.1016/S0022-0000(73)80033-9
Time bounds for selection
resolves10.1145/321921.321936
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
resolves10.1002/nav.3800210113
Some simple scheduling algorithms
resolves10.1145/322169.322179
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
resolves10.1287/moor.8.4.538
Integer Programming with a Fixed Number of Variables
resolves10.1007/BF01553887
A new algorithm for scheduling periodic, real-time tasks
resolves10.1145/321738.321743
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
resolves10.2307/1911124
Production Sets with Indivisibilities, Part I: Generalities
resolves10.2307/1913318
Production Sets with Indivisibilities, Part II: The Case of Two Activities
The 4 references with no DOI or arXiv id, listed, not checked
no DOI — not checkedX. Deng. Mathematical Programming: Complexity and Applications. Ph.D. thesis, Department of Operations Research, Stanford University, Stanford, CA, September 1989.
no DOI — not checkedL. R. Ford, Jr., and D. R. Fulkerson.Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
no DOI — not checkedM. R. Garey and D. S. Johnson.Computers and Intractability.A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
no DOI — not checkedC. L. Liu. Scheduling Algorithms for Multiprocessors in a Hard-Real-Time Environment. JPL Space Programs Summary 37–60, vol. II, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, pages 28–37, November, 1969.
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. If Crossref’s record marks the work itself retracted, withdrawn, or removed, the badge says so instead of showing clean. It says nothing about the quality, findings, or importance of the work itself, and nothing about references with neither a DOI nor an arXiv id.

checked 2026-08-12 — re-checked at most once a day, when someone opens this page, so the date shown is the last check; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge shows the date of its last check, which runs at most once a day, when someone opens this page.

<a href="https://citestamp.com/citestamped/10.1007/bf01940883"><img src="https://citestamp.com/citestamped/10.1007/bf01940883/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bf01940883/badge.svg)](https://citestamp.com/citestamped/10.1007/bf01940883)