The DOI matches its Crossref record.
A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling
Abstract
The problem addressed is that of scheduling the activities of a project network to minimize project duration under conditions of multiple limited resource requirements and availabilities. Various heuristic sequencing rules have been applied to this problem, and the effectiveness of these rules relative to one another has been previously compared in the literature. However, there have been no previous comparisons of the effectiveness of these rules relative to an optimum solution. This paper makes such a comparison of eight different heuristic scheduling rules, including those found most effective in previous research on this problem. Results are presented for a total of eighty-three different multi-resource problems.
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
Ant colony optimization for resource-constrained project scheduling
Merkle, D., Middendorf, M., & Schmeck, H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802450 · Cited by 759
Pilkington, A., & Meredith, J. (2009) · Journal of Operations Management · doi:10.1016/j.jom.2008.08.001 · Cited by 537
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
Metadata
- Authors
- Davis, E. W., & Patterson, J. H.
- Venue
- Management Science
- Published
- 1975-04
- Volume
- 21
- Issue
- 8
- Pages
- 944-955
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2149521180
- Cited by
- 454
- References
- 0
- FWCI
- 7.42
- 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: A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling. https://app.cochat.ai/papers/10.1287/mnsc.21.8.944
- The paper
- Davis, E. W., & Patterson, J. H. (1975). A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling. Management Science. https://doi.org/10.1287/mnsc.21.8.944
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.
