FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 16: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 61

Multiple Choice

Review LaterAdd Note

Review Later

Scheduled due dates are the result of:

A) promises to customers.
B) MRP processing.
C) managerial decisions.
D) all of the choices.
E) our competitor's promises.

F) A) and B)
G) A) and E)

Correct Answer

verified

Show Answer

Question 62

True/False

Review LaterAdd Note

Review Later

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.

A) True
B) False

Correct Answer

verified

Show Answer

Question 63

Short Answer

Review LaterAdd Note

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 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 optimum sequence (first car to last) ?

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

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 priority rule which will sequence jobs in the order they are received is:

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: $\begin{array} { l c c c } \quad\quad\quad\quad{ \text { Machine } } \\\begin{array} { l c c c } \text { Job } & \text { A } & \text { B } & \text { C } \\\hline 1 & 6 & 9 & 4 \\2 & 4 & 4 & 3 \\3 & 8 & 7 & 4\end{array}\end{array}$ What is the result of the row reduction?

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

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.

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

Scheduling pertains to:

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

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

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?

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 idle time at the paint work center for the optimal schedule?

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

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?

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: