Operations management stevenson 11th edition test bank ch16

ch16
Student: ___________________________________________________________________________
1. "Flow-shop scheduling" is used in high volume systems.
True False

2. Line balancing is a major factor in the design and scheduling of low volume systems because of batch
processing.
True False

3. Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.
True False

4. When operations are often bottlenecked, additional planned idle time will improve the throughput in those
areas.
True False

5. When orders exceed our capacity, priority rules are used to select which orders will be accepted.
True False

6. The term loading, as used in scheduling, refers to choosing the order in which jobs will be processed in lowvolume systems.
True False

7. Loading is the determination of which work centers should perform which jobs.
True False

8. A Gantt chart is a basic scheduling tool but works best for high-volume systems.
True False


9. A Gantt chart is a basic scheduling tool that is most useful in low-volume systems.
True False

10. A schedule chart depicts the loading and idle times for a group of machines or departments.
True False

11. The output of the system cannot exceed the output of the bottleneck operation(s).
True False

12. The elimination of idle time on both bottleneck and non-bottleneck operations must be accomplished to
optimize output.
True False

13. As long as the bottleneck operations are used effectively idle time in non-bottleneck operations will not
affect the overall productivity of the system.
True False

14. The quantity sent to a bottleneck operation could be split into two or more process batches to better utilize a
bottleneck resource rather than process the entire batch.
True False

15. Splitting a large lot after one operation beyond a bottleneck operation would reduce the overall waiting time
of the bottleneck operation.
True False

16. Input/output (I/O) control refers to monitoring the productivity changes since productivity is determined by
the ratio of Output to Input.
True False

17. Infinite loading and finite loading are two major approaches used to load work centers.
True False

18. A schedule chart can be used to monitor job progress.
True False

19. The assignment model seeks an optimum matching of tasks and resources.
True False

20. Sequencing is concerned with the order in which jobs are done, while loading is concerned with assigning
jobs to work centers or workstations.
True False

21. Priority rules are widely used to sequence jobs in high-volume systems.
True False

22. The assignment method is limited to a maximum of two jobs per resource.
True False

23. Priority rules generally assume that job setup cost is independent of processing sequence of jobs.
True False

24. In a single work center, makespan improvement can be accomplished by selecting the optimal sequencing
rule.
True False

25. Priority rules are used in low-volume systems to identify an optimal processing sequence.
True False

26. The SPT priority rule always results in the lowest average completion time.
True False

27. Bottlenecks may shift with the passage of time, so that different operations become bottleneck operations at
different times.
True False

28. If optimal sequencing through three work centers is desired, Johnson's Rule II is used rather than Johnson's
Rule.
True False

29. In the decision-making hierarchy, scheduling decisions are the final step in the transformation process
before actual output occurs.
True False

30. Makespan is the total time needed to complete a group of jobs.
True False

31. The theory of constraints has a goal of maximizing flow through the entire system.
True False

32. A major disadvantage of the SPT rule is that it tends to make very short jobs wait for a long time while
longer, more important jobs are processed.
True False

33. The SPT rule minimizes idle time for subsequent operations.
True False

34. Johnson's rule is a technique used to sequence jobs through a two-step work sequence.
True False

35. A basic difference between scheduling in service systems and scheduling in manufacturing systems is the

random nature of requests in manufacturing systems as opposed to more uniform requests in service systems.
True False


36. Batch process helps maximize worker efficiency.
True False

37. Because scheduling is a matter of detailed execution, it has little impact on the operations strategy of an
organization.
True False

38. Scheduling pertains to:
A. hiring workers
B. process selection
C. buying machinery
D. timing the use of specific resources
E. determining the lowest cost

39. Which of the following is the last step in the capacity/scheduling chain?
A. product planning
B. process planning
C. capacity planning
D. aggregate planning
E. scheduling

40. Which of the following is not an example of a high-volume system?
A. aircraft manufacturing
B. magazine printing
C. petroleum refining
D. waste treatment

E. commercial donut baking

41. Which of the following is not usually a characteristic of successful high-volume systems?
A. smooth workflow through the system
B. customized output
C. rapid repair of breakdowns
D. minimal quality problems
E. reliable supply schedules


42. Primary considerations in scheduling high-volume systems involve:
(I) coordinating the flow of inputs
(II) overcoming the disruptions to planned outputs
(III) assigning workers to work centers
A. I and III
B. I and II
C. II and III
D. I, II, and III
E. II only

43. Organizations with fixed, perishable capacity can benefit from _______.
A. Yield Management
B. Price increases
C. Constraints
D. Sub-optimization
E. Waiting lines

44. A work center can be a ___________.
A. machine
B. group of machines

C. department
D. facility
E. all of the above

