Question 1

Which of the following is not an assumption of priority rules?

Accepted Answer

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

Question 2

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}$$ For the optimal schedule, what is the total number of hours it will take these consultants to complete these projects?

Accepted Answer

A)  53 hours 
B)  46 hours 
C)  50 hours 
D)  61 hours 
E)  54 hours 
A)  53 hours 
B)  46 hours 
C)  50 hours 
D)  61 hours 
E)  54 hours

Question 3

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 4

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}$$ What is the throughput time for the optimum schedule?

Accepted Answer

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

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

In an assignment model where there are fewer jobs than resources:

Accepted Answer

A)  dummy jobs are needed to solve the problem. 
B)  dummy resources are needed to solve the problem. 
C)  the problem cannot 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. 
A)  dummy jobs are needed to solve the problem. 
B)  dummy resources are needed to solve the problem. 
C)  the problem cannot 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.

Question 7

The following table contains information about five jobs waiting to be processed at work center number three. $$\begin{array} { l c c } 
\text { Job } & \begin{array} { c } 
\text { Processing } \
\text { Time (hrs) }
\end{array} & \begin{array} { c } 
\text { Hours Until } \
\text { Due }
\end{array} \
\hline \mathrm { a } & 14 & 15 \
\mathrm {~b} & 10 & 20 \
\mathrm { c } & 18 & 18 \
\mathrm {~d} & 2 & 16 \
\mathrm { e } & 4 & 21
\end{array}$$ The sequence that would result using the SPT rule is:

Accepted Answer

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

Question 8

What is the optimum job sequence for the jobs listed below using Johnson's rule? $$\begin{array}{l}
\text { Processing time (hrs) }\
\begin{array} { c c c } 
\text { Job } & \text { Center 1 } & \text { Center 2 } \
\hline \mathrm { d } & 13 & 23 \
\mathrm { e } & 23 & 13 \
\mathrm { f } & 16 & 18 \
\mathrm {~g} & 20 & 17
\end{array}
\end{array}$$

Accepted Answer

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

Question 9

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} { l c c } 
\text { Job } & \begin{array} { c } 
\text { Processing } \
\text { Time (hrs) }
\end{array} & \begin{array} { c } 
\text { Due } \
\text { (hrs from now) }
\end{array} \
\hline \mathrm { V } & 3 & 5 \
\mathrm {~W} & 1 & 1 \
\mathrm { X } & 4 & 9 \
\mathrm { Y } & 2 & 3 \
\mathrm { Z } & 5 & 7
\end{array}$$ If Eva uses the earliest due date first (EDD) priority rule to schedule these jobs, what will be the average job tardiness?

Accepted Answer

A)  2 hours 
B)  2.2 hours 
C)  2.33 hours 
D)  2.4 hours 
E)  3 hours 
A)  2 hours 
B)  2.2 hours 
C)  2.33 hours 
D)  2.4 hours 
E)  3 hours

Question 10

Scheduling in service systems often takes the form of:
(I) appointment systems.
(II) reservation systems.
(III) makespan systems.

Accepted Answer

A)  I only 
B)  II only 
C)  I and II only 
D)  III only 
E)  I, II, and III 
A)  I only 
B)  II only 
C)  I and II only 
D)  III only 
E)  I, II, and III

Question 11

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 that will minimize throughput time, where in the schedule sequence should job W be placed?

Accepted Answer

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

Question 12

In a task assignment situation, in how many different ways can five jobs be assigned to five machines?

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 13

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}$$ What is the sequence which will minimize throughput time?

Accepted Answer

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

Question 14

Which of the following is the last step in the capacity/scheduling chain?

Accepted Answer

A)  product planning 
B)  process planning 
C)  capacity planning 
D)  aggregate planning 
E)  scheduling 
A)  product planning 
B)  process planning 
C)  capacity planning 
D)  aggregate planning 
E)  scheduling

Which of the following is not an assumption of priority rules?

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

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 What is the throughput time for the optimum schedule?

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

In an assignment model where there are fewer jobs than resources:

The following table contains information about five jobs waiting to be processed at work center number three. Job Processing Time (hrs) Hours Until Due 14 15 10 20 18 18 2 16 4 21 The sequence that would result using the SPT rule is:

What is the optimum job sequence for the jobs listed below using Johnson's rule? Processing time (hrs) Job Center 1 Center 2 13 23 23 13 16 18 20 17

Scheduling in service systems often takes the form of: (I) appointment systems. (II) reservation systems. (III) makespan systems.

In a task assignment situation, in how many different ways can five jobs be assigned to five machines?

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 What is the sequence which will minimize throughput time?

Which of the following is the last step in the capacity/scheduling chain?

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

Exam 16: Scheduling

Which of the following is not an assumption of priority rules?

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

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 What is the throughput time for the optimum schedule?

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

In an assignment model where there are fewer jobs than resources:

The following table contains information about five jobs waiting to be processed at work center number three. Job Processing Time (hrs) Hours Until Due 14 15 10 20 18 18 2 16 4 21 The sequence that would result using the SPT rule is:

What is the optimum job sequence for the jobs listed below using Johnson's rule? Processing time (hrs) Job Center 1 Center 2 13 23 23 13 16 18 20 17

Scheduling in service systems often takes the form of: (I) appointment systems. (II) reservation systems. (III) makespan systems.

In a task assignment situation, in how many different ways can five jobs be assigned to five machines?

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 What is the sequence which will minimize throughput time?

Which of the following is the last step in the capacity/scheduling chain?

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