Chapter 4 More Networks : Critical Path Analysis Flashcards

1
Q

What is CPA all about

A

This is using networks to build a project overview , so showing what tasks depends on what , and then seeing how best and how can we SCHEDULE THESE as they will take certain times, seeing if we have to time to spare / not

Then also representing on a gantt chsrt to see if we can get less workers if we start things on different days if we are allowed to

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How to do precedence tsble

A

Left make rows of all activities

Right what they depend on

Fill it out

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

If last task in lrecedence table says can only be done once all activities are done, what should you try and do?

Quick way to do this!

A

Yiu should try and SIMPLIFY if you can

So if c depends on A, putting c down means you put A, don’t need so cross out !

2) just look at all activities that haven’t been mentioned before so add those in as these are the only ones that it will depend on

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How to draw an ACTIVITY NETWORK!

Remember activity on arc, so what do we label !
Arrows!

A

Starter node label each node , so start with 0

Then arrows anything coming out that dint depend on anything first, label the ARROWS , not nodes

3) then any time something DEPENDS on something, we put a node down!
- remember to LABEL

4) finally add an end node and label

MAKE SURE TO ADD ARROWS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How to best draw activity network

A

Try no cross cross curved edges but if need be do it

Straight lines and make them meet,

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

As we add arrows, what kinds graoh is this

A

A DIRECTED GRAPH, and thus has source snd sink

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Whenever drawing activity networks what’s the most I portsnt thing to do first when looking at precedence tsble

A

ALWAYS do the ones that depend on ONE THING FIRST, as might be sticky situation after

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Dummy line?

What value does it hold?

Do we need tk label?

A

This allows you to connect things so that precedence is maintained snd still works

Holds a value of 0

No label, just arrow, an extension of one thing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

If ever get stuck as drawing wrong,

A

Just remember to do the one thst depends on one first , rub out and do sgsin

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How can we show how activities may have different weights on them?

A

After drawn activity network, now these activities could have WEIGHTS ON THEM

This could mean they have certain times taken to do it, cost etc

We can do analysis on them tk see what leeway there js

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Early / late time?

A

Box on every node

Early shows earliest can start, or activity before can finish

Late shows latest activity before can finish or activity can starts

If activity before is past late time , or activity ahead starts later, WHOLE PROJECT IS LATE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How to find early times for all

Last box early and late time?

How to find late for all

A

FORWARD PASS
= consider all paths going into node (must KNKW ALL THE PATHS GOING IN)
- add the weights to current earliest

AND PICK THE LARGEST CHOICE !!!

The last box EARLY AND LATE TIME THE SAME

2) backwards pass, need to know all the arcs going back,
Subtrsvt the weights from current late
and pick the EARLIEST TIME

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Why going forward do we pick the latest, and backwards the earliest?

A

Going forward, if you like an early one, then one of activities it has depended on HASNT HAPPEND YET, must pick the latest

Going backwards have to too or will overrun

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Just remember rfirwar backward pass d

A

Forward big back small so time in middle as less

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What should source snd sink look like?

A

Source = 00
Sink = same same

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

In an activity network there will always be critical activity and paths

What is a CRITICAL ACTIVITY
HOW TO IDENTIFY CRITICAL ACTIVITY

A

This is an activity that MUST start on time or whole project will overrun

Can identify as has same start start end end for two nodes, and the distance in between= the distance needed to go from 1st node to second

17
Q

What is the critical path

What does this mean

A

Path cknnected by numerous critical activities from START TO END NODE

A list of activities thst must be completed on time or whole project overrun

18
Q

Can we have more than one critical path?

A

Yes , can have multiple , but there will always be atleast 1!

19
Q

Which activities can float, and what dies float even mean

A

Float is the WRIGGLE room an activity , different times that represent the total amount it can wriggle by

Critical activites have NO FLOAT

20
Q

3 types of floats

A

Total float

Independent float

Interfering float

21
Q

What is the total float and how to find out

A

