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
Trang 29 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
Trang 318 A schedule chart can be used to monitor job progress
Trang 427 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
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
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
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
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
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
Trang 852 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
Trang 956 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
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
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 1165 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
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
Trang 12
70 Using the cost information given in the table below, assign work crews to jobs so that total cost is
Trang 1373 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
Trang 1476 Use Johnson's Rule to determine the optimum processing sequence for the jobs listed below Chart total throughput time
Trang 15The table below contains information about five jobs waiting to be processed at work center number three
Trang 1683 After the row and column reductions, what is the minimum number of lines needed to cover all of the zeroes?
Trang 1787 After the row and column reductions, what is the reduced time for assigning Rick to project D?
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
Trang 1890 If he uses the first come, first served (FCFS) priority rule to schedule these jobs, what will be the average completion time?
Trang 19Eva, the owner of Eva's second time around wedding dresses, currently has five dresses to be altered, shown in order in which they arrived:
Trang 2099 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?
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:
Trang 21103 What is the throughput time for the optimal schedule?
Trang 22107 Can an optimum assignment be made after the row and column reductions?
Trang 23Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival):
Trang 24116 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?
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:
Trang 25
120 If these jobs were scheduled in the sequence shown, what would be the throughput time?
Trang 26125 In developing the sequence which will minimize throughput time, where should job X be placed?
Trang 27130 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 28Topic Area: Scheduling Operations
2 Line balancing is a major factor in the design and scheduling of low volume systems because of batch processing
Topic Area: Scheduling Operations
3 Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence
Trang 294 When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas
Topic Area: Scheduling Operations
5 When orders exceed our capacity, priority rules are used to select which orders will be accepted
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 low-volume systems
Topic Area: Scheduling in Low-Volume Systems
7 Loading is the determination of which work centers should perform which jobs
Trang 308 A Gantt chart is a basic scheduling tool but works best for high-volume systems
Topic Area: Scheduling in Low-Volume Systems
9 A Gantt chart is a basic scheduling tool that is most useful in low-volume systems
Topic Area: Scheduling in Low-Volume Systems
10 A schedule chart depicts the loading and idle times for a group of machines or departments
Topic Area: Scheduling in Low-Volume Systems
11 The output of the system cannot exceed the output of the bottleneck operation(s)
Trang 3112 The elimination of idle time on both bottleneck and non-bottleneck operations must be accomplished to optimize output
Topic Area: Scheduling Operations
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
Topic Area: Scheduling Operations
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
Trang 3215 Splitting a large lot after one operation beyond a bottleneck operation would reduce the overall waiting time
of the bottleneck operation
Topic Area: Scheduling Operations
16 Input/output (I/O) control refers to monitoring the productivity changes since productivity is determined by the ratio of Output to Input
Topic Area: Scheduling in Low-Volume Systems
17 Infinite loading and finite loading are two major approaches used to load work centers
Topic Area: Scheduling in Low-Volume Systems
18 A schedule chart can be used to monitor job progress
Trang 3319 The assignment model seeks an optimum matching of tasks and resources
Topic Area: Scheduling in Low-Volume Systems
20 Sequencing is concerned with the order in which jobs are done, while loading is concerned with assigning jobs to work centers or workstations
Topic Area: Scheduling in Low-Volume Systems
21 Priority rules are widely used to sequence jobs in high-volume systems
Topic Area: Scheduling in Low-Volume Systems
22 The assignment method is limited to a maximum of two jobs per resource
Trang 3423 Priority rules generally assume that job setup cost is independent of processing sequence of jobs
Topic Area: Scheduling in Low-Volume Systems
24 In a single work center, makespan improvement can be accomplished by selecting the optimal sequencing rule
Topic Area: Scheduling in Low-Volume Systems
25 Priority rules are used in low-volume systems to identify an optimal processing sequence
Topic Area: Scheduling in Low-Volume Systems
26 The SPT priority rule always results in the lowest average completion time
Trang 3527 Bottlenecks may shift with the passage of time, so that different operations become bottleneck operations at different times
Topic Area: Scheduling Operations
28 If optimal sequencing through three work centers is desired, Johnson's Rule II is used rather than Johnson's Rule
Topic Area: Scheduling in Low-Volume Systems
29 In the decision-making hierarchy, scheduling decisions are the final step in the transformation process before actual output occurs
Trang 3630 Makespan is the total time needed to complete a group of jobs
Topic Area: Scheduling in Low-Volume Systems
31 The theory of constraints has a goal of maximizing flow through the entire system
Topic Area: Scheduling in Low-Volume Systems
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
Topic Area: Scheduling in Low-Volume Systems
33 The SPT rule minimizes idle time for subsequent operations
Trang 3734 Johnson's rule is a technique used to sequence jobs through a two-step work sequence
Topic Area: Scheduling in Low-Volume Systems
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
Topic Area: Scheduling Services
36 Batch process helps maximize worker efficiency
Topic Area: Scheduling Operations
37 Because scheduling is a matter of detailed execution, it has little impact on the operations strategy of an organization
Trang 3838 Scheduling pertains to:
A hiring workers
B process selection
D timing the use of specific resources
E determining the lowest cost
Scheduling involves the timing of the use of specific resources
Topic Area: Scheduling Operations
39 Which of the following is the last step in the capacity/scheduling chain?
Topic Area: Scheduling Operations
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
Aircraft manufacturing is an example of low-volume production
Trang 3941 Which of the following is not usually a characteristic of successful high-volume systems?
B customized output
C rapid repair of breakdowns
D minimal quality problems
E reliable supply schedules
High-volume systems rarely provide customized output
Topic Area: Scheduling Operations
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
Trang 4043 Organizations with fixed, perishable capacity can benefit from _
Topic Area: Scheduling Services
44 A work center can be a _
A machine
B group of machines
C department
D facility
E all of the above
Any of these could be considered a work center
Topic Area: Scheduling in Low-Volume Systems
45 The EDD priority rule usually does well with regard to _
Trang 4146 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
Priority rules do not assume finite loading
Topic Area: Scheduling in Low-Volume Systems
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
E none of the above
These are the two approaches
Topic Area: Scheduling in Low-Volume Systems
48 The priority rule which will sequence jobs in the order they are received is _