FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 16: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 51

Essay

Review LaterAdd Note

Review Later

Using the information in the table, determine the following: (A) Processing sequence using (1) SPT and (2) EDD rules (B) Average completion time and average job tardiness under each rule $\begin{array} { c r r } \text { Job } & \begin{array} { r } \text { Processing } \\\text { Time (days) }\end{array} & \begin{array} { r } \text { Day } \\\text { Due }\end{array} \\\hline \text { A } & 4 & 11 \\\text { B } & 6 & 5 \\\text { C } & 3 & 1 \\\text { D } & 2 & 8 \\\text { E } & 5 & 7\end{array}$

Correct Answer

verified

(A) SPT sequence: D-C-A-E-B; EDD sequenc...

View Answer

Show Answer

Question 52

Multiple Choice

Review LaterAdd Note

Review Later

A scheduling technique used to achieve an optimum, one-to-one matching of tasks and resources is:

A) the assignment method.
B) Johnson's rule.
C) the optimum production technology method.
D) the appointment method.
E) the reservation method.

F) A) and E)
G) A) and D)

Correct Answer

verified

Show Answer

Question 53

True/False

Review LaterAdd Note

Input/output (I/O) control refers to monitoring the productivity changes since productivity is determined by the ratio of output to input.

Which of the following is least likely to be a consideration when scheduling a high-volume system?

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 } \\\hline 1 & 6 & 9 & 4 \\2 & 4 & 4 & 3 \\3 & 8 & 7 & 4\end{array}$ What is the result of modifying the row and column reductions table?

The theory of constraints has a goal of maximizing flow through the entire system.

The following matrix shows relative costs for various job-machine combinations. Which set of pairs constitutes 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 & 0 & 3 & 4 \\3 & 0 & 1 & 2\end{array}\end{array}$

Bottlenecks may shift with the passage of time, so that different operations become bottleneck operations at different times.

One disadvantage of appointment systems is:

The purpose of cyclical scheduling is to:

The term loading, as used in scheduling, refers to choosing the order in which jobs will be processed in low-volume systems.

Similar to that in manufacturing, the service scheduling hierarchy begins with __________ and ends with _________.

Job X, which has a duration of four days, is due by the close of business on Friday, December 23. Without looking at the work already at X's required resource, the scheduler schedules X to be begun immediately and assumes that X will be done four days from now. This is an example of:

For the jobs listed below, which processing sequence would result using Johnson's rule? $\begin{array}{l}\text { Processing time (hrs) }\\\begin{array} { c c c } \hline \text { Job } & \text { Center 1 } & \text { Center 2 } \\\text { a } & 6 & 11 \\\text { b } & 12 & 8 \\\text { c } & 5 & 9 \\\text { d } & 10 & 7\end{array}\end{array}$

A schedule chart can be used to monitor job progress.

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}$ If jobs A, B, and C require two operations each, while jobs D and E require one operation each, what is the schedule sequence using the slack per operation (S/O) priority rule?

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 and column reductions, what is the reduced time for assigning resource 4 to job D?

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

The output of the system cannot exceed the output of the bottleneck operation(s).

A major difference between manufacturing and service systems in terms of scheduling is: