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 completion time?

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

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}\] After the row reduction, what is the reduced time for assigning resource 4 to Job D?

A) 0 hours B) 2 hours C) 3 hours D) 6 hours E) 9 hours A) 0 hours B) 2 hours C) 3 hours D) 6 hours E) 9 hours

There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount 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 } \\ \hline1 & \$ 6 & 9 & 4 \\ 2 & 4 & 4 & 3 \\ 3 & 8 & 7 & 4 \end{array}\] Can an optimum assignment be made after the first modification of the row and column reductions table?

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

Given the following information concerning jobs awaiting processing at a single work center, what processing sequence will result if the critical ratio rule is used? \[\begin{array} { l c c c } \text { Job } & \begin{array} { c } \text { Process Time } \\ \text { At This } \\ \text { Operation (hrs) } \end{array} & \begin{array} { c } \text { Process Time } \\ \text { At Remaining } \\ \text { Operations (hrs) } \end{array} & \begin{array} { c } \text { Final Due } \\ \text { Date (hrs) } \end{array} \\ \hline \text { G } & 4 & 4 & 9 \\ \text { H } & 8 & 6 & 38 \\ \text { I } & 6 & 10 & 24 \\ \text { J } & 3 & 8 & 20 \\ \text { L } & 5 & 14 & 32 \end{array}\]

The sequence will be G - I - J - L - H.

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 idle time at machine B for the optimum schedule?

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

The following table contains information about five jobs waiting to be processed at work center number three. \[\begin{array} { c 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}\] Using the EDD rule, the sequence of jobs would be:

A) d-e-b-a-c. B) a-d-c-b-e. C) e-d-b-a-c. D) a-d-c-e-d. E) e-b-c-d-a. A) d-e-b-a-c. B) a-d-c-b-e. C) e-d-b-a-c. D) a-d-c-e-d. E) e-b-c-d-a.

Exam 16: Scheduling

The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: Job Processing Due Time (hrs) (hrs from now) 4 4 3 5 2 2 1 1 If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average completion time?

(Multiple Choice)

4.8/5

(82)

Question 101

Scheduling pertains to:

(Multiple Choice)

4.8/5

(72)

Question 102

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

(True/False)

4.9/5

(94)

Question 103

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 After the row reduction, what is the reduced time for assigning resource 4 to Job D?

(Multiple Choice)

4.7/5

(85)

Question 104

There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount 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 first modification of the row and column reductions table?

(Short Answer)

4.9/5

(88)

Question 105

In theory of constraints scheduling, the synchronization of the sequence of operations is referred to as the:

(Multiple Choice)

4.9/5

(87)

Question 106

The priority rule which will sequence jobs in the order they are received is:

(Multiple Choice)

4.9/5

(90)

Question 107

A scheduling rule used for sequencing jobs through two work centers is:

(Multiple Choice)

4.9/5

(83)

Question 108

Given the following information concerning jobs awaiting processing at a single work center, what processing sequence will result if the critical ratio rule is used? Job Process Time At This Operation (hrs) Process Time At Remaining Operations (hrs) Final Due Date (hrs) G 4 4 9 H 8 6 38 I 6 10 24 J 3 8 20 L 5 14 32

(Essay)

4.8/5

(86)

Question 109

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

(True/False)

4.8/5

(76)

Question 110

Scheduled due dates are the result of:

(Multiple Choice)

4.8/5

(68)

Question 111

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.

(True/False)

4.7/5

(77)

Question 112

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: Car Body Work (hrs) Paint (hrs) A 10 2 B 5 4 C 7 5 D 3 6 E 1 7 What is the idle time at the paint work center for the optimal schedule?

(Multiple Choice)

4.9/5

(83)

Question 113

Effective scheduling cannot:

(Multiple Choice)

4.9/5

(78)

Question 114

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: Car Body Work (hrs) Paint (hrs) A 10 2 B 5 4 C 7 5 D 3 6 E 1 7 What is the optimum sequence (first car to last)?

(Multiple Choice)

4.9/5

(84)

Question 115

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 What is the result of the row reduction?

(Essay)

4.9/5

(79)

Question 116

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.

(Multiple Choice)

4.9/5

(74)

Question 117

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 idle time at machine B for the optimum schedule?

(Short Answer)

4.7/5

(90)

Question 118

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/False)

4.9/5

(78)

Question 119

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 Using the EDD rule, the sequence of jobs would be:

(Multiple Choice)

4.8/5

(73)

Question 120

Scheduling pertains to:

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

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 After the row reduction, what is the reduced time for assigning resource 4 to Job D?

In theory of constraints scheduling, the synchronization of the sequence of operations is referred to as the:

The priority rule which will sequence jobs in the order they are received is:

A scheduling rule used for sequencing jobs through two work centers is:

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

Scheduled due dates are the result of:

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.

Effective scheduling cannot:

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 What is the result of the row reduction?

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.

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 idle time at machine B for the optimum schedule?

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

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 Using the EDD rule, the sequence of jobs would be:

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