Test 4
According to table 11-1, compute the slack time for activity D. A) 0 B) 5 C) 3 D) 6 E) None of the above
A) 0
If activity A is not on the critical path, then the slack for A will equal A) LF - EF B) EF - ES C) 0 D) all of the above
A) LF - EF
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.
A) arc.
A technique that allows a researcher to determine the greatest amount of material that can move through a network is called A) maximal-flow. B) maximal-spanning. C) shortest-route. D) maximal-tree. E) none of the above
A) maximal-flow.
PERT assumes that the total completion time of a project follows which of the following probability distributions? A) normal B) exponential C) binomial D) Poisson E) None of the above
A) normal
If a project is to be crashed at the minimum possible additional cost, then the first activity to be crashed must be A) on the critical path B) the one with the shortest activity time C) the one with the longest activity time D) the one with the lowest cost
A) on the critical path
The earliest start time for an activity is equal to A) the largest EF of the immediate predecessors B) the smallest EF of the immediate predecessors C) the largest ES of the immediate predecessors D) the smallest ES of the immediate predecessors
A) the largest EF of the immediate predecessors
The standard deviation for the PERT project is approximately A) the square root of the sum of the variances along the critical path B) the sum of the critical path activity standard deviations C) the square root of the sum of the variances of the project activities D) all of the above
A) the square root of the sum of the variances along the critical path
If items being transported must go through an intermediate point before reaching a final destination, then this situation is known as a(n) A) transshipment problem. B) assignment problem. C) transportation problem. D) intermediate point problem. E) None of the above
A) transshipment problem.
The following represents a project with known activity names. All times are in weeks. Using the data in table 11-1, what is the minimum possible time required for completing the project? A) 8 B) 14 C) 25 D) 10 E) None of the above
B) 14
According to the data in table 11-2, what is the minimum expected completion time for the project? A) 18 B) 19 C) 37 D) 11 E) None of the above
B) 19
Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? A) 100 B) 750 C) 850 D) 900 E) None of the above
B) 750
In PERT, slack time equals A) ES + t B) LS - ES C) 0 D) EF - LS E) none of the above
B) LS - ES
When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true? A) There are typically 4 decision variables and 3 constraints. B) There are typically 12 decision variables and 7 constraints. C) There are typically 7 decision variables and 7 constraints. D) There are typically 12 decision variables and 12 constraints. E) There are typically 12 decision variables and 3 constraints
B) There are typically 12 decision variables and 7 constraints.
Given table 9-2, the final table for an assignment problem, who should be assigned to job 2? A) Worker A B) Worker C C) either worker A or worker C D) neither worker A nor worker C E) Worker D
B) Worker C
When PERT is used and probabilities are found, one of the assumptions that is made is that A) all activities are on the critical path B) activity times are independent C) all activities have the same variance D) the project variance is equal to the sum of the variances of all activities in the project E) all of the above
B) activity times are independent
An assignment problem may be viewed as a transportation problem with A) a cost of $1 for all shipping routes B) all supplies and demands equal to 1 C) only demand constraints D) only supply constraints
B) all supplies and demands equal to 1
A point in the network, that is at the beginning or end of a route is called a(n) A) arc. B) branch. C) line. D) node. E) source.
B) branch.
If the project completion time is normally distributed and the due date for the project is greater than the expected completion time, then the probability that the project will be finished by the due date is A) less than 0.50 B) greater than 0.50 C) equal to 0.50 D) undeterminable without more information
B) greater than 0.50
In a PERT network, the latest (activity) start time is the A) earliest time that an activity can be finished without delaying the entire project. B) latest time that an activity can be started without delaying the entire project. C) earliest time that an activity can start without violation of precedence requirements. D) latest time that an activity can be finished without delaying the entire project. E) None of the above
B) latest time that an activity can be started without delaying the entire project.
The critical path is the A) shortest path in a network B) longest path in a network C) path with the smallest variance D) path with the largest variance E) none of the above
B) longest path in a network
In a typical shortest-route model, the objective is to A) minimize the number of nodes in the route B) minimize the time or distance to get from one point to another C) minimize the number of arcs in the route D) travel through all nodes in the best way possible
B) minimize the time or distance to get from one point to another
Four cranes are being assigned to five construction jobs. One of the jobs will be delayed until one of the cranes becomes available after finishing the first job. An assignment model will be used. To allow specialized software to find a solution to this problem, A) nothing special must be done to this problem B) one dummy crane must be used in the model C) one dummy job must be used in the model D) both a dummy job and a dummy crane must be used in the model
B) one dummy crane must be used in the model
The critical path of a network is the A) path with the least variance. B) path with zero slack. C) path with the most activities. D) path with the largest variance. E) None of the above
B) path with zero slack.
The first step in the maximal-flow technique is to A) pick the node with the maximum flow. B) pick any path with some flow. C) eliminate any node that has a zero flow. D) add a dummy flow from the start to the finish. E) None of the above
B) pick any path with some flow.
PERT stands for A) probabilistic evaluation and review technique. B) program evaluation and review technique. C) probability of expected run times. D) program of expected run times. E) project evaluation and review technique.
B) program evaluation and review technique.
A large city is planning for the Olympic Games which will be coming in a few years. The transportation system is being evaluated to determine what expansion is needed to handle the large number of visitors to the games. Which of the following models would most likely help the city planners determine the capacity of the current system? A) the transportation models B) the maximal-flow model C) the shortest-route model D) the minimal-spanning tree model
B) the maximal-flow model
Given the following small project, the critical path is ______ days A) 4 B) 10 C) 12 D) 22 E) None of the above
C) 12
A company is considering opening one new production facility, and three locations are being considered. For this facility location problem, how many transportation models must be developed and solved? A) 1 B) 2 C) 3 D) 4
C) 3
Using the data in table 11-1, what is the latest possible time that C may be started without delaying completion of the project? A) 0 B) 4 C) 8 D) 10 E) None of the above
C) 8
According to the data in table 11-2, what is the critical path? A) A-B B) A-C C) B-D D) A-B-C-D E) None of the above
C) B-D
The primary difference between PERT and CPM is that A) PERT uses one time estimate B) CPM has three time estimates C) PERT has three time estimates D) with CPM, it is assumed that all activities can be performed at the same time
C) PERT has three time estimates
In a PERT network, the earliest (activity) start time is the A) earliest time that an activity can be finished without delaying the entire project. B) latest time that an activity can be started without delaying the entire project. C) earliest time that an activity can start without violation of precedence requirements. D) latest time that an activity can be finished without delaying the entire project. E) None of the above
C) earliest time that an activity can start without violation of precedence requirements.
PERT A) assumes that we do not know ahead of time what activities must be completed. B) assumes that activity time estimates follow the normal probability distribution. C) is a network technique that uses three time estimates for each activity in a project. D) is a deterministic network technique that allows for project crashing. E) None of the above
C) is a network technique that uses three time estimates for each activity in a project.
In PERT, the time estimate b represents A) the most optimistic time B) the most likely time C) the most pessimistic time D) the expected time E) none of the above
C) the most pessimistic time
The two most common objectives for the assignment problem are the minimization of A) uncertainty or inexperience. B) total costs or inexperience. C) total costs or total time. D) total time or inexperience. E) total costs or uncertainty
C) total costs or total time.
A company must assign mechanics to each of four jobs. The time involved varies according to individual abilities. Table 9-1 shows how many minutes it takes each mechanic to perform each job. If the optimal assignments are made, how many total minutes would be required for completing jobs? A) 0 B) 4 C) 17 D) 16 E) None of the above
D) 16
If a transportation problem has 4 sources and 5 destinations, the linear program for this will have A) 4 variables and 5 constraints B) 5 variables and 4 constraints C) 9 variables and 20 constraints D) 20 variables and 9 constraints
D) 20 variables and 9 constraints
Find the shortest route from node 1 to node 4 using the shortest-route technique. A) 650 B) 450 C) 550 D) 500 E) 800
D) 500
What is said to exist when total demand equals total supply in a transportation problem? A) an equalized problem B) an equilibrialized problem C) a harmonized problem D) a balanced problem E) This situation can never occur.
D) a balanced problem
The critical path of a network is the A) shortest time path through the network. B) path with the fewest activities. C) path with the most activities. D) longest time path through the network. E) None of the above
D) longest time path through the network.
The value of work completed for an activity is determined by which of the following? A) budgeted cost - actual cost B) actual cost divided by budgeted cost C) percentage of work completed multiplied by actual activity cost D) percentage of work completed multiplied by budgeted activity cost E) activity difference divided by budgeted cost
D) percentage of work completed multiplied by budgeted activity cost
The computing center of a large university is installing fiber-optic cables to fifteen building on campus. Which of the following models could be used to determine the least amount of cable required to connect all the buildings? A) the transportation model B) the maximal-flow model C) the shortest-route model D) the minimal-spanning tree model
D) the minimal-spanning tree model
Which network model is used to determine how to connect all points of a network together while minimizing the total distance between them? A) the assignment model B) the maximal-flow model C) the shortest-route model D) the minimal-spanning tree model
D) the minimal-spanning tree model
The latest finish time for an activity is found during the backward pass through the network. The latest finish time is equal to A) the largest LF of the activities for which it is an immediate predecessor B) the smallest LF of the activities for which it is an immediate predecessor C) the largest LS of the activities for which it is an immediate predecessor D) the smallest LS of the activities for which it is an immediate predecessor
D) the smallest LS of the activities for which it is an immediate predecessor
In PERT, we assume that A) the times to complete individual activities are known with certainty. B) all activities are carried out by staff from our own organization. C) the total cost of a project is independent of the time to complete the project. D) the total time to complete all activities on the critical path is described by a normal distribution. E) None of the above
D) the total time to complete all activities on the critical path is described by a normal distribution.
The maximal-flow technique would best be used A) to assign workers to jobs in the cheapest manner. B) to determine the number of units to ship from each source to each destination. C) to determine LAN network wiring within a building. D) to maximize traffic flow on a busy highway. E) by a trucking company making frequent but repeatable drops.
D) to maximize traffic flow on a busy highway.
Slack time in a network is the A) amount of time that an activity would take assuming very unfavorable conditions. B) shortest amount of time that could be required to complete the activity. C) amount of time that you would expect it would take to complete the activity. D) difference between the expected completion time of the project using pessimistic times and the expected completion time of the project using optimistic times. E) amount of time that an activity can be delayed without delaying the entire project
E) amount of time that an activity can be delayed without delaying the entire project
Network models such as PERT and CPM are used A) to plan large and complex projects B) to schedule large and complex projects C) to monitor large and complex projects D) to control large and complex projects E) for all of the above
E) for all of the above
The final node or destination in a network is called a(n) A) arc. B) branch. C) source. D) mouth. E) sink.
E) sink.
