{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:29:31Z","timestamp":1777714171623,"version":"3.51.4"},"reference-count":10,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6706,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1988,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Computational complexity results for two PERT problems are presented. A project is specified by precedence relations among tasks. Task durations are independent random variables with discrete, finite ranges. The following results are obtained: (1) computing a value of the cumulative distribution function of project duration is #<jats:italic>P<\/jats:italic>\u2010complete, (2) computing the mean of the distribution is at least as hard, and (3) neither of the problems in (1) and (2) can be computed in time polynomial in the number of points in the range of the project duration unless P = NP.<\/jats:p>","DOI":"10.1002\/net.3230180206","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T23:19:33Z","timestamp":1178925573000},"page":"139-147","source":"Crossref","is-referenced-by-count":125,"title":["Computational complexity of PERT problems"],"prefix":"10.1002","volume":"18","author":[{"given":"Jane N.","family":"Hagstrom","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.4.862"},{"key":"e_1_2_1_3_2","volume-title":"Activity Networks","author":"Elmaghraby Salah E.","year":"1977"},{"key":"e_1_2_1_4_2","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_5_2","unstructured":"J. N.Hagstrom Computing the probability distribution of project completion time in a PERT network. Technical report 86\u201001 College of Business Administration University of Illinois Box 4348 Chicago 60680 (1985)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(76)90017-4"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.516"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070407"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230180206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230180206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T14:28:06Z","timestamp":1697898486000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230180206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["10.1002\/net.3230180206"],"URL":"https:\/\/doi.org\/10.1002\/net.3230180206","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}