Given the following information for a project, draw the AON (Activity-On-Node) 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 { 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}\] -Determine the slack for activity F.

A) 2 days B) 3 days C) 4 days D) 5 days A) 2 days B) 3 days C) 4 days D) 5 days

Exam 8: Project Management

Given the following information for a project, draw the AON (Activity-On-Node) 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.9/5

(88)

Question 21

A work breakdown structure breaks down a project into

(Multiple Choice)

4.9/5

(75)

Question 22

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} -Which activity should be crashed to reduce the project completion by 2 days?$ 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 -Which activity should be crashed to reduce the project completion by 2 days?

(Multiple Choice)

4.9/5

(83)

Question 23

A list of the tasks, broken down into modules, components, and individual tasks, is called a

(Multiple Choice)

4.9/5

(71)

Question 24

Establishing precedence relationships is an element of project planning.

(True/False)

4.8/5

(86)

Question 25

A dummy activity is used to show a precedence relationship, but it does not represent a

(Multiple Choice)

5.0/5

(83)

Question 26

The advantage of a Gantt chart over other charts is its

(Multiple Choice)

4.7/5

(81)

Question 27

If an activity cannot be delayed without affecting the entire project, then it is a ________ activity.

(Multiple Choice)

4.8/5

(74)

Question 28

In PERT, the project variance is the sum of the variance of all project activities.

(True/False)

4.9/5

(72)

Question 29

Consider the following network. -How long will it take to complete the project?

(Short Answer)

4.7/5

(84)

Question 30

In PERT, the expected project completion time is assumed to be distributed according to a beta distribution.

(True/False)

4.8/5

(70)

Question 31

Joe used a project management software package and has determined the following results for a given project.: Expected completion time of the project = 22 days Variance of project completion time = 2.77 What is the probability of completing the project over 20 days?

(Multiple Choice)

4.9/5

(98)

Question 32

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 is the probability that the critical path for this project will be completed within 80 weeks?

(Short Answer)

4.8/5

(76)

Question 33

The LS and LF are calculated using the

(Multiple Choice)

4.8/5

(73)

Question 34

Consider the following project. 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 -Determine the slack for activity F.

(Multiple Choice)

4.7/5

(83)

Question 35

A PERT/CPM activity has an optimistic time estimate of 4 days, a most likely time estimate of 6 days, and a pessimistic time estimate of 10 days. The expected time (in days) of this activity is:

(Multiple Choice)

4.8/5

(86)

Question 36

The critical path is the ________ path through the network.

(Multiple Choice)

4.9/5

(85)

Question 37

A PERT/CPM activity has an optimistic time estimate of 4 days, a most likely time estimate of 6 days, and a pessimistic time estimate of 10 days. The standard deviation of this activity is:

(Multiple Choice)

4.8/5

(81)

Question 38

An AON network will never require dummy activities.

(True/False)

4.8/5

(69)

Question 39

Shortening the project's duration by deleting unnecessary activities is called crashing.

(True/False)

4.9/5

(78)

Question 40

Showing 21 - 40 of 116

Given the following information for a project, draw the AON (Activity-On-Node) 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

A work breakdown structure breaks down a project into

A list of the tasks, broken down into modules, components, and individual tasks, is called a

Establishing precedence relationships is an element of project planning.

A dummy activity is used to show a precedence relationship, but it does not represent a

The advantage of a Gantt chart over other charts is its

If an activity cannot be delayed without affecting the entire project, then it is a ________ activity.

In PERT, the project variance is the sum of the variance of all project activities.

Consider the following network. -How long will it take to complete the project?

In PERT, the expected project completion time is assumed to be distributed according to a beta distribution.

Joe used a project management software package and has determined the following results for a given project.: Expected completion time of the project = 22 days Variance of project completion time = 2.77 What is the probability of completing the project over 20 days?

The LS and LF are calculated using the

Consider the following project. 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 -Determine the slack for activity F.

A PERT/CPM activity has an optimistic time estimate of 4 days, a most likely time estimate of 6 days, and a pessimistic time estimate of 10 days. The expected time (in days) of this activity is:

The critical path is the ________ path through the network.

A PERT/CPM activity has an optimistic time estimate of 4 days, a most likely time estimate of 6 days, and a pessimistic time estimate of 10 days. The standard deviation of this activity is:

An AON network will never require dummy activities.

Shortening the project's duration by deleting unnecessary activities is called crashing.

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