Question 1

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

Accepted Answer

A)  aggregate planning 
B)  materials planning 
C)  master scheduling 
D)  detailed, short-term scheduling 
E)  detailed, short-term planning 
A)  aggregate planning 
B)  materials planning 
C)  master scheduling 
D)  detailed, short-term scheduling 
E)  detailed, short-term planning

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

Ensuring that the constraining resource is used to its maximum is an example of constraint:

Accepted Answer

A)  elevation. 
B)  subordination. 
C)  identification. 
D)  elimination. 
E)  exploitation. 
A)  elevation. 
B)  subordination. 
C)  identification. 
D)  elimination. 
E)  exploitation.

Question 4

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} { c c c } 
\text { Job } & \begin{array} { c } 
\text { Processing Time } \
\text { (hrs) }
\end{array} & \begin{array} { c } 
\text { Due } \
\text { (hrs from now) }
\end{array} \
\text { W } & 4 & 4 \
\text { X } & 3 & 5 \
\text { Y } & 2 & 2 \
\text { Z } & 1 & 1
\end{array}$$
If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness?

Accepted Answer

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

Question 5

Eva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: $$\begin{array} { c c c } 
\hline \text { Job } & \begin{array} { c } 
\text { Processing Time } \
\text { (hrs) }
\end{array} & \begin{array} { c } 
\text { Due } \
\text { (hrs from now) }
\end{array} \
\text { V } & 3 & 5 \
\text { W } & 1 & 1 \
\text { X } & 4 & 9 \
\text { Y } & 2 & 3 \
\text { Z } & 5 & 7
\end{array}$$
If Eva uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in her shop today?

Accepted Answer

A)  2 jobs 
B)  2.33 jobs 
C)  2.4 jobs 
D)  2.67 jobs 
E)  3 jobs 
A)  2 jobs 
B)  2.33 jobs 
C)  2.4 jobs 
D)  2.67 jobs 
E)  3 jobs

Question 6

There are four resources and four jobs to be done. Assume there must be one-to-one matching between jobs and resources. The time required for each resource to do each job is as follows: $$\begin{array} { c c c c c } 
&  { \text { Job (Hours) } } \
\text { Resource } & \text { A } & \text { B } & \text { C } & \text { D } \
1 & 5 & 8 & 7 & 7 \
2 & 4 & 9 & 5 & 9 \
3 & 6 & 9 & 8 & 7 \
4 & 7 & 6 & 6 & 9
\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 7

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 8

Average completion (flow) time for a schedule sequence at a work center is:

Accepted Answer

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

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

The scheduling sequencing rule which always results in the lowest average completion (flow) time is the:

Accepted Answer

A)  first come, first served (FCFS) rule. 
B)  shortest processing time first (SPT) rulE. 
C)  earliest due date first (ED
D)  rule. 
D)  least slack per operation first (S/O) rule. 
E)  run until slack happens (RUSH) rule. 
A)  first come, first served (FCFS) rule. 
B)  shortest processing time first (SPT) rulE. 
C)  earliest due date first (ED
D)  rule. 
D)  least slack per operation first (S/O) rule. 
E)  run until slack happens (RUSH) rule.

Question 11

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} { c c c } 
\hline \text { Job } & \begin{array} { c } 
\text { Processing Time } \
\text { (hrs) }
\end{array} & \begin{array} { c } 
\text { Due } \
\text { (hrs from now) }
\end{array} \
\text { W } & 4 & 4 \
\text { X } & 3 & 5 \
\text { Y } & 2 & 2 \
\text { Z } & 1 & 1
\end{array}$$
If he uses the first come, first served priority rule to schedule these jobs, what will be the average completion time?

Accepted Answer

A)  7.5 hours 
B)  5 hours 
C)  3 hours 
D)  2.5 hours 
E)  2 hours 
A)  7.5 hours 
B)  5 hours 
C)  3 hours 
D)  2.5 hours 
E)  2 hours

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

In a task assignment situation, in how many different ways can five jobs be assigned to five machines if each job must be assigned to each machine and each machine must be assigned one job?

Accepted Answer

A)  1 
B)  5 
C)  25 
D)  120 
E)  3,125 
A)  1 
B)  5 
C)  25 
D)  120 
E)  3,125

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan 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 and paint work on each are as follows:  
What is the makespan 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 16

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 17

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

Accepted Answer

A) True 
 B)False

Question 18

Which of the following is not an example of a high-volume system?

Accepted Answer

A)  aircraft manufacturing 
B)  magazine printing 
C)  petroleum refining 
D)  waste treatment 
E)  commercial donut baking 
A)  aircraft manufacturing 
B)  magazine printing 
C)  petroleum refining 
D)  waste treatment 
E)  commercial donut baking

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A) True 
 B)False

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

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

Ensuring that the constraining resource is used to its maximum is an example of constraint:

Which sequencing rule is designed specifically to minimize job tardiness?

Average completion (flow) time for a schedule sequence at a work center is:

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

The scheduling sequencing rule which always results in the lowest average completion (flow) time is the:

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

In a task assignment situation, in how many different ways can five jobs be assigned to five machines if each job must be assigned to each machine and each machine must be assigned one job?

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

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:

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

Which of the following is not an example of a high-volume system?

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

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

Introduction to Operations Management

Competitiveness

Forecasting

Product and Service Design

RELIABILITY – Static

Strategic Capacity Planning for Products and Services

Decision Theory– Static

Process Selection and Facility Layout

Work Design and Measurement

learning curve– Static

Location Planning and Analysis

The Transportation Model– Static

Management of Quality

Quality Control

Acceptance Sampling– Static

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

JIT and Lean Operations

Maintenance– Static

Supply Chain Management

Project Management

Management of Waiting Lines

Linear Programming

Filters

Exam 22: Scheduling

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

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

Ensuring that the constraining resource is used to its maximum is an example of constraint:

Which sequencing rule is designed specifically to minimize job tardiness?

Average completion (flow) time for a schedule sequence at a work center is:

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

The scheduling sequencing rule which always results in the lowest average completion (flow) time is the:

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

In a task assignment situation, in how many different ways can five jobs be assigned to five machines if each job must be assigned to each machine and each machine must be assigned one job?

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

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:

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

Which of the following is not an example of a high-volume system?

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

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

Introduction to Operations Management

Competitiveness

Forecasting

Product and Service Design

RELIABILITY – Static

Strategic Capacity Planning for Products and Services

Decision Theory– Static

Process Selection and Facility Layout

Work Design and Measurement

learning curve– Static

Location Planning and Analysis

The Transportation Model– Static

Management of Quality

Quality Control

Acceptance Sampling– Static

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

JIT and Lean Operations

Maintenance– Static

Supply Chain Management

Project Management

Management of Waiting Lines

Linear Programming

Filters