Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

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:
 $$\begin{array} { c } 
 \quad\quad\quad{ \text { Process Time (Hours) } } \
\begin{array} { l c c } 
\text { Job } & \text { Center A } & \text { Center B } \
\hline \mathrm { W } & 4 & 5 \
\mathrm { X } & 6 & 6 \
\mathrm { Y } & 1 & 2 \
\mathrm { Z } & 5 & 2
\end{array}\end{array}$$ When does idle time occur at machine B for the optimum schedule?

Accepted Answer

1 hour at the outset

Question 4

In theory of constraints scheduling, the __________ refers to the schedule and the __________ refers to inventory used to ensure that the bottleneck is never idle.

Accepted Answer

A)  rope; drum 
B)  drum; rope 
C)  drum; buffer 
D)  buffer; drum 
E)  buffer; rope 
A)  rope; drum 
B)  drum; rope 
C)  drum; buffer 
D)  buffer; drum 
E)  buffer; rope

Question 5

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

Accepted Answer

A)  smooth workflow through the system 
B)  customized output 
C)  rapid repair of breakdowns 
D)  minimal quality problems 
E)  reliable supply schedules 
A)  smooth workflow through the system 
B)  customized output 
C)  rapid repair of breakdowns 
D)  minimal quality problems 
E)  reliable supply schedules

Question 6

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:
 $$\begin{array} { c } 
 \quad\quad\quad{ \text { Process Time (Hours) } } \
\begin{array} { l c c } 
\text { Job } & \text { Center A } & \text { Center B } \
\hline \mathrm { W } & 4 & 5 \
\mathrm { X } & 6 & 6 \
\mathrm { Y } & 1 & 2 \
\mathrm { Z } & 5 & 2
\end{array}\end{array}$$ In developing the sequence which will minimize throughput time, what is the initial job to be placed in the schedule sequence?

Accepted Answer

The answer of Given the following data for jobs awaiting...

Question 7

The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: $$\begin{array} { l c c } 
\text { Job } & \text { Processing } & \text { Due } \
&\text { Time (hrs) } & \text { (hrs from now) } \
\hline \mathrm { W } & 4 & 4 \
\mathrm { X } & 3 & 5 \
\mathrm { Y } & 2 & 2 \
\mathrm { Z } & 1 & 1
\end{array}$$ If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in his shop today?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  3 
E)  4 
A)  0 
B)  1 
C)  2 
D)  3 
E)  4

Question 8

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 consultants-Charlie, Betty, Johnny, and Rick-to complete any of the four projects, as follows: $$\begin{array} { c } 
\quad \quad \quad \quad \quad { \text { Project (Hours) } } \
\begin{array} { l c c c c } 
\text { Consultant } & \text { A } & \text { B } & \text { C } & \text { D } \
\hline \text { Charlie } & 13 & 16 & 11 & 13 \
\text { Betty } & 11 & 15 & 14 & 18 \
\text { Johnny } & 15 & 22 & 12 & 15 \
\text { Rick } & 17 & 17 & 12 & 22
\end{array}\end{array}$$ In how many different ways can she assign these consultants to these projects?

Accepted Answer

A)  4 
B)  8 
C)  16 
D)  24 
E)  256 
A)  4 
B)  8 
C)  16 
D)  24 
E)  256

Question 9

Based on the cost information given in the following table, which set of job-machine pairs reflects the minimum-cost solution using the Assignment method? $\begin{array}{c} 
\quad\quad\quad\quad\quad{\text { Machine }} \
\begin{array}{rrrr} 
& \text { A } & \text { B } & \text { C } \
\text { Job 1 } & \$ 6 & 0 & 0 \
2 &3 & 6 & 4  \
3 & 2 & 4 & 0
\end{array}\end{array}$

Accepted Answer

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

Question 10

There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: $$\begin{array} { c } 
\quad \quad \quad \quad  { \text { Job (Hours) } } \
\begin{array} { l c c c c } 
\text { Resource } & \mathrm { A } & \mathrm { B } & \mathrm { C } & \mathrm { D } \
\hline 1 & 5 & 8 & 7 & 7 \
2 & 4 & 9 & 5 & 9 \
3 & 6 & 9 & 8 & 7 \
4 & 7 & 6 & 6 & 9
\end{array}\end{array}$$ What is the optimal assignment of resources to jobs?

Accepted Answer

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

Question 11

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival):
 $$\begin{array} { l c c } 
\text { Job } & \begin{array} { c } 
\text { Processing Time } \
( \text { days } )
\end{array} & \begin{array} { c } 
\text { Due Date } \
\text { (days from now) }
\end{array} \
\hline \mathrm { A } & 2 & 2 \
\mathrm {~B} & 5 & 6 \
\mathrm { C } & 6 & 10 \
\mathrm { D } & 3 & 4 \
\mathrm { E } & 4 & 8
\end{array}$$ What is the schedule sequence using the earliest due date priority rule?

Accepted Answer

The answer of Refer to the following data for jobs...

Question 12

A Gantt chart is a basic scheduling tool that works best for high-volume systems.

Accepted Answer

A) True 
 B)False

Question 13

There are three jobs to be done and three resources with which to do them. Each resource will take a specific time to do each job, as shown in the following table:
 $$\begin{array} { l c c c } 
&& { \text { Machine } } \
\text { Job } & \text { A } & \text { B } & \text { C } \
\hline 1 & 6 & 9 & 4 \
2 & 4 & 4 & 3 \
3 & 8 & 7 & 4
\end{array}$$ Can an optimum assignment be made after the row and column reductions?

