DI-MGMT-80505
Program Evaluation and Review Technique (PERT)/Time Network Diagram
This DID defines the format and content requirements for a PERT/TIME network diagram used by the Government to evaluate a contractor's ability to manage a contract in a timely, effective, and economical manner.
Approval DateJanuary 15, 1988
AMSC NumberG4288
Preparing Activity—
Project Number—
OPRG/Y223
DTIC Applicable—
GIDEP Applicable—
Limitation—
Applicable Forms—
Approval Limitation—
Form VersionJUN 86
DID Formatdd_form_1664
963C CompliantNo
DISTRIBUTION STATEMENT A: Approved for public release; distribution is unlimited.
Description & Purpose
3.1 The program evaluation and review technique (PERT)/TIME network diagram shall be used by the Government to evaluate a contractor's ability to manage the contract in a timely, effective and economical manner based upon: (a) reasonableness of estimates, (b) the size of time increments into which the program/project is developed for monitoring purposes, (c) the inclusion of key events, (d) discussion of critical path problems, and, (e) the method proposed to accomplish the program/project shown by the network.
3.2 This PERT/TIME network diagram shall depict to the extent practicable each event of the program or project. The network diagram shall identify the earliest expected date of each event, indicate the critical path and other limited areas affecting the program and the method proposed to accomplish the project.
Application & Interrelationship
7.1 This data item description (DID) contains the format and content preparation instructions for the data product generated by the specific and discrete task requirement as delineated in the contract.
7.2 This DID is applicable when a PERT/TIME network diagram is required in contracts covering complex development or other one-time projects or programs of substantial dollar value.
7.3 This DID shall be applied in contracts when DI-MGMT-80506, PERT/TIME Analysis Report is used.
7.4 This DID supersedes DI-A-5613.
Preparation Instructions
10.1Format.This diagram shall be in the contractor's format.
10.2Content.This diagram shall contain the following:
10.2.1A graphical display of the time dependency networkA graphical display of the time dependency network reflecting the schedule for all the tasks of the program or project from the award date of the contract to the completion date of the contract. The key elements of the PERT/TIME network to be constructed in the diagrammatic representation are as follows:
10.2.1.1EventA specific definable accomplishment in the program/project network, recognizable at a particular instant in time. Events are numbered serially from the start to finish of the program or project, e.g., 0, 1, 2, 3, etc., and are depicted by a circled number (1).
10.2.1.2ActivityA time consuming element, e.g., work in progress between interdependent events. In addition, an activity may simply represent a connection of interdependency between two events of the network. "Activity" is one work step in the total program/project and is represented by an arrow. The tail of the arrow represents the beginning of the activity and the head represents its completion. Length, shape or position of the arrow is insignificant. The important thing is the way the activities represented by arrows are linked together in a logical time sequence within the network.
10.2.1.3Most likely time (m)The one best estimate provided by the best informed person of the elapsed time of an activity.
10.2.1.4Optimistic time (a)The estimate provided by the best informed person of the elapsed time of an activity that assumes no unforeseen problems. There is little likelihood of completing the activity in less time.
10.2.1.5Pessimistic time (b)The estimate provided by the best informed person of the elapsed time of an activity that assumes more than the usual number of unforeseen problems, except "Acts of God", strikes or other catastrophes.
10.2.1.6Expected elapsed time (te)The statistical mean of the estimate of optimistic, pessimistic and most likely times of an activity, computed by the linear function. te = (a+4m+b)/6
10.2.1.7Scheduled elapsed time (ts)The period of time scheduled for performing an activity.
10.2.1.8Work packageThe work required to complete a specific job or process, e.g., a report, a design, a documentation requirement or portion thereof, a piece of hardware or service. A work package may consist of one or more cost significant activities. A work package is the lowest level of identification of work performed and is represented by a charge number related to a single summary number. The work package couples to the cost accounting system through the charge number and to the PERT/TIME network through the beginning and ending event numbers of activities in the package.
10.2.1.9Actual occurrence date (T)The actual date an event is completed.
10.2.1.10Earliest expected date (TE)The earliest expected date for an event to occur is the summation of expected elapsed times (te) for activities along the longest path leading from the initial event up to the given event.
10.2.1.11Directed date (TD)A time commitment for a specific accomplishment, e.g., the date directed for accomplishment by contract schedule.
10.2.1.12Latest allowable date (TL)That time by which an event must occur before it becomes limiting to the scheduled accomplishment of the program. The latest allowable date (TL) is determined by summing the expected times (te) for activities along the longest path leading back from the end event to the given event and subtracting this time from the directed date (TD), or from the earliest expected date (TE) if no directed date (TD), is established, for the end event. (TL = TD - te or TL = TE - te).
10.2.1.13Event slack (TL - TE)Slack (S) is the amount by which earliest expected date (TE) for a given event may slip before it becomes equal to latest allowable date (TL) for that event. The amount of slack existing at any point in the network is calculated by subtracting the earliest expected date (TE) for a given event from the latest allowable date (TL) for that event. The slack figure can be zero, positive or negative, indicating on schedule, schedule freedom or schedule delinquency. (S = TL - TE).
10.2.1.14Critical pathThe particular sequence of activities in a network that comprise the most rigorous time constraint in the accomplishment of the end event, i.e., the path with the smallest amount of positive slack or the largest amount of negative slack. The Critical path is denoted by a heavy line.
10.2.1.15Scheduled completion date for an activity (TS)A date assigned for completion of an activity for purposes of planning and control within an organization.
10.2.1.16Earliest completion date (SE)The earliest date on which an activity can be completed. For a given activity it is equal to the sum of the scheduled elapsed time (ts) for the activities on the longest path from the beginning of the project up to and the given activity. (SE = ts).
10.2.1.17Latest completion date (SL)The latest date on which an activity can be scheduled for completion without delaying the completion of the project. For a given activity it is calculated by subtracting the sum of the scheduled elapsed time (ts) on the longest path from the given activity to the end event of the project from the directed date (TD), or from the earliest expected date (TE) if no directed date (TD) is established, for the event. (SL = TD - ts or SL = TE - ts).
10.2.2Figure 1 depicts an example of a typical PERT/TIME Network diagramFigure 1 depicts an example of a typical PERT/TIME Network diagram showing events, critical path, etc. Figure 2 depicts an example of a PERT/TIME Network diagram with the Work Package concept which applies when the network is related to the Work Breakdown Structure (WBS).
10.2.3The master PERT/TIME Network diagram shall displayThe master PERT/TIME Network diagram shall display to the extent practicable the entire proposed project or program from award date to completion. The earliest expected date (TE) of each event shall be shown in number of weeks from the initial (award or start) event. The critical path shall be identified. The master network diagram may be supported by detailed subsidiary network diagrams. When detailed subsidiary network diagrams are used, as a minimum, initial and/or end (terminal) events of the subsidiary networks shall be represented on the master network diagram. It is preferred that expected elapsed times (te) of activities be computed based upon three time estimates as indicated in 10.2.1.6. If only a single time estimate is used, the most likely time (m) shall be used for the expected elapsed time (te).
10.2.4The PERT/TIME Network diagram shall include the applicable key elementsThe PERT/TIME Network diagram shall include the applicable key elements in paragraph 10.2.1 as appropriate, and the requirements in paragraph 10.2.3. Events shall include deliveries of major items as specified in the contract for these events, as well as the end (terminal or completion) event, both the earliest expected date (TE) and the directed date (TD) from the contract schedule shall be indicated. Events and/or activities, as appropriate, shall be labeled with a brief descriptive title and shall also be numbered.
Figures

Figure 1. Typical PERT/TIME network diagram example.

Figure 2. PERT/TIME network with work packages example.
Schema v3.0Community-maintained · Verify against ASSIST