This it the TOTAL amount the activity can move left or right essentially like a slider , the total amount it can wriggle

So OUTER - OUTER - activity duration
(Late finish - early start), have to - duration as on slider tbis takes some distance , want total distance remaining

22
Q

What is independent float and how to find out

Explain the formula behind this

A

This is total float it can do WITHOUT forcing previous activity to finish at specific time or next to start at specfic

= INNER - INNER - DURSTION

If it’s negative = 0!

2) if you consider the outer, then starting at this time will mean activity before must finish early to hit this, so interfere, and right outer finishing at this time means activity before CANT START at the early start time

The fire, you must consider thr INNERS only, as these don’t limit how much the activity before or after csn start by

Remember duration!

23
Q

What is interfering float and how to find out

A

Float available that will defo eat in to previous and force next to start at specfic time

= TOTAL - float that diesn’t cause any problem
= TOTAL - INDEPENDENT

24
Q

Floats summary

A

Total = outer - outer - durstion

Indecent = inner - inner - durstion

Interfering = total - independent

25
Q

What are the floats for CRITICAL ACTIVITIES

A

Always 0!

Because if total 0, then indolent must be 0 and so is interniert

26
Q

IF TWO ACTIVITIES BOTH COME FROM SAME PLACE AND THEN GO INTO A NODE WHAT TO DO

Important !,

A

Must make one a dummy to ensure unique numbering, make a node and continue with numbering rather than CURVING LINE

27
Q

What does floats mean in context, so if I have 10 independent float, what does this now mean

A

I can take 10 days longer without changing anything

28
Q

What can a delay in time do to activities if exceeds floats

How to determine what has changed

A

Can cause some tk be critical (redo) and others not to be

Lit do forward and backward again with new times and you’ll see!

29
Q

Damn when deciding which one to reduce by, what to consider

Important

A

You want the overall project to be a day quicker

Thus if it’s not critical then no point

And if it is critical have to consider if it GURANTEES a reduction in time, as I’d there are two critical paths, then have to chose the one thst sffected both so both are reduced by one day, and overall no matter what project is taken back

Must pick thing that affects ALL THE CRITICAL PATHS

30
Q

How to draw Gantt chart cascade diagram

A

Time in x axis

Critical activites on bottom row together, start snd end time

If another critical path add on row above , but don’t repeat

2) then for every activity not criticsl, own row
- start, finish, dotted line for late finish as float

Continue

NO VERTICAL AXIS, that’s for number of workers

31
Q

How to do restliche history’s, and manipulate to get lower workers net

A

Y AXIS THIS TIME WITH WORKERS!
1) from cascade diagram, drop the things like gravity
- critical row drips
- then other activtiesdrop

SCALE THEM WITH SLIDER TO GET LEAST AMOUNT OF WORKERS AS OOSSIBLE

32
Q

Difference with cascade and resource?

A

Resource has worked y axis too, with gravity drop

And you can move the activity based on their floats to get optimal least amount of workers working at ince

33
Q

What can resource diagram show , if they’re at early times or moved around

A

If just drop like gravity, will show amount of workers needed per day if activites start at specific times

However through manipulation, csn schedule kther activitues to start so thst won’t need ss m any eorkers

34
Q

How to find the LONGEST and shortest route in a netowkr

A

Longest = CPA on a network, and is the paths of CRITICAL ACTIVITY!, where the length is final length

shortest = dijkstram don’t forget to GIVE THE ROUTE TOO

35
Q

Two assumptions can be made when doing cpa?

IMPORTSNT

A

That activities take SXACTLY WHOLE NUMBER OF DAYS TO COMPLETE ( very unrealistic)

There is no turnover time between activities (also unrealistic )

36
Q

How to determine what an activity is INTERFERING WITH properly

A

Check activity behind and ahead, and look for an activity that is SOLELY dependent on activity you’re moving, because now if you move this it will definitely affect that one, whereas if the activity depends on soemthign else moving your activity might not have an affect, as the other one depends more on another!

So check for SOLE DEPENDENCE