The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
Abstract
This paper introduces methods for formulating and solving a general class of nonpreemptive resource-constrained project scheduling problems in which the duration of each job is a function of the resources committed to it. The approach is broad enough to permit the evaluation of numerous time or resource-based objective functions, while simultaneously taking into account a variety of constraint types. Typical of the objective functions permitted are minimize project duration, minimize project cost given performance payments and penalties, and minimize the consumption of a critical resource. Resources which may be considered include those which are limited on a period-to-period basis such as skilled labor, as well as those such as money, which are consumed and constrained over the life of the project. At the planning stage the user of this approach is permitted to identify several alternative ways, or modes, of accomplishing each job in the project. Each mode may have a different duration, reflecting the magnitude and mix of the resources allocated to it. At the scheduling phase, the procedure derives a solution which specifies how each job should be performed, that is, which mode should be selected, and when each mode should be scheduled. In order to make the presentation concrete, this paper focuses on two problems: given multiple resource restrictions, minimize project completion time, and minimize project cost. The latter problem is also known as the resource-constrained time-cost tradeoff problem. Computational results indicate that the procedures provide cost-effective optimal solutions for small problems and good heuristic solutions for larger problems. The programmed solution algorithms are relatively simple and require only modest computing facilities, which permits them to be potentially useful scheduling tools for organizations having small computer systems.
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
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
Pritsker, A. A. B., Waiters, L. J., & Wolfe, P. M. (1969) · Management Science · doi:10.1287/mnsc.16.1.93 · Cited by 772
Activity networks: Project planning and control by network models
Elmaghraby, S. E. (1977) · Medical Entomology and Zoology · Cited by 582
Talbot, F. B., & Patterson, J. H. (1978) · Management Science · doi:10.1287/mnsc.24.11.1163 · Cited by 209
Self-citation
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
Pluralism in Project Management: Navigating the Crossroads of Specialization and Fragmentation
Söderlund, J. (2011) · International Journal of Management Reviews · doi:10.1111/j.1468-2370.2010.00290.x · Cited by 352
Peteghem, V. V., & Vanhoucke, M. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.03.034 · Cited by 310
Scheduling of deconstruction projects under resource constraints
Schultmann, F., & Rentz, O. (2002) · Construction Management and Economics · doi:10.1080/01446190210135913 · Cited by 24
Metadata
- Authors
- Talbot, F. B.
- Venue
- Management Science
- Published
- 1982-10
- Volume
- 28
- Issue
- 10
- Pages
- 1197-1210
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2003759470
- Cited by
- 456
- References
- 3
- FWCI
- 5.49
- 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: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case. https://app.cochat.ai/papers/10.1287/mnsc.28.10.1197
- The paper
- Talbot, F. B. (1982). Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case. Management Science. https://doi.org/10.1287/mnsc.28.10.1197
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.