Chapter 6 : Projects scheduling, networks, duration estimation and critical path.

Question 1

objectives, chapter 6 (projects scheduling, networks, duration estimation and critical path)

Answer 1

• key terminology
• apply logic to create activity networks, including predecessor and successor tasks
• activity-on-node (AON) techniques
• activity duration estimation
• critical path using forward and backward passes
• float and how to determine it
• probability of a project finishing on time under PERT estimates
• what are the steps that can be employed to reduce the critical path?

Question 2

What is project scheduling?

Answer 2

requires us to follow some carefully laid-out steps in order for the schedule to take shape

Question 3

What is project planning?

Answer 3

as it relates to project scheduling and defined by the PMBoK : the identification of the project objectives and the ordered activity necessary to complete the project including the identification of resource types and quantities required to carry out each activity or task.

Question 4

10 project scheduling terms

Answer 4

• successor
• predecessor
• network diagram
• serial activities
• concurrent activities
• merge activities
• burst activities
• node
• path
• critical path

Question 5

Whats the difference between AOA and AON

Answer 5

activities on arrow

activities on node

Question 6

What is the definition of concurrent activities?

Answer 6

When two activities can be executed at the same time.

Question 7

3 duration estimation methods

Answer 7

• past experience
• expert opinion
• math derivation : beta distribution

Question 8

2 formulas for beta distribution

Answer 8

• activity variance
• activity duration
  a = optimistic
  b = pessimistic
  m = most likely

Question 9

formula for activity variance

Answer 9

s^2=[ (b-a)/6 ] ^2

Question 10

formula for activity duration

Answer 10

TE = (a + 4m + b)/6

Question 11

critical path determines the

Answer 11

shortest project length

Question 12

3 forward pass rules

Answer 12

. ES + duration = EF
. EF (predecessor) = ES (successor)
. largest preceding EF at merge becomes ES for succesor

Question 13

3 backward pass rules

Answer 13

. LF - duration = LS
. LS (successor) = LF (predecessor)
. smallest preceding LS at burst becomes LF for predecessor

Question 14

equation for float

Answer 14

float = slack = LS - ES = LF - EF

Question 15

how to find the critical path

Answer 15

all activities along the critical path have float = 0

may be more than one critical path

Question 16

how to reduce the critical path

Answer 16

• eliminate tasks on the CP
• convert serial to parallel whenever possible
• overlap sequential tasks
• shorten duration CP tasks
• shorten tasks (early, longest, easiest, that cost least to speed up)