71) Find the shortest route from Node 1 to Node 5. From Node To Node Di
71) Find the shortest route from Node 1 to Node 5. From Node To Node Distance 1 2 250 1 3 150 1 4 200 2 3 50 2 4 […]
71) Find the shortest route from Node 1 to Node 5. From Node To Node Distance 1 2 250 1 3 150 1 4 200 2 3 50 2 4 […]
51) The maximal-flow technique might be used A) to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport. B) by someone designing the […]
31) A line in a network that may represent a path or a route is called a(n) A) arc. B) branch. C) line. D) fork. E) sink. 32) A point […]
1) The points on the network are referred to as nodes. 2) Lines connecting nodes on a network are called links. 3) Transportation models may be used when a firm […]
111) The crash time of an activity represents A) the normal time to complete an activity. B) the most pessimistic time to complete an activity. C) the incremental decrease in […]
91) Using the data in Table 11-4, determine the latest time activity A can be finished and not delay any activity? A) 4 B) 0 C) 8 D) 5 E) […]
71) The work breakdown structure involves identifying the ________ for each activity. A) time B) cost C) resource requirements D) predecessors E) All of the above 72) PERT stands for […]
51) Given an activity’s optimistic, most likely, and pessimistic time estimates of 2, 10, and 20 days respectively, compute the PERT variance for this activity. A) 3 B) 6 C) […]
31) In PERT, the variance in completion time is equal to the variance of the most time consuming activity on the critical path. 32) Given the assumptions in PERT, the […]
1) PERT and CPM are quantitative analysis tools designed to schedule and control large projects. 2) PERT is a deterministic analysis tool allowing for precise times of activities within a […]