978-0077835439 Test Bank Chapter 12 Part 1

subject Type Homework Help
subject Pages 9
subject Words 2044
subject Authors M. Johnny Rungtusanatham, Roger Schroeder, Susan Goldstein

Unlock document.

This document is partially blurred.
Unlock all pages and 1 million more documents.
Get Access
page-pf1
Chapter 12 - Scheduling Operations
Chapter 12 Scheduling Operations Answer Key
Multiple-Choice Questions
1. Aggregate planning and scheduling differ in that
2. Scheduling deals with which three conflicting objectives?
3. The overriding problem in batch scheduling is
page-pf2
13-2
4. Given the following information:
Job
Workcenter/
Machine Hours
1
A/3, B/3, C/4
2
B/3, A/1, C/2
3
C/2, B/3, A/3
Use a Gantt chart to schedule the jobs in order 1, 2, 3 and assume that jobs cannot be split.
What is the makespan?
5. Which of the following statements is NOT true about the theory of constraints (TOC)?
page-pf3
Chapter 12 - Scheduling Operations
6. A bottleneck is
7. Scheduling systems answer all the following questions EXCEPT
8. Finite capacity scheduling assumes which of the following?
page-pf4
page-pf5
page-pf6
page-pf7
13-7
18. According to Goldratt,
19. In the language of theory of constraints, inventory is
20. Theory of constraints, as it applies to business systems, is based on which of the following
premises?
page-pf8
Chapter 12 - Scheduling Operations
13-8
21. Which of the following statements concerning scheduling is INCORRECT?
22. Given no constraints, how many possible sequences are there if five jobs are in the queue
for an operation?
23. Output from the Gantt chart drawn for a machining process is shown below. Determine
the makespan of the process.
Job Waiting Time (hr) Delivery Time (hr)
1 0 10
2 10 15
3 1 16
page-pf9
Chapter 12 - Scheduling Operations
24. If the critical ratio for a job is less than 1,
25. Which of the following is INCORRECT about the dispatch rule of shortest processing
time (SPT)?
26. Which of the following statements about batch scheduling is INCORRECT?

Trusted by Thousands of
Students

Here are what students say about us.

Copyright ©2022 All rights reserved. | CoursePaper is not sponsored or endorsed by any college or university.