Consider the following work breakdown structure: \(\begin{array}{r} {\text { Time Estimates (wks) }} \\ \begin{array}{lccccc} & \text { Start } & \text { Finish } \\ \text { Activity } & \text { Node } \quad\quad& \text { Node } \quad\quad& \mathrm{t}_{0} \quad\quad& \mathrm{t}_{\mathrm{m}} \quad& \mathrm{t}_{\mathrm{p}} \quad\\ \hline \text { A } & 1 & 2 & 11 & 20 & 29 \\ \text { B } & 2 & 3 & 2 & 5 & 8 \\ \text { C } & 2 & 4 & 18 & 30 & 42 \\ \text { D } & 3 & 4 & 7 & 10 & 13 \\ \text { E } & 1 & 4 & 31 & 40 & 43 \end{array}\end{array}\) What is the probability that the critical path for this project will be completed within 52 weeks?

A) 0.1554 B) 0.3108 C) 0.3466 D) 0.6554 E) 0.8277 A) 0.1554 B) 0.3108 C) 0.3466 D) 0.6554 E) 0.8277

Consider the following work breakdown structure: \(\begin{array}{r} {\text { Time Estimates (wks) }} \\ \begin{array}{lccccc} & \text { Start } & \text { Finish } \\ \text { Activity } & \text { Node } \quad\quad& \text { Node } \quad\quad& \mathrm{t}_{0} \quad\quad& \mathrm{t}_{\mathrm{m}} \quad& \mathrm{t}_{\mathrm{p}} \quad\\ \hline \text { A } & 1 & 2 & 11 & 20 & 29 \\ \text { B } & 2 & 3 & 2 & 5 & 8 \\ \text { C } & 2 & 4 & 18 & 30 & 42 \\ \text { D } & 3 & 4 & 7 & 10 & 13 \\ \text { E } & 1 & 4 & 31 & 40 & 43 \end{array}\end{array}\) What is the estimated expected (mean) time for activity E?

A) 31 weeks B) 38 weeks C) 39 weeks D) 40 weeks E) 43 weeks A) 31 weeks B) 38 weeks C) 39 weeks D) 40 weeks E) 43 weeks

Exam 17: Project Management

Consider the following work breakdown structure: Duration Estimate (Days) Start Finish Activity Node Node Optimistic Most Likely Pessimistic A 1 2 9 15 21 B 1 3 13 21 23 C 2 4 6 9 18 D 2 5 23 35 47 E 3 5 19 26 27 F 4 6 23 29 41 G 5 6 14 20 26 H 6 7 2 5 8 What are the estimated slack times (in weeks) for activities A-H?

(Short Answer)

4.8/5

(82)

Question 61

Given this information about activity 3-4: ES = 10, EF = 15, LS = 16, and LF = 21, we can determine that the amount of slack associated with the activity is:

(Multiple Choice)

4.7/5

(81)

Question 62

Most likely time generally is more than optimistic time.

(True/False)

4.7/5

(76)

Question 63

A popular tool for planning and scheduling simple projects, and for initial planning on more complex projects, is the:

(Multiple Choice)

4.9/5

(67)

Question 64

A sequence of activities that leads from the starting node to the finishing node is called a:

(Multiple Choice)

4.7/5

(89)

Question 65

The network diagram describes sequential relationships among major activities on a project.

(True/False)

4.8/5

(68)

Question 66

In the project network presented below, numbers on each arrow refer to the expected time and standard deviation in weeks for that particular activity. For example, "8,2" indicates an activity with an expected time of 8 and a standard deviation of two weeks. For this project, determine each of the following: (A) the activities which are on the critical path (B) the expected project duration (C) the probability that the project will be completed in 29 weeks or less

(Essay)

4.8/5

(86)

Question 67

A hierarchical listing of what must be done in a project is called a:

(Multiple Choice)

4.8/5

(74)

Question 68

Consider the following work breakdown structure: Duration Estimate (Days) Start Finish Activity Node Node Optimistic Most Likely Pessimistic A 1 2 9 15 21 B 1 3 13 21 23 C 2 4 6 9 18 D 2 5 23 35 47 E 3 5 19 26 27 F 4 6 23 29 41 G 5 6 14 20 26 H 6 7 2 5 8 What is the probability that the critical path for this project will be completed within 75 weeks? 80 weeks? 85 weeks? 90 weeks?

