FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 16: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

Multiple Choice

Review LaterAdd Note

Review Later

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 throughput time for the optimal schedule?

A) 24 hours
B) 25 hours
C) 26 hours
D) 28 hours
E) 50 hours

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

Correct Answer

verified

Show Answer

Question 22

Multiple Choice

Review LaterAdd Note

Review Later

Which sequencing rule is designed specifically to minimize job tardiness?

A) S/O
B) EDD
C) FCFS
D) SPT
E) LPT

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

Correct Answer

verified

Show Answer

Question 23

Essay

Review LaterAdd Note

Using the cost information given in the following table, assign work crews to jobs so that total cost is minimized. $\begin{array}{ c}\quad\quad\quad\text { Job }\\\begin{array}{rcc}&\mathrm{A} & \mathrm{B} & \mathrm{C} \\\hline\text { Crew }1& \$ 8 & 7 & 4 \\2&9 & 6 & 9 \\3&12 & 5 & 8\end{array}\end{array}$

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 which will minimize throughput time, what is the initial job to be placed in the schedule sequence?

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 } && { \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}$ Can an optimum assignment be made after the row and column reductions?

The SPT priority rule always results in the lowest average completion time.

Which of the following is not a measure for judging the effectiveness of a schedule sequence?

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 schedule sequence using the earliest due date priority rule?

A Gantt chart is a basic scheduling tool that works best for high-volume systems.

Loading is the determination of which work centers should perform which jobs.

Based on the cost information given in the following table, which set of job-machine pairs reflects 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 &3 & 6 & 4 \\3 & 2 & 4 & 0\end{array}\end{array}$

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}$ When does idle time occur at machine B for the optimum schedule?

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}$ What is the optimal assignment of resources to jobs?

Which of the following is not usually a characteristic of successful high-volume systems?

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 number of jobs in his shop today?

Job X arrived at work center Q at noon. At 2 p.m. that same day X was begun. X left work center Q at 3:15 p.m. that same day. X's flow time, in minutes, was:

When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas.

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 schedule sequence using the first come, first served priority rule?

In theory of constraints scheduling, the __________ refers to the schedule and the __________ refers to inventory used to ensure that the bottleneck is never idle.

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}$ In how many different ways can she assign these consultants to these projects?