FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 22: Scheduling

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 31

Multiple Choice

Review LaterAdd Note

Review Later

Scheduling in service systems may involve scheduling: (I) the workforce. (II) the equipment. (III) customers.

A) II only
B) I and II only
C) II and III only
D) I and III only
E) I, II, and III

F) C) and D)
G) D) and E)

Correct Answer

verified

Show Answer

Question 32

Multiple Choice

Review LaterAdd Note

Review Later

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: If Eva uses the earliest due date first (EDD) priority rule to schedule these jobs, what will be the average job tardiness?

A) 2 hours
B) 2.2 hours
C) 2.33 hours
D) 2.4 hours
E) 3 hours

F) A) and E)
G) A) and D)

Correct Answer

verified

Show Answer

Question 33

True/False

Review LaterAdd Note

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

Sequencing is concerned with the order in which jobs are done, while loading is concerned with assigning jobs to work centers or workstations.

Scheduled due dates are the result of:

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

Bottlenecks in service systems may shift with the passage of time, so that different operations become bottleneck operations at different times.

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

The priority rule which will sequence jobs in the order they are received is:

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 scheduled on X's required resource, the scheduler schedules X to be begun on the morning of Tuesday, December 20. This is an example of:

The elimination of idle time on both bottleneck and non-bottleneck operations must be accomplished to optimize output.

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 } \hline \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 earliest due date first priority rule to schedule these jobs, what will be the average job tardiness?

Splitting a large lot after one operation beyond a bottleneck operation would reduce the overall waiting time of the bottleneck operation.

In the decision-making hierarchy, scheduling decisions are the final step in the transformation process before actual output occurs.

The output of the system cannot exceed the output of the bottleneck operation(s).

For the jobs listed below, which processing sequence would result using Johnson's rule?

The two different approaches to load work centers in job-shop scheduling are:

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

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}$ For the optimal schedule, what is the total number of hours required to complete these jobs?

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