45. The EDD priority rule usually does well with regard to _______.
A. Cost
B. Lateness
C. Overtime
D. Waste
E. Makespan

46. Which of the following is not an assumption of priority rules?
A. The set of jobs is known: no new jobs arrive after processing begins.
B. Setup time is independent of processing sequence.
C. Finite loading is assumed.
D. Processing times are deterministic.
E. No machine breakdowns are assumed.


47. The two different approaches to load work centers in job-shop scheduling are:
A. load charts and schedule charts
B. Gantt charts and assignment method
C. infinite loading and finite loading
D. linear programming and makespan
E. none of the above

48. The priority rule which will sequence jobs in the order they are received is _________.
A. EDD
B. LIFO
C. SPT

D. CR
E. FCFS

49. A scheduling technique used to achieve an optimum, one-to-one matching of tasks and resources is:
A. the assignment method
B. Johnson's rule
C. the optimum production technology method (OPT)
D. the appointment method
E. the reservation method

50. In a task assignment situation, in how many different ways can five jobs be assigned to five machines?
A. 1
B. 5
C. 25
D. 120
E. 3,125

51. In an assignment method problem, if it takes Abe 3 hours to build a birdhouse and 4 hours for a doghouse,
while Betty takes 4 hours for a birdhouse and 3 hours for a doghouse, what is the reduced cost (in hours) of
assigning Abe to build the doghouse?
A. 0 hours
B. 1 hour
C. 2 hours
D. 3 hours
E. 4 hours


52. The matrix below shows relative costs for various job-machine combinations. Which set of pairs constitutes
the minimum-cost solution using the Assignment method?

A. 1-B, 2-C, 3-A
B. 1-B, 2-A, 3-C
C. 1-A, 2-C, 3-B
D. 1-A, 2-B, 3-C
E. 1-C, 2-A, 3-B

53. Based on the cost information given in the table below, which set of job-machine pairs reflects the
minimum-cost solution using the Assignment method?

A. 1-B, 2-A, 3-C
B. 1-A, 2-B, 3-C
C. 1-C, 2-A, 3-B
D. 1-B, 2-C, 3-A
E. 1-C, 2-B, 3-A

54. Effective scheduling cannot:
A. yield cost savings and improved productivity
B. reduce the need for expansion of facilities
C. improve customer service
D. eliminate the need to train employees
E. improve patient care in medical settings

55. The priority rule where jobs are processed according to the smallest ratio of due date to processing time is:
A. CR
B. EEDD
C. FCFS
D. S/O
E. SPT

56. Scheduled due dates are the result of:
A. promises to customers
B. MRP processing
C. managerial decisions
D. all of the above
E. our competitor's promises

57. Which of the following is not a measure for judging the effectiveness of a schedule sequence?
A. average number of jobs at the work center
B. total number of jobs at the work center
C. average completion (flow) time
D. average job tardiness
E. none of the above

58. The purpose of cyclical scheduling is to:
A. eliminate weekends and holidays
B. rotate schedules
C. add flexible hours
D. incorporate overtime
E. observe work patterns

59. Average completion (flow) time for a schedule sequence at a work center is:
A. the sum of processing time divided by the number of jobs
B. the sum of jobs' flow times divided by the number of jobs
C. overall flow time divided by total processing time
D. total processing time plus total late time divided by number of jobs
E. the sum of flow time plus total late time divided by number of jobs

60. The scheduling sequencing rule which always results in the lowest average completion (flow) time is the:
A. first come, first served (FCFS) rule

B. shortest processing time first (SPT) rule
C. earliest due date first (EDD) rule
D. least slack per operation first (S/O) rule
E. run until slack happens (RUSH) rule


61. Which sequencing rule is designed specifically to minimize job tardiness?
A. S/O
B. EDD
C. FCFS
D. SPT
E. LPT

62. A scheduling rule used for sequencing jobs through two work centers is:
A. critical ratio rule
B. Johnson's rule
C. slack per operation rule
D. shortest processing time rule
E. Pareto rule

63. For the jobs listed below, which processing sequence would result using Johnson's Rule?

A. c-a-d-b
B. b-d-a-c
C. a-b-c-d
D. d-c-b-a
E. c-a-b-d

64. What is the optimum job sequence for the jobs listed below using Johnson's Rule?

A. e-g-f-d
B. d-g-f-e
C. d-f-g-e
D. e-d-f-g
E. f-e-d-g


65. A major difference between manufacturing and service systems in terms of scheduling is:
A. variability in arrival and service rates
B. processing cost per unit
C. the number of units to be processed
D. length of processing time
E. output rate

66. Scheduling in service systems often takes the form of:
A. appointment systems
B. reservation systems
C. (A) and (B)
D. makespan systems
E. all of the above

