The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Critical-path planning and scheduling
Open accessAbstract
Among the major problems facing technical management today are those involving the coordination of many diverse activities toward a common goal. In a large engineering project, for example, almost all the engineering and craft skills are involved as well as the functions represented by research, development, design, procurement, construction, vendors, fabricators and the customer. Management must devise plans which will tell with as much accuracy as possible how the efforts of the people representing these functions should be directed toward the project's completion. In order to devise such plans and implement them, management must be able to collect pertinent information to accomplish the following tasks:
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
Cites
Application of a Technique for Research and Development Program Evaluation
Malcolm, D. G., Roseboom, J. H., Clark, C. E., & Fazar, W. (1959) · Operations Research · doi:10.1287/opre.7.5.646 · Cited by 930
Critical-Path Planning and Scheduling: Mathematical Basis
Kelley, J. E. (1961) · Operations Research · doi:10.1287/opre.9.3.296 · Cited by 910
Self-citationA Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
Ford, L. R., & Fulkerson, D. R. (1957) · Canadian Journal of Mathematics · doi:10.4153/cjm-1957-024-0 · Cited by 286
Cited by
Resource-constrained project scheduling: Notation, classification, models, and methods
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00204-5 · Cited by 1,500
Learning scheduling algorithms for data processing clusters
Mao, H., Schwarzkopf, M., Venkatakrishnan, S. B., Meng, Z., & Alizadeh, M. (2019) · Proceedings of the ACM Special Interest Group on Data Communication · doi:10.1145/3341302.3342080 · Cited by 723
Efficient coflow scheduling with Varys
Chowdhury, M., Zhong, Y., & Stoica, I. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626315 · Cited by 438
A Simulation-Based Process Model for Managing Complex Design Projects
Cho, S.-H., & Eppinger, S. D. (2005) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2005.850722 · Cited by 293
Timing and Resource-Aware Mapping of Quantum Circuits to Superconducting Processors
Lao, L., van Someren, H., Ashraf, I., & Almudever, C. G. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2021.3057583 · Cited by 72
Metadata
- Authors
- Kelley, J. E., & Walker, M. R.
- Venue
- Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern)
- Publisher
- ACM Press
- Published
- 1959
- Pages
- 160-173
- OpenAlex
- W2035871154
- Cited by
- 569
- References
- 3
- FWCI
- 1.18
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Critical-path planning and scheduling. https://app.cochat.ai/papers/10.1145/1460299.1460318
- The paper
- Kelley, J. E., & Walker, M. R. (1959). Critical-path planning and scheduling. Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern). https://doi.org/10.1145/1460299.1460318
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.