Operations management stevenson 11th edition test bank ch16

AACSB: Reflective Thinking Blooms: Remember Difficulty: Medium Learning Objective: 16-05 Give examples of commonly used priority rules.. AACSB: Reflective Thinking Blooms: Remember Diffi

Trang 2

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

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

Trang 3

18 A schedule chart can be used to monitor job progress

Trang 4

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

Trang 5

36 Batch process helps maximize worker efficiency

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?

E commercial donut baking

41 Which of the following is not usually a characteristic of successful high-volume systems?

Trang 6

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

E all of the above

45 The EDD priority rule usually does well with regard to _

Trang 7

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 _

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?

Trang 8

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?

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?

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

Trang 9

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

Trang 10

61 Which sequencing rule is designed specifically to minimize job tardiness?

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

Trang 11

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 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

Trang 12

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

Trang 13

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?

Trang 14

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

Trang 15

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:

Trang 16

82 After the row and column reductions, what is the reduced time for assigning resource 4 to job D?

Trang 17

86 In how many different ways can she assign these consultants to these projects?

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?

Trang 18

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

90 If he uses the first come, first served (FCFS) priority rule to schedule these jobs, what will be the average completion time?

Trang 19

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?

Trang 20

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

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?

Trang 21

102 What is the optimum sequence (first car to last)?

Trang 22

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?

Trang 23

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? Averagejob tardiness? Average number of jobs at the center?

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

Trang 24

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 theschedule 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?

Trang 25

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?

Trang 26

124 In developing the sequence that will minimize throughput time, where in the schedule sequence should job

W be placed?

125 In developing the sequence which will minimize throughput time, where should job X be placed?

126 What is the sequence which will minimize throughput time?

127 What is the throughput time for the optimum schedule?

128 What is the idle time at machine B for the optimum schedule?

Trang 27

129 When does idle time occur at machine B for the optimum schedule?

130 Job X, which has a duration of four days, is due by the close of business on Friday, December 23 Without looking at the work already scheduled on X's required resource, the scheduler schedules X to be begun on the morning of Tuesday, December 20 This is an example of

Trang 28

134 Which of the following is least likely to be a consideration when scheduling a high-volume system?

Trang 29

ch16 Key

1 "Flow-shop scheduling" is used in high volume systems

TRUE

Flows shops are high volume operations

AACSB: Reflective Thinking

Blooms: Remember

Difficulty: Easy

Learning Objective: 16-02 Describe scheduling needs in high-volume and intermediate-volume systems.

Stevenson - Chapter 16 #1

Topic Area: Scheduling Operations

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

FALSE

Line balancing is used in high volume operations

Blooms: Remember

Difficulty: Easy

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

TRUE

These are the basic issues in scheduling in intermediate-volume systems

Trang 30

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

FALSE

Additional planned idle time would reduce throughput in bottlenecked operations

Blooms: Remember

Difficulty: Easy

Learning Objective: 16-01 Explain what scheduling involves and the importance of good scheduling.

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

FALSE

Priority rules are used to determine the sequence in which orders will be processed

Blooms: Remember

Difficulty: Medium

Learning Objective: 16-05 Give examples of commonly used priority rules.

Topic Area: Scheduling in Low-Volume Systems

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

low-FALSE

Loading refers to which jobs will be assigned to which resources or blocks of time

Trang 31

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

TRUE

Loading refers to which jobs will be assigned to which resources or blocks of time

Blooms: Remember

Difficulty: Easy

Learning Objective: 16-04 Use and interpret Gantt charts; and use the assignment method for loading.

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

FALSE

A Gantt chart works best for low volume systems

Blooms: Remember

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

TRUE

A Gantt chart is most useful in low-volume systems

Blooms: Remember

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

FALSE

A schedule chart depicts the progress of jobs

Trang 32

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

TRUE

The bottleneck limits the system's potential output

Blooms: Remember

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

FALSE

Eliminating idle time on non-bottleneck operations might actually decrease output

Blooms: Remember

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

Idle time in non-bottleneck operations doesn't necessarily affect system productivity

Trang 33

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

FALSE

At a bottleneck smaller batches likely would reduce utilization

Blooms: Remember

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

of the bottleneck operation

FALSE

This would have no effect on the waiting time of the bottleneck operation

Blooms: Remember

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

FALSE

I/O control refers to monitoring output and waiting times at work centers

Trang 34

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

TRUE

These are the two major loading approaches

Blooms: Remember

Difficulty: Easy

Learning Objective: 16-03 Describe scheduling needs in job shops.

18 A schedule chart can be used to monitor job progress

TRUE

A schedule chart monitors job progress

Blooms: Remember

Difficulty: Easy

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

TRUE

Matching jobs with resources can be done with the assignment model

Trang 35

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

Sequencing concerns order, loading concerns assignment

Blooms: Remember

Difficulty: Easy

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

FALSE

Priority rules are used in low-volume systems

Blooms: Remember

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

FALSE

There are no such limits in the use of the assignment method

Trang 36

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

TRUE

If setup cost isn't sequence-independent, certain assignment rules might not perform as anticipated

Blooms: Remember

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

FALSE

Makespan remains constant regardless of the sequencing rule in this situation

Blooms: Remember

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

FALSE

What is optimal depends on what facet of performance is critical in low-volume systems

Trang 37

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

TRUE

SPT minimizes average flow time

Blooms: Remember

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

TRUE

As systems become more balanced, bottlenecks can shift across operations

Blooms: Remember

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

FALSE

No simple rule is available for optimal scheduling across more than two work centers

Trang 38

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

TRUE

Scheduling is the last phase of the coordination-and-control hierarchy

Blooms: Remember

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

TRUE

It is the sum of processing times plus any wait times that might be necessary

Blooms: Remember

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

TRUE

The theory of constraints is focused on maximizing throughput

Trang 39

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

FALSE

SPT's disadvantage is that very long jobs might wait much longer than is appropriate

Blooms: Remember

Difficulty: Easy

33 The SPT rule minimizes idle time for subsequent operations

TRUE

Because it minimizes average flow time, downstream operations are less likely to be starved

Blooms: Remember

Difficulty: Hard

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

TRUE

Johnson's rule is for two work centers

Trang 40

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

FALSE

Services tend to experience less uniform demand

Topic Area: Scheduling Services

36 Batch process helps maximize worker efficiency

TRUE

Setup times can be economized on in a batch process

Blooms: Remember

Learning Objective: 16-03 Describe scheduling needs in job shops.

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

FALSE

Scheduling has significant strategic aspects

Định dạng
Số trang	85
Dung lượng	0,94 MB