FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 16: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 71

Multiple Choice

Review LaterAdd Note

Review Later

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:

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.

F) B) and D)
G) A) and D)

Correct Answer

verified

Show Answer

Question 72

Multiple Choice

Review LaterAdd Note

Review Later

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

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

F) C) and D)
G) A) and B)

Correct Answer

verified

Show Answer

Question 73

Multiple Choice

Review LaterAdd Note

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?

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?

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

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

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: $\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?

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?

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

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

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

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

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?