Consider the following project. \[\begin{array} { | c | c | c | } \hline \text { Activity } & \begin{array} { c } \text { Imunediate } \\ \text { Predecessor } \end{array} & \begin{array} { c } \text { Activity Time } \\ \text { (drys) } \end{array} \\ \hline \text { A } & - - & 3 \\ \hline \mathrm { B } & - - & 4 \\ \hline \mathrm { C } & \mathrm { A } & 4 \\ \hline \mathrm { D } & \mathrm { A } & 6 \\ \hline \mathrm { E } & \mathrm { B } & 5 \\ \hline \mathrm { F } & \mathrm { C } , \mathrm { D } & 4 \\ \hline \mathrm { G } & \mathrm { E } _ { \mathrm { F } } \mathrm { F } & 7 \\ \hline \end{array}\] -What is the latest possible time that Activity E can be started without delaying the completion of the project?

A) 8 B) 3 C) 7 D) 9 A) 8 B) 3 C) 7 D) 9

Given the following information for a project, draw the AOA (Activity-On-Arrow) project network. \[\begin{array} { | c | c | c | } \hline \text { Activity } & \begin{array} { c } \text { Immediate } \\ \text { Processor } \end{array} & \begin{array} { c } \text { Activity Time } \\ \text { (days) } \end{array} \\ \hline \text { A } & - & 6 \\ \hline \text { B } & - & 8 \\ \hline \text { C } & \text { A, B } & 5 \\ \hline \text { D } & \text { B } & 4 \\ \hline \text { E } & \text { C } & 7 \\ \hline \text { F } & \text { C, D } & 3 \\ \hline \text { G } & \text { D } & 6 \\ \hline \text { H } & \text { E, F, G } & 5 \\ \hline \end{array}\]

The answer of Given the following information for a project,...

Consider the following project. \[\begin{array} { | c | c | c | } \hline \text { Activity } & \begin{array} { c } \text { Imunediate } \\ \text { Predecessor } \end{array} & \begin{array} { c } \text { Activity Time } \\ \text { (drys) } \end{array} \\ \hline \text { A } & - - & 3 \\ \hline \mathrm { B } & - - & 4 \\ \hline \mathrm { C } & \mathrm { A } & 4 \\ \hline \mathrm { D } & \mathrm { A } & 6 \\ \hline \mathrm { E } & \mathrm { B } & 5 \\ \hline \mathrm { F } & \mathrm { C } , \mathrm { D } & 4 \\ \hline \mathrm { G } & \mathrm { E } _ { \mathrm { F } } \mathrm { F } & 7 \\ \hline \end{array}\] -What is the latest finish time for activity F?

A) 9 B) 7 C) 13 D) 16 A) 9 B) 7 C) 13 D) 16

Exam 8: Project Management

Consider the following network. -Assume that the variance for each activity in the network is equal to 1. Compute the probability that path A-B-E-F will be completed in 15 days.

(Short Answer)

4.9/5

(77)

Question 41

In PERT, the actual project completion time will never exceed the expected duration of the critical path.

(True/False)

4.7/5

(78)

Question 42

The diagram below shows the activities on the nodes, and the table shows the normal time and crash time (in days) and cost for each activity. $The diagram below shows the activities on the nodes, and the table shows the normal time and crash time (in days) and cost for each activity. \begin{array} { | c | c | c | c | } \hline \text { Activity } & \text { Normal Time } & \text { Crash Time } & \begin{array} { c } \text { Cost per day } \\ \text { to crash } \end{array} \\ \hline \text { A } & 6 & 6 & - - - \\ \hline \text { B } & 10 & 8 & \$ 100 \\ \hline \text { C } & 5 & 4 & \$ 300 \\ \hline \text { D } & 4 & 1 & \$ 700 \\ \hline \text { E } & 9 & 7 & \$ 500 \\ \hline \text { F } & 2 & 1 & \$ 650 \\ \hline \end{array} -Determine which activities should be crashed to shorten the project by 3 days. What is the cost?$ Activity Normal Time Crash Time Cost per day to crash A 6 6 --- B 10 8 \ 100 C 5 4 \ 300 D 4 1 \ 700 E 9 7 \ 500 F 2 1 \ 650 -Determine which activities should be crashed to shorten the project by 3 days. What is the cost?

(Essay)

4.9/5

(64)

Question 43

A(n) ________ chart is a graph or a bar chart for each activity that shows the project schedule and the passage of time.

(Short Answer)

4.8/5

(100)

Question 44

When applying linear programming models to project crashing, the objective is to minimize ________.

(Short Answer)

4.9/5

(78)

Question 45

In a CPM/PERT network the critical path is the

(Multiple Choice)

4.8/5

(75)

Question 46

