You are on page 1of 5

1.

Scheduling is primarily concerned with the


timing and assignment of operations.
A. True
B. False 6. Which one of the following is not an
appropriate job-shop scheduling rule?
A. Earliest due date
B. Assignment method
C. First come first served
2. Job shop schedule by priority rules is
inherently deterministic in nature; the D. Shortest processing time
scheduler must plan as if both the order of E. Johnson's rule
processing and the amount of time each job
would take in each work center were known
exactly.
A. True
B. False 7. Which one of the following is an optimizing
technique?
A. Shortest processing time
B. Assignment method
C. First come first served
3. The assignment method will solve a wide
variety of problems that have to do with D. Loading
flow systems because of the optimization of E. Critical Ratio
work sequencing.
A. True
B. False

8. A major disadvantage of the SPT rule is:


A. it tends to make longer jobs wait until
all shorter jobs are finished.
4. The hierarchy of decisions in production B. it results in higher work-in-process
operations is, in order: (1) long-term inventories.
capacity planning, (2) aggregate planning, C. long jobs tend to prevent short jobs
(3) material requirements planning, (4) from completing once they are
capacity requirements planning, (5) started.
scheduling
D. it does not take processing time into
A. True
account.
B. False
E. none of these.

5. Johnson's rule, the assignment method, and


9. Which statement is correct?
loading and priority rules are all appropriate
methods of scheduling for job shops. A. Vertical loading involves infinite
loading.
A. True
B. Horizontal loading involves infinite
B. False
loading.
C. Vertical loading involves finite 2. There can be two or more parallel critical
loading. paths, all having exactly the same
completion time.
D. Finite loading is a subset of infinite
loading. A. True
E. All loading by definition must be B. False
finite.

3. The term "work breakdown structure" refers


10. Finite loading, as compared to infinite to a failure in the work structure.
loading, assumes that: A. True
A. There are only a finite number of B. False
jobs to be done.
B. Work centers can be loaded without
regard to their capacity.
C. A work centers' capacity
4. In crashing it may be necessary to shorten
(limitations) must be taken into
activities not on the critical path in order to
account.
accelerate the project.
D. Work centers' capacity should be A. True
ignored as a constraint.
B. False
E. There really are no limitations since
overtime and subcontracting are
always options.

5. In PERT, if the scheduled project


completion time and sum of the average
completion times for critical path activities
11. In a task assignment situation, in how are the same, the probability of completing
many different ways can five jobs be the project on schedule is estimated at 50
assigned to five machines? percent, assuming no other paths are near-
A. 1 critical.
B. 5 A. True
C. 25 B. False
D. 120
E. 3,125

1. Project champions are people who promote 6. Early in a project's life cycle, risk
and support projects. occurrence has a high probability but a low
cost.
A. True
A. True
B. False
B. False
7. Projects go through a life cycle that 11. Concerning PERT and CPM:
involves introduction, growth, maturity and A. These are two different names for essentially t
decline.
B. CPM tends to focus more on the critical path w
A. True minimum slack times.
B. False C. PERT gives a clearer indication of activity sla
picture of path slack.
D. Because of its recent discovery, much less is k
E. All of the above are true.
8. A major limitation of Gantt charts in project
management is that they do not: 1. A waiting line tends to form when service capacity e
A. indicate the major activities involved. A. True
B. show activity times. B. False
C. show the timing of activities.
D. show precedence relationships.
E. give a visual portrayal.
2. Higher service times equal higher service
rates.
A. True
B. False
9. Using the computing algorithm, activity
slack can be computed as:
A. LF - LS
B. LS - LF
3. As system utilization increases, the
C. LS - ES
expected number of customers waiting for
D. LF - EF service increases.
E. c or d. A. True
B. False

10. An important assumption in PERT


calculations is: 4. For infinite source systems, the average
A. activity times are normally number of customers being served is equal
distributed. to the arrival rate divided by the service
B. activity times are independent. rate.
C. a computer will be available to do A. True
the calculations. B. False
D. alternate activities are available for
every element
E. early start times must equal early
complete times
5. A three-step repair service with one server
at each step would be an example of a:
A. multiple-phase, multiple-channel
system.
B. single-phase, multiple-channel 9. Why is there waiting in an infinite source
system. queuing system?
C. multiple-phase, single-channel A. poor scheduling
system. B. slow service
D. solo server, trio channel C. low utilization
E. 3 by 3 D. variability in arrival and service rates
E. multiple phase processing

6. A system with an arrival rate of two per


hour, a service time of 20 minutes, and one 10. The term "queue discipline" refers to:
server, would have a utilization of.
A. the willingness of customers to wait
A. 10% in line for service
B. 33% B. having multiple waiting lines
C. 40% without customers switching from
D. 67% line to line
E. none of these C. the order in which customers are
processed
D. the reason waiting occurs in
underloaded systems
E. the use of barriers to prevent lane
7. Waiting lines tend to form in underloaded changing
systems because:
A. capacity always exceeds demand.
B. capacity sometimes exceeds demand.
11. When the cost incurred by all customers is
C. demand always exceeds supply. not the same, an appropriate queuing
D. demand sometimes exceeds supply. model is:
E. breaks and lunches are poorly A. single channel, single phase
scheduled. B. single channel, multiple phase
C. multiple channel, single priority
D. multiple channel, multiple phase
E. multiple channel, multiple priority
8. For an infinite-source system with an arrival
rate of 6 per hour (Poisson) and service time
of 6 minutes per customer (exponential), the
average number being served is: 12. A queuing system has four crews with
A. .10 three members each. The number of
B. .60 "servers" is:
A. 3
C. 1.0
B. 4
D. none of these
C. 7
D. 12
E. 1

You might also like