The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
Abstract
A zero-one (0-1) linear programming formulation of multiproject and job-shop scheduling problems is presented that is more general and computationally tractable than other known formulations. It can accommodate a wide range of real-world situations including multiple resource constraints, due dates, job splitting, resource, substitutability, and concurrency and nonconcurrency of job performance requirements. Three possible objective functions are discussed; minimizing total throughput time for all projects: minimizing the time by which all projects are completed (i.e., minimizing makespan); and minimizing total lateness or lateness penalty for all projects.
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
Conway, R. W., Maxwell, W., & Miller, L. W. (1967) · Cited by 2,167
Scheduling with Deadlines and Loss Functions
McNaughton, R. (1959) · Management Science · doi:10.1287/mnsc.6.1.1 · Cited by 848
On the Job-Shop Scheduling Problem
Manne, A. S. (1960) · Operations Research · doi:10.1287/opre.8.2.219 · Cited by 666
The Schedule-Sequencing Problem
Bowman, E. H. (1959) · Operations Research · doi:10.1287/opre.7.5.621 · Cited by 292
Heuristics in Job Shop Scheduling
Gere, W. S. (1966) · Management Science · doi:10.1287/mnsc.13.3.167 · Cited by 224
Some Properties of Schedules for Large Projects with Limited Resources
Wiest, J. D. (1964) · Operations Research · doi:10.1287/opre.12.3.395 · Cited by 166
Cited by
Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
Talbot, F. B. (1982) · Management Science · doi:10.1287/mnsc.28.10.1197 · Cited by 456
A Robust Genetic Algorithm for Resource Allocation in Project Scheduling
Alcaraz, J., & Maroto, C. (2001) · Annals of Operations Research · doi:10.1023/a:1010949931021 · Cited by 275
Integrating Replenishment Decisions with Advance Demand Information
Gallego, G., & Özer, Ö. (2001) · Management Science · doi:10.1287/mnsc.47.10.1344.10261 · Cited by 271
Tanaka, S., & Fujikuma, S. (2012) · Journal of Scheduling · doi:10.1007/s10951-011-0242-0 · Cited by 52
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
- Pritsker, A. A. B., Waiters, L. J., & Wolfe, P. M.
- Venue
- Management Science
- Published
- 1969-09
- Volume
- 16
- Issue
- 1
- Pages
- 93-108
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2036112575
- Cited by
- 772
- References
- 6
- FWCI
- 1.47
- 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: Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach. https://app.cochat.ai/papers/10.1287/mnsc.16.1.93
- The paper
- Pritsker, A. A. B., Waiters, L. J., & Wolfe, P. M. (1969). Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach. Management Science. https://doi.org/10.1287/mnsc.16.1.93
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.