Refer to the table below to answer the question(s) that follow: ~Activity~~~~~~~~~Times~ (weeks)\\ \begin{array}{c} \text { Activity } & \text { Predecessor } & \text { Optimistic } & \text { Most Likely } & \text { Pessimi } \\ \hline \text { A } & --- & 9 & 15 & 21 \\ \text { B } & --- & 13 & 21 & 23 \\ \text { C } & \text { A } & 6 & 9 & 18 \\ \text { D } & \text { A } & 23 & 35 & 47 \\ \text { E } & \text { B } & 19 & 26 & 27 \\ \text { F } & \text { C } & 23 & 29 & 41 \\ \text { G } & \text { D,E } & 14 & 20 & 26 \\ \text { H } & \text { F,G } & 2 & 5 & 8 \end{array} -What are the estimated expected completion (mean) times (in weeks) for activities A-H?

(Short Answer)

4.9/5

(86)

Question 47

Consider the following project. Activity Imunediate Predecessor Activity Time (drys) A -- 3 -- 4 4 6 5 , 4 7 -What is the latest possible time that Activity E can be started without delaying the completion of the project?

(Multiple Choice)

4.8/5

(76)

Question 48

Elements of project planning include

(Multiple Choice)

4.7/5

(89)

Question 49

Refer to the table below to answer the question(s) that follow: ~Activity~~~~~~~~~Times~ (weeks)\\ \begin{array}{c} \text { Activity } & \text { Predecessor } & \text { Optimistic } & \text { Most Likely } & \text { Pessimi } \\ \hline \text { A } & --- & 9 & 15 & 21 \\ \text { B } & --- & 13 & 21 & 23 \\ \text { C } & \text { A } & 6 & 9 & 18 \\ \text { D } & \text { A } & 23 & 35 & 47 \\ \text { E } & \text { B } & 19 & 26 & 27 \\ \text { F } & \text { C } & 23 & 29 & 41 \\ \text { G } & \text { D,E } & 14 & 20 & 26 \\ \text { H } & \text { F,G } & 2 & 5 & 8 \end{array} -What are the estimated slack times (in weeks) for activities A-H?

(Short Answer)

4.7/5

(78)

Question 50

In an AOA network, a ________ activity is used to show a precedence relationship, but it does not represent passage of time.

(Short Answer)

5.0/5

(83)

Question 51

An AOA network will never require dummy activities.

(True/False)

4.9/5

(87)

Question 52

The PERT pessimistic time estimate is an estimate of the minimum time an activity will require.

(True/False)

4.8/5

(77)

Question 53

Consider the following network. -The early start for activity 2 is ________.

(Short Answer)

4.9/5

(76)

Question 54

The early start of an activity that has more than one predecessor is the minimum of the earliest finishes of all predecessors.

(True/False)

4.8/5

(83)

Question 55

Setting deadlines is an element of project planning.

(True/False)

5.0/5

(84)

Question 56

The critical path is the shortest path through the project network.

(True/False)

4.9/5

(83)

Question 57

Which of these statements regarding project crashing is true?

(Multiple Choice)

4.9/5

(91)

Question 58

Given the following information for a project, draw the AOA (Activity-On-Arrow) project network. Activity Immediate Processor Activity Time (days) A - 6 B - 8 C A, B 5 D B 4 E C 7 F C, D 3 G D 6 H E, F, G 5

(Essay)

4.7/5

(81)

Question 59

Consider the following project. Activity Imunediate Predecessor Activity Time (drys) A -- 3 -- 4 4 6 5 , 4 7 -What is the latest finish time for activity F?

(Multiple Choice)

4.8/5

(76)

Question 60

Showing 41 - 60 of 116

Consider the following network. -Assume that the variance for each activity in the network is equal to 1. Compute the probability that path A-B-E-F will be completed in 15 days.

In PERT, the actual project completion time will never exceed the expected duration of the critical path.

A(n) ________ chart is a graph or a bar chart for each activity that shows the project schedule and the passage of time.

When applying linear programming models to project crashing, the objective is to minimize ________.

In a CPM/PERT network the critical path is the

Consider the following project. Activity Imunediate Predecessor Activity Time (drys) A -- 3 -- 4 4 6 5 , 4 7 -What is the latest possible time that Activity E can be started without delaying the completion of the project?

Elements of project planning include

In an AOA network, a ________ activity is used to show a precedence relationship, but it does not represent passage of time.

An AOA network will never require dummy activities.

The PERT pessimistic time estimate is an estimate of the minimum time an activity will require.

Consider the following network. -The early start for activity 2 is ________.

The early start of an activity that has more than one predecessor is the minimum of the earliest finishes of all predecessors.

Setting deadlines is an element of project planning.

The critical path is the shortest path through the project network.

Which of these statements regarding project crashing is true?

Given the following information for a project, draw the AOA (Activity-On-Arrow) project network. Activity Immediate Processor Activity Time (days) A - 6 B - 8 C A, B 5 D B 4 E C 7 F C, D 3 G D 6 H E, F, G 5

Consider the following project. Activity Imunediate Predecessor Activity Time (drys) A -- 3 -- 4 4 6 5 , 4 7 -What is the latest finish time for activity F?

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters