FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 22: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

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} { c c 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}$ 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) A) and E)
G) A) and B)

Correct Answer

verified

Show Answer

Question 22

True/False

Review LaterAdd Note

Review Later

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

A) True
B) False

Correct Answer

verified

Show Answer

Question 23

Multiple Choice

Review LaterAdd Note

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

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

Organizations with fixed, perishable capacity can benefit from:

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: Assume there must be one-to-one matching between consultants and projects. In how many different ways can she assign these consultants to these projects?

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 } & { \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 resulting entry in the new table for assigning resource 4 to job D?

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

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 } & { \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 reduction, what is the resulting entry in the new table for assigning resource 4 to Job D?

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

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: Assume there must be one-to-one matching between consultants and projects. For the optimal schedule, what is the total number of hours it will take these consultants to complete these projects?

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?

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

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

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: Assume there must be one-to-one matching between consultants and projects. After the row and column reductions, what is the resulting entry in the new table for assigning Rick to project D?

A schedule chart depicts the loading and idle times for a group of machines or departments.

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 E be scheduled?

In theory of constraints scheduling, the synchronization of the sequence of operations is referred to as the:

A scheduling rule used for sequencing jobs through two work centers such that makespan is minimized is:

Primary considerations in scheduling high-volume systems involve: