1) In a PERT network, the manager must estimate three times for the completion of an activity, the earliest possible completion time, called the ____________________; the best estimate of completion time, called the most ____________________ and the latest possible completion time, called the ____________________.

2) An activity which must be completed before another activity can begin are called ___________________ activities, those which must be completed just before a given activity can begin are called the __________________ of that activity

3) The _________________of a network is the path which contain the most work of any path in the network; the length of this path, measured in time units, is the expected __________________ bound on the amount of time necessary to complete the project.

4) In a CPM network, the ___________________ time is the time required to finish an activity if no extraordinary measures are taken, while the _____________________ time is the shortest possible completion time and requires special efforts or measures. The cost associated with the former is always _________________ than the cost for the latter.

5) A dynamic programming problem consist of several smaller problems called __________________ with interlocking decisions.

6) The __________________ problem is concerned with finding the best way to reach all nodes in a network from some particular source node such that the total length of all branches used is a minimum.

7) The __________________problem is used to find the greatest volume of flow from some source node to some other sink node

8) A _________________ is a rule of thumb procedure for obtaining good but not necessarily optimal solutions for problems. 9) When combining three time estimates into a distribution of randomly distributed activity durations, we assume that the activities are ___________________ distributed.

9) When combining three time estimates into a distribution of randomly distributed activity durations, we assume that the activities are ___________________ distributed.

10) When all activities leading into a node in the PERT network are completed, the node is referred to as a(n) _________________. 11) A penalty assessed for completing a project after in

due date is called a _________________ cost.

11) A penalty assessed for completing a project after in due date is called a _________________ cost.

12) Activities in a PERT network which are not critical are said to have free time called _________________.

13) The fundamental departure of CPM from PERT is that CPM brings the concept of __________________ more prominently into the planning and control process.

14) The _________________ network convention includes nodes which represent events, while the ___________________ network characterizes nodes as activities

15) The completion time of the entire project in PERT is described by the __________________ distribution.

TRUE OR FALSE

1) A dummy activity is used to preserve precedence relationships in a network, in order to avoid having two activities with the same beginning and ending nodes, and is assigned a completion time of zero.

2) Reducing the completion time of any activity will always reduce the overall completion time of the projects.

3) The slack in an activity is the difference between the late finish (LF) time and the early finish (EF) time for the activity.

4) If an activity is completed after its earliest finish (EF) time, then the projects will necessarily be extended beyond its scheduled completion time.

5) All activities on a critical path have slack equal to zero. 6) CPM tends to emphasize controlling costs more than PERT does.

7) Regardless of the method of resource levelling used to satisfy resource limitations, we must always preserve precedence relationships in the network.

8) In a maximal-flow problem, it is necessary to designate the source node and the output node top solve the problem

9) In a maximal-flow problem, if all the branches leading to the output node have zero capacity remaining, then the present solution is optimal.

10) Dynamic programming problems consists of a series of sub-problems, each of which is independence of all the other sub-problems.

11) PERT assumes that the distribution of completion times for a project is a normal distribution.

12) It is possible to use linear programming to analyze crashing strategies because crash costs are assumed to be a linear function of time.

13) Dynamic programming, like linear programming is a systematic procedure that is general to a number of different problem.

14) Any activity which starts as its latest start time will have the maximum slack.

15) A most likely time estimate is weighted four times as much as an optimistic time estimate in PERT.

16) In PERT terminology, a node or a circle on the chart represents a discrete point in time

17) A critical path in PERT is always a continuous path from the starting node to the ending node of the network.

18) When an activity in a PERT network actually finishes after its latest finish time, the completion time at the project is in danger of being extended.

19) In CPM, two time and cost estimates are made for each activity. These are called the optimistic and pessimistic estimates.

20) The first activity we consider crashing in a CPM network is the one with least crash time