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;
13 Cards in this Set
- Front
- Back
Earliest time at which and activity can start, assuming all predecessors have been completed |
Earliest start |
|
Earliest time at which an activity can be finish |
Earliest finish |
|
Latest time at which an activity can start so as to not delay the completion time of the entire project |
Latest start |
|
Latest time by which an activity has to be finished so as to not delay the completion time of the entire project |
Latest finish |
|
Expected time |
a+4m+b/6=t |
|
Variance of times |
(b-a/6)^2 |
|
A (blank) breaks down a project into component, subcomponents, activities, and task |
Work Breakdown Structure |
|
A bar graph displaying when activities are scheduled to start, when they will be finished, and where extra time as available is known as a... |
Gantt Chart |
|
The beta distribution is used in project management to... |
Calculate pessimistic and optimistic activity times |
|
In a PERT network, non-critical activities that have a little slack need to be monitored closely |
because near critical paths could become critical path with small delays in these activities |
|
The probability that a project will be completed by its earliest completion date is |
50 Percent |
|
Assumess we know a fixed time estimate for each activity and there is no availability and activity times |
Critical path method |
|
Uses a probability distribution for activity times to allow for variability |
Program Evaluation Review Technique |