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

Multiple Choice

Review LaterAdd Note

Review Later

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) None of the above
G) C) and E)

Correct Answer

verified

Show Answer

Question 32

Multiple Choice

Review LaterAdd Note

Review Later

Scheduled due dates are the result of:

A) promises to customers
B) MRP processing
C) managerial decisions
D) all of the above
E) our competitor's promises

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

Correct Answer

verified

Show Answer

Question 33

Multiple Choice

Review LaterAdd Note

If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the average number of jobs in her shop today?

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

After the row and column reductions, what is the minimum number of lines needed to cover all of the zeroes?

What is the throughput time for the optimal schedule?

What is the result of the row and column reductions?

After the row reduction, what is the reduced time for assigning resource 4 to Job D?

The sequence that would result using the SPT rule is:

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

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

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

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

If these jobs were scheduled in the sequence shown, what would be the idle time at machine B?

What is the throughput time for the optimum schedule?

Based on the cost information given in the table below, which set of job-machine pairs reflects the minimum-cost solution using the Assignment method?

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

If these jobs were scheduled in the sequence shown, when would idle time occur at machine B?

What are the total costs for the optimum assignment of jobs to machines?

Determine the processing sequence for the six jobs shown below using Johnson's Rule.Calculate total throughput time.Can the makespan be reduced by splitting the latest job? If so, by how much?