Statistical Pert: An Improved Project Scheduling Algorithm.

reportActive / Technical Report | Accession Number: ADA071498 | Open PDF

Abstract:

A project scheduling algorithm is developed and illustrated. For each feasible project deadline time the minimum project cost and corresponding optimal deterministic activity durations are derived. The cost of an activity is assumed to be a convex piecewise linear function of its duration. The algorithm is based upon network-flow techniques including the use of a labeling procedure which preserves complementary slackness. A computer implementation of the algorithm is documented. Author

Author(s):
Dunn, Cynthia S. ; Sielken, Robert L., Jr
Author Organization(s):
TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Descriptive Note:
Technical rept.,
Pagination:
0105

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release, Document Partially Illegible
Distribution Statement:
Availability: Document Partially Illegible.

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
THEMIS-TR-55
Contract/Grant Number(s):
N00014-76-C-0038
 Subject Terms
Joint Capability Areas:
JCA_1_Force Support; JCA_1.2_Force Preparation; JCA_1.2.3_Educating; JCA_6.1_Information Transport; JCA_6_Net Centric; JCA_5_Command and Control; JCA_4.6_Engineering; JCA_5.2_Understand; JCA_1.3_Human Capital Management; JCA_4_Logistics; JCA_5.2.2_Develop Knowledge and Situational Awareness; JCA_5.3_Planning; JCA_1.3.2_Personnel Management
Communities of Interest:
Energy and Power Technologies
Descriptor(s):
*SCHEDULING, *PERT, COMPUTER PROGRAMS, ALGORITHMS, COSTS, COMPUTER APPLICATIONS, FLOW CHARTING, NETWORK FLOWS
Field(s)/Group(s):
Operations Research
Keyword(s):
WUNR047700
Report Date:
1977 Feb 03