67. Scheduling in service systems may involve scheduling:
A. the workforce.
B. the equipment.
C. (a) and (b).
D. customers.
E. all of the above.

68. One disadvantage of appointment systems is:
A. Capacity can be adjusted by varying hours.

B. The customer's desired time may be already taken.
C. People generally accept it as fair.
D. It can reduce customer waiting time.
E. Appointments do not have to be all the same length.

69. In an assignment model where there are fewer jobs than resources:
A. Dummy jobs are needed to solve the problem.
B. Dummy resources are needed to solve the problem.
C. The problem can't be solved using an assignment model.
D. The problem will have multiple optimum solutions.
E. The simplex method must be used to solve the problem.


70. Using the cost information given in the table below, assign work crews to jobs so that total cost is
minimized.

71. The costs to do each of the three jobs on three alternate pieces of equipment are given below. Determine the
job-equipment combination that will minimize total cost.

72. A manager must assign four engineers to projects, one to a project. The leader of Project C has indicated
that he does not want engineer 2 or 3 on his project. Given the cost figures below for each project-engineer
combination, and keeping in mind that two combinations are undesirable, determine assignments such that total
cost will be minimized.


73. Given the information below, determine the following:
(A) Processing sequence using (1) SPT and (2) EDD.
(B) Average completion time and average job tardiness using (1) SPT and (2) EDD.

74. Using the information below, determine the following:

(A) processing sequence using (1) SPT and (2) EDD rules
(B) average completion time and average job tardiness under each rule

75. Determine the processing sequence for the six jobs shown below using Johnson's Rule. Calculate total
throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much?


76. Use Johnson's Rule to determine the optimum processing sequence for the jobs listed below. Chart total
throughput time.

77. Given the following information concerning jobs awaiting processing at a single work center, what
processing sequence will result if the critical ratio (CR) rule is used?

78. Given the following information concerning jobs awaiting processing at a single work center, what
processing sequence will result if the critical ratio (C/R) rule is used?


The table below contains information about five jobs waiting to be processed at work center number three.

79. The sequence that would result using the SPT rule is:
A. e-b-c-d-a
B. c-a-b-e-d
C. a-d-c-e-b
D. d-e-b-a-c
E. e-d-b-a-c

80. Using the EDD rule, the sequence of jobs would be:
A. d-e-b-a-c
B. a-d-c-b-e
C. e-d-b-a-c

D. a-d-c-e-d
E. e-b-c-d-a

81. After the row reduction, what is the reduced time for assigning resource 4 to Job D?
A. 0 hours
B. 2 hours
C. 3 hours
D. 6 hours
E. 9 hours


82. After the row and column reductions, what is the reduced time for assigning resource 4 to job D?
A. 0 hours
B. 2 hours
C. 3 hours
D. 6 hours
E. 9 hours

83. After the row and column reductions, what is the minimum number of lines needed to cover all of the
zeroes?
A. 0 lines
B. 1 line
C. 2 lines
D. 3 lines
E. 4 lines

84. What is the optimal assignment of resources to jobs?
A. 1 to A; 2 to C; 3 to B; 4 to D
B. 1 to B; 2 to D; 3 to C; 4 to A
C. 1 to C; 2 to B; 3 to A; 4 to D

D. 1 to D; 2 to B; 3 to C; 4 to A
E. 1 to A; 2 to C; 3 to D; 4 to B

85. For the optimal schedule, what is the total number of hours required to complete these jobs?
A. 23 hours
B. 22 hours
C. 21 hours
D. 20 hours
E. 19 hours

The president of a consulting firm wants to minimize the total number of hours it will take to complete four
projects for a new client. Accordingly, she has estimated the time it should take for each of her top consultantsCharlie, Betty, Johnny, and Rick-to complete any of the four projects, as follows:


86. In how many different ways can she assign these consultants to these projects?
A. 4
B. 8
C. 16
D. 24
E. 256

87. After the row and column reductions, what is the reduced time for assigning Rick to project D?
A. 0 hours
B. 8 hours
C. 10 hours
D. 9 hours
E. 22 hours

The president of a consulting firm wants to minimize the total number of hours it will take to complete four
projects for a new client. Accordingly, she has estimated the time it should take for each of her top consultantsCharlie, Betty, Johnny, and Rick-to complete any of the four projects, as follows:

88. What is the optimal assignment of consultants to projects?
A. Charlie to A; Betty to B; Johnny to C; Rick to D
B. Charlie to D; Betty to C; Johnny to B; Rick to A
C. Charlie to C; Betty to A; Johnny to D; Rick to B
D. Charlie to D; Betty to B; Johnny to C; Rick to A
E. Charlie to D; Betty to A; Johnny to C; Rick to B

