Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
18 Cards in this Set
- Front
- Back
|
Gantt Charts |
planning charts used to schedule resources and allocate time activities planned, order of performance, activity time estimates are recorded, overall project time is developed |
|
|
PERT and CPM |
tools to help manage large and complex projects
PERT: Program evaluation and review technique - provides three time estimates for each activity CPM: Critical path method -Assumes activity times are known |
|
|
Critical Path |
represent tasks that will delay the entire project if they are not completed on time -the computed longest time path through a network |
|
|
AON |
Activity on node |
|
|
AOA |
Activity on arrow |
|
|
Critical Path Analysis |
N: ID number T: activity duration ES: Earliest start LS: Latest Start ES: Earliest finish LF: Latest finish (put in notes) |
|
|
Forward pass
|
determines early start and early finish begin with first activity (put in notes) |
|
|
Backward pass |
determines late start and late finish begin with last activity (put in notes) |
|
|
Forward Pass and Calculations |
ES= preceding EF if two preceding nodes ES=max EF EF=ES+Duration |
|
|
Backward Pass Calculation |
LS= LF-Duration LF=LS of preceding node if two preceding nodes LF=min LS |
|
|
Slack Time |
length of time an activity can be delayed without delaying project Slack= LS-ES Slack= LF-EF You can use either one Key is to find which activities have 0 slack |
|
|
Critical activity |
activity with zero slack on the critical path |
|
|
PERT Calculations |
optimistic time (a) pessimistic time (b) most likely time (m) expected activity time: t=(a+4m+b)/6 variance = [(b-a)/6]^2 (in notes) |
|
|
Project variance |
sum of variances of all critical activities |
|
|
Project standard deviation |
square root of project variance |
|
|
Project crashing |
Shorten the duration of a project in the cheapest manner possible 1. compute crash cost per week for each activity 2. find critical path and critical activities 3. select activity with smallest crash cost per period 3. if more than one path, select cheapest 2 4. update activity times |
|
|
Crash cost per period calc |
(Crash cost - Normal Cost) / (Normal time - crash time) |
|
|
probability of project completion |
z= specified time - path duration / path standard deviation |
