Management > QUESTIONS & ANSWERS > York University ADMINISTRA Project Scheduling: PERT/CPM (All)
York University ADMINISTRA Project Scheduling: PERT/CPM
Document Content and Description Below
1. PERT and CPM 2. | Which is not a significant challenge of project scheduling?a. deadlines exist. 3. | Arcs in a project network indicatea. completion times. 2 Chapter 12 Project Scheduli ... ng: PERT/CPM 4. The critical path 5. The earliest start time rule 6. | Activities following a nodea. can begin as soon as any activity preceding the node has been completed. 7. | Activities G, P, and R are the immediate predecessors for activity W. If the earliest finish times for the three are 12, 15, and 10, then the earliest start time for Wa. is 10. 8. | Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The latest finish time for activity Ha. is 11. 9. | When activity times are uncertain,a. assume they are normally distributed. 10. | To determine how to crash activity timesa. normal activity costs and costs under maximum crashing must be known. [Show More]
Last updated: 3 years ago
Preview 1 out of 19 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Reviews( 0 )
$10.00
Can't find what you want? Try our AI powered Search
Document information
Connected school, study & course
About the document
Uploaded On
Jun 19, 2021
Number of pages
19
Written in
All
Additional information
This document has been written for:
Uploaded
Jun 19, 2021
Downloads
0
Views
51
