OpenAlex
PricingAboutJobs
Log inGet started
Work

Computational complexity of PERT problems

HTML

Year: 1988
Type: article
Source: Networks
DOI: 10.1002/net.3230180206
Author: Jane N. Hagstrom
Institution: University of Illinois Chicago
Language: English

Topic: Resource-Constrained Project Scheduling
Subfield: Management Science and Operations Research
Field: Decision Sciences
Domain: Social Sciences
Keywords: PERT, project scheduling, computational complexity, #P-completeness, cumulative distribution function, precedence constraints, discrete random variables, P versus NP

Open Access status: closed
OpenAlex ID: W1979365494
FWCI: 1.049
Cites: 7
Cited by: 194
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security