FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 16: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 31

True/False

Review LaterAdd Note

Review Later

If optimal sequencing through three work centers is desired, Johnson's rule II is used rather than Johnson's rule.

A) True
B) False

Correct Answer

verified

Show Answer

Question 32

Essay

Review LaterAdd Note

Review Later

A manager must assign four engineers to projects, one to a project. The leader of project C has indicated that he does not want engineer 2 or 3 on his project. Given the following cost figures for each project-engineer combination, and keeping in mind that two combinations are undesirable, determine assignments such that total cost will be minimized. $\begin{array}{rrrrr} & \mathrm{A} & \mathrm{B} & \mathrm{C} & \mathrm{D} \\\hline \text { Engineer }1 & \$ 18 & 12 & 20 & 19 \\2 & 17 & 18 & * & 10 \\3 & 25 & 28 & * & 14 \\4 & 28 & 18 & 24 & 25\end{array}$ $\text { *undesirable }$

Correct Answer

verified

_TB2513_00...

View Answer

Show Answer

Question 33

True/False

Review LaterAdd Note

Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.

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 \mathrm{P} & 6 & 4 & 8 \\\mathrm{Q} & 10 & 15 & 40 \\\mathrm{R} & 5 & 10 & 30 \\\mathrm{~S} & 8 & 12 & 45 \\\mathrm{~T} & 6 & 8 & 24\end{array}$

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 shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in her shop today?

A Gantt chart is a basic scheduling tool that is most useful in low-volume systems.

The EDD priority rule usually does well with regard to:

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

Determine the processing sequence for the six jobs shown in the following table using Johnson's rule. Calculate total throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much? $\begin{array}{ccc} & \text { Processing Time (hrs) } \\\text { Job } & \text { ST1 } & \text { ST2 } \\\hline \text { a } & 4 & 6 \\\text { b } & 9 & 8 \\\text { c } & 10 & 5 \\\text { d } & 6 & 9 \\\text { e } & 9 & 7 \\\text { f } & 12 & 10\end{array}$

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}$ What is the average completion time for the earliest due date priority rule schedule? Average job tardiness? Average number of jobs at the center?

To facilitate utilization of bottleneck operations, in theory of constraints scheduling ________ can be split into __________ to reduce waiting times.

A work center can be a: (I) machine. (II) group of machines. (III) department. (IV) facility.

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 shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness?

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}$ Where in the optimum sequence should car A be scheduled?

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}$ What is the average completion time for the shortest processing time priority rule? Average job tardiness? Average number of jobs at the center?

The assignment method is limited to a maximum of two jobs per resource.

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 total cost for the optimum assignment of jobs to machines?

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 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}$ If these jobs were scheduled in the sequence shown, when would idle time occur at machine B?

Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time. $\begin{array} { c c c } &{ \text { Processing Time (mins) } } \\\text { Job } & \text { ST1 } & \text { ST2 } \\\hline \text { A } & 20 & 12 \\\text { B } & 10 & 32 \\\text { C } & 8 & 9 \\\text { D } & 14 & 7 \\\text { E } & 5 & 6 \\\text { F } & 18 & 6\end{array}$