(Short Answer)

4.9/5

(79)

Question 69

Consider the following work breakdown structure: Time Estimates (wks) Start Finish Activity Node Node A 1 2 11 20 29 B 2 3 2 5 8 C 2 4 18 30 42 D 3 4 7 10 13 E 1 4 31 40 43 What is the probability that the critical path for this project will be completed within 52 weeks?

(Multiple Choice)

4.8/5

(69)

Question 70

A project is represented by the following diagram: The critical path for the network shown is:

(Multiple Choice)

4.8/5

(96)

Question 71

If an activity is determined to be on the critical path, that means that it, and perhaps others, will affect project:

(Multiple Choice)

4.9/5

(80)

Question 72

Consider the following work breakdown structure: Activity Precedes Normal Time (wks) Crashing Cost week week) Start A, B - - - A C, D 6 8 - B G 4 5 6 C E 4 - - D F 5 6 6 E H 6 8 8 F H 6 7 10 G I 8 3 5 H End 5 12 15 I End 6 5 - In crashing this project, which activity should be the first to be reduced?

(Short Answer)

4.8/5

(88)

Question 73

Shortening activity durations is called:

(Multiple Choice)

4.8/5

(90)

Question 74

The costs associated with risk events tend to be lower near the beginning of a project and higher near the end of the project.

(True/False)

4.9/5

(78)

Question 75

An advantage of Gantt charts in project management is that they identify which activities can be delayed without delaying the overall project.

(True/False)

4.7/5

(89)

Question 76

Consider the following work breakdown structure: Time Estimates (wks) Start Finish Activity Node Node A 1 2 11 20 29 B 2 3 2 5 8 C 2 4 18 30 42 D 3 4 7 10 13 E 1 4 31 40 43 What is the estimated expected (mean) time for activity E?

(Multiple Choice)

4.9/5

(72)

Question 77

At which point does crashing of a project cease?

(Multiple Choice)

4.8/5

(93)

Question 78

In project network analysis, "slack" refers to the difference between:

(Multiple Choice)

4.9/5

(74)

Question 79

Path probabilities are calculated by dividing path mean by path standard deviations.

(True/False)

4.9/5

(74)

Question 80

Exam 17: Project Management

Given this information about activity 3-4: ES = 10, EF = 15, LS = 16, and LF = 21, we can determine that the amount of slack associated with the activity is:

Most likely time generally is more than optimistic time.

A popular tool for planning and scheduling simple projects, and for initial planning on more complex projects, is the:

A sequence of activities that leads from the starting node to the finishing node is called a:

The network diagram describes sequential relationships among major activities on a project.

A hierarchical listing of what must be done in a project is called a:

Consider the following work breakdown structure: Time Estimates (wks) Start Finish Activity Node Node A 1 2 11 20 29 B 2 3 2 5 8 C 2 4 18 30 42 D 3 4 7 10 13 E 1 4 31 40 43 What is the probability that the critical path for this project will be completed within 52 weeks?

A project is represented by the following diagram: The critical path for the network shown is:

If an activity is determined to be on the critical path, that means that it, and perhaps others, will affect project:

Shortening activity durations is called:

The costs associated with risk events tend to be lower near the beginning of a project and higher near the end of the project.

An advantage of Gantt charts in project management is that they identify which activities can be delayed without delaying the overall project.

Consider the following work breakdown structure: Time Estimates (wks) Start Finish Activity Node Node A 1 2 11 20 29 B 2 3 2 5 8 C 2 4 18 30 42 D 3 4 7 10 13 E 1 4 31 40 43 What is the estimated expected (mean) time for activity E?

At which point does crashing of a project cease?

In project network analysis, "slack" refers to the difference between:

Path probabilities are calculated by dividing path mean by path standard deviations.

Introduction to Operations Management

Competitiveness, Strategy, and Productivity

Forecasting

Product and Service Design

Extension: Reliability

Strategic Capacity Planning for Products and Services

Extension: Decision Theory

Process Selection and Facility Layout

Work Design and Measurement

Extension: Learning Curves

Location Planning and Analysis

Extension: The Transportation Model

Management of Quality

Quality Control

Extension: Acceptance Sampling

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

Jit and Lean Operations

Extension: Maintenance

Supply Chain Management

Scheduling

Management of Waiting Lines

Linear Programming

Filters