Accepted Answer

The answer of There are three jobs to be done...

Question 14

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival):
 $$\begin{array} { l c c } 
\text { Job } & \begin{array} { c } 
\text { Processing Time } \
( \text { days } )
\end{array} & \begin{array} { c } 
\text { Due Date } \
\text { (days from now) }
\end{array} \
\hline \mathrm { A } & 2 & 2 \
\mathrm {~B} & 5 & 6 \
\mathrm { C } & 6 & 10 \
\mathrm { D } & 3 & 4 \
\mathrm { E } & 4 & 8
\end{array}$$ What is the schedule sequence using the first come, first served priority rule?

Accepted Answer

The answer of Refer to the following data for jobs...

Question 15

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

Accepted Answer

A) True 
 B)False

Question 16

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: $$\begin{array} { l c c } 
\text { Car } & \begin{array} { c } 
\text { Body Work } \
\text { (hrs) }
\end{array} & \begin{array} { c } 
\text { Paint } \
\text { (hrs) }
\end{array} \
\hline \text { A } & 10 & 2 \
\text { B } & 5 & 4 \
\text { C } & 7 & 5 \
\text { D } & 3 & 6 \
\text { E } & 1 & 7
\end{array}$$ What is the throughput time for the optimal schedule?

Accepted Answer

A)  24 hours 
B)  25 hours 
C)  26 hours 
D)  28 hours 
E)  50 hours 
A)  24 hours 
B)  25 hours 
C)  26 hours 
D)  28 hours 
E)  50 hours

Question 17

Job X arrived at work center Q at noon. At 2 p.m. that same day X was begun. X left work center Q at 3:15 p.m. that same day. X's flow time, in minutes, was:

Accepted Answer

A)  195. 
B)  120. 
C)  75. 
D)  60. 
E)  Cannot be determined. 
A)  195. 
B)  120. 
C)  75. 
D)  60. 
E)  Cannot be determined.

Question 18

Which sequencing rule is designed specifically to minimize job tardiness?

Accepted Answer

A)  S/O 
B)  EDD 
C)  FCFS 
D)  SPT 
E)  LPT 
A)  S/O 
B)  EDD 
C)  FCFS 
D)  SPT 
E)  LPT

Question 19

Using the cost information given in the following table, assign work crews to jobs so that total cost is minimized.
 $\begin{array}{ c}
\quad\quad\quad\text { Job }\
\begin{array}{rcc}
&\mathrm{A} & \mathrm{B} & \mathrm{C} \
\hline\text { Crew }1& \$ 8 & 7 & 4 \
2&9 & 6 & 9 \
3&12 & 5 & 8
\end{array}\end{array}$

Accepted Answer

@#IMG-DLM&_TB2513_00

Question 20

Which of the following is not a measure for judging the effectiveness of a schedule sequence?

Accepted Answer

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)  total number of work centers per job 
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)  total number of work centers per job

Exam 16: Scheduling

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

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

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: Process Time (Hours) Job Center A Center B 4 5 6 6 1 2 5 2 When does idle time occur at machine B for the optimum schedule?

In theory of constraints scheduling, the __________ refers to the schedule and the __________ refers to inventory used to ensure that the bottleneck is never idle.

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

Based on the cost information given in the following table, which set of job-machine pairs reflects the minimum-cost solution using the Assignment method? Machine A B C Job 1 \ 6 0 0 2 3 6 4 3 2 4 0

There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: Job (Hours) Resource 1 5 8 7 7 2 4 9 5 9 3 6 9 8 7 4 7 6 6 9 What is the optimal assignment of resources to jobs?

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): Job Processing Time ( days ) Due Date (days from now) 2 2 5 6 6 10 3 4 4 8 What is the schedule sequence using the earliest due date priority rule?

A Gantt chart is a basic scheduling tool that works best for high-volume systems.

There are three jobs to be done and three resources with which to do them. Each resource will take a specific time to do each job, as shown in the following table: Machine Job A B C 1 6 9 4 2 4 4 3 3 8 7 4 Can an optimum assignment be made after the row and column reductions?

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): Job Processing Time ( days ) Due Date (days from now) 2 2 5 6 6 10 3 4 4 8 What is the schedule sequence using the first come, first served priority rule?

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

Job X arrived at work center Q at noon. At 2 p.m. that same day X was begun. X left work center Q at 3:15 p.m. that same day. X's flow time, in minutes, was:

Which sequencing rule is designed specifically to minimize job tardiness?

Using the cost information given in the following table, assign work crews to jobs so that total cost is minimized. Job Crew 1 \ 8 7 4 2 9 6 9 3 12 5 8

Which of the following is not a measure for judging the effectiveness of a schedule sequence?

Introduction to Operations Management

Competitiveness, Strategy, and Productivity

Forecasting

Product and Service Design

Extension: Reliability

Strategic Capacity Planning for Products and Services

Extension: Decision Theory

Process Selection and Facility Layout

Work Design and Measurement

Extension: Learning Curves

Location Planning and Analysis

Extension: The Transportation Model

Management of Quality

Quality Control

Extension: Acceptance Sampling

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

Jit and Lean Operations

Extension: Maintenance

Supply Chain Management

Project Management

Management of Waiting Lines

Linear Programming

Filters

In theory of constraints scheduling, the refers to the schedule and the refers to inventory used to ensure that the bottleneck is never idle.