89. For the optimal schedule, what is the total number of hours it will take these consultants to complete these
projects?
A. 53 hours
B. 46 hours
C. 50 hours
D. 61 hours
E. 54 hours


The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they
were received:

90. If he uses the first come, first served (FCFS) priority rule to schedule these jobs, what will be the average
completion time?
A. 7.5 hours
B. 5 hours
C. 3 hours
D. 2.5 hours
E. 2 hours

91. If he uses the earliest due date first (EDD) priority rule to schedule these jobs, what will be the average job
tardiness?

A. 0 hours
B. 1.5 hours
C. 1.75 hours
D. 2 hours
E. 2.25 hours

92. If he uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the
average completion time?
A. 7.5 hours
B. 5 hours
C. 3 hours
D. 2.5 hours
E. 2 hours

93. If he uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the
average job tardiness?
A. 0 hours
B. 1.5 hours
C. 1.75 hours
D. 2 hours
E. 2.25 hours


94. If he uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the
average number of jobs in his shop today?
A. 0
B. 1
C. 2
D. 3
E. 4

Eva, the owner of Eva's second time around wedding dresses, currently has five dresses to be altered, shown in
order in which they arrived:

95. If Eva uses the first come, first served (FCFS) priority rule to schedule these jobs, what will be the average
completion time?
A. 3 hours
B. 5 hours
C. 7 hours
D. 7.2 hours
E. 8 hours

96. If Eva uses the earliest due date first (EDD) priority rule to schedule these jobs, what will be the average job
tardiness?
A. 2 hours
B. 2.2 hours
C. 2.33 hours
D. 2.4 hours
E. 3 hours

97. If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the
average completion time?
A. 3 hours
B. 5 hours
C. 7 hours
D. 7.2 hours
E. 8 hours


98. If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the

average job tardiness?
A. 2 hours
B. 2.2 hours
C. 2.33 hours
D. 2.4 hours
E. 3 hours

99. If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the
average number of jobs in her shop today?
A. 2 jobs
B. 2.33 jobs
C. 2.4 jobs
D. 2.67 jobs
E. 3 jobs

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to
minimize the throughput time to complete all work on these cars. Each car requires body work prior to painting.
The estimates of the times required to do the body paint work on each are as follows:

100. Where in the optimum sequence should car E be scheduled?
A. first
B. second
C. third
D. fourth
E. fifth

101. Where in the optimum sequence should car A be scheduled?
A. first
B. second
C. third

D. fourth
E. fifth


102. What is the optimum sequence (first car to last)?
A. A; B; C; D; E
B. E; D; C; B; A
C. E; B; D; C; A
D. E; D; B; C; A
E. E; B; D; A; C

103. What is the throughput time for the optimal schedule?
A. 24 hours
B. 25 hours
C. 26 hours
D. 28 hours
E. 50 hours

104. What is the idle time at the paint work center for the optimal schedule?
A. 1 hour
B. 2 hours
C. 4 hours
D. 7 hours
E. 10 hours

105. What is the result of the row reduction?


106. What is the result of the row and column reductions?

107. Can an optimum assignment be made after the row and column reductions?

108. What is the result of modifying the row and column reductions table?

109. Can an optimum assignment be made after the first modification of the row and column reductions table?

110. What is the optimum assignment of jobs to machines?


111. What are the total costs for the optimum assignment of jobs to machines?

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of
arrival):

112. What is the schedule sequence using the first come, first served (FCFS) priority rule?

113. What is the average completion time for the first come, first served (FCFS) priority rule schedule? Average
job tardiness? Average number of jobs at the center?

114. What is the schedule sequence using the earliest due date (EDD) priority rule?


115. What is the average completion time for the earliest due date (EDD) priority rule schedule? Average job
tardiness? Average number of jobs at the center?

116. If jobs A, B, and C require two operations each, while jobs D and E require one operation each, what is the
schedule sequence using the slack per operation (S/O) priority rule?

117. What is the average completion time for the slack per operation (S/O) priority rule schedule? Average job
tardiness? Average number of jobs at the center?

118. What is the schedule sequence using the shortest processing time (SPT) priority rule?

119. What is the average completion time for the shortest processing time (SPT) priority rule? Average job
tardiness? Average number of jobs at the center?


Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed
by machine A, then by Machine B:

120. If these jobs were scheduled in the sequence shown, what would be the throughput time?

121. If these jobs were scheduled in the sequence shown, what would be the idle time at machine B?

122. If these jobs were scheduled in the sequence shown, when would idle time occur at machine B?

123. In developing the sequence which will minimize throughput time, what is the initial job to be placed in the
schedule sequence?