FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 22: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 51

True/False

Review LaterAdd Note

Review Later

Makespan is the total time needed to complete a group of jobs.

A) True
B) False

Correct Answer

verified

Show Answer

Question 52

True/False

Review LaterAdd Note

Review Later

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

A) True
B) False

Correct Answer

verified

Show Answer

Question 53

Multiple Choice

Review LaterAdd Note

The priority rule where jobs are processed according to the smallest ratio of time remaining to due date to processing time is:

Flow-shop scheduling is used in high-volume systems.

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan 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 and paint work on each are as follows: $\begin{array} { c c c } \text { Car } & \begin{array} { c } \text { Body Work } \\\text { (hrs) }\end{array} & \begin{array} { c } \text { Paint } \\\text { (hrs) }\end{array} \\\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?

The following table contains information about five jobs waiting to be processed at work center number three. $\begin{array} { | c r c | } \hline \text { Job } & \begin{array} { r } \text { Processing Time } \\\text { (hrs) }\end{array} & \text { Hours Until Due } \\\text { a } & 14 & 15 \\\text { b } & 10 & 20 \\\text { c } & 18 & 18 \\\text { d } & 2 & 16 \\\text { e } & 4 & 21\end{array}$ Using the EDD rule, the sequence of jobs would be:

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

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

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} { c c c } \text { Job } & \begin{array} { c } \text { Processing Time } \\\text { (hrs) }\end{array} & \begin{array} { c } \text { Due } \\\text { (hrs from now) }\end{array} \\\text { W } & 4 & 4 \\\text { X } & 3 & 5 \\\text { Y } & 2 & 2 \\\text { 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?

There are four resources and four jobs to be done. Assume there must be one-to-one matching between jobs and resources. The time required for each resource to do each job is as follows: $\begin{array} { c c c c c | } \hline &{ \text { Job (Hours) } } \\\text { Resource } & \text { A } & \text { B } & \text { C } & \text { D } \\1 & 5 & 8 & 7 & 7 \\2 & 4 & 9 & 5 & 9 \\3 & 6 & 9 & 8 & 7 \\4 & 7 & 6 & 6 & 9\end{array}$ After the row and column reductions, what is the minimum number of lines needed to cover all of the zeroes?

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} { c c c } \text { Job } & \begin{array} { c } \text { Processing Time } \\\text { (hrs) }\end{array} & \begin{array} { c } \text { Due } \\\text { (hrs from now) }\end{array} \\\text { V } & 3 & 5 \\\text { W } & 1 & 1 \\\text { X } & 4 & 9 \\\text { Y } & 2 & 3 \\\text { Z } & 5 & 7\end{array}$ If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the average completion time?

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.

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:

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} { c c c } \text { Job } & \begin{array} { c } \text { Processing Time } \\\text { (hrs) }\end{array} & \begin{array} { c } \text { Due } \\\text { (hrs from now) }\end{array} \\\text { V } & 3 & 5 \\\text { W } & 1 & 1 \\\text { X } & 4 & 9 \\\text { Y } & 2 & 3 \\\text { Z } & 5 & 7\end{array}$ If Eva uses the first come, first served priority rule to schedule these jobs, what will be the average completion time?

What is the optimum job sequence for the jobs listed below using Johnson's rule? $\begin{array} { c c c } \text { Job } & \begin{array} { c } \text { Processing time (hrs) } \\\text { Center 1 }\end{array} & \text { Center } 2 \\\text { d } & 13 & 23 \\\text { e } & 23 & 13 \\\text { f } & 16 & 18 \\\text { g } & 20 & 17\end{array}$

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan 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 and paint work on each are as follows: What is the optimum sequence (first car to last) ?

One disadvantage of appointment systems is:

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