Question 1

If the following jobs are sequenced according to the DDATE rule,then the mean tardiness (in days)for all jobs is (assume zero for today's date)

Accepted Answer

A) 9.0 days. 
B) 5.4 days. 
C) 3.2 days. 
D) 2.8 days 
A) 9.0 days. 
B) 5.4 days. 
C) 3.2 days. 
D) 2.8 days B

Question 2

Scheduling using the theory of constraints (TOC)requires that process batch sizes and transfer batch sizes always match.

Accepted Answer

A) True 
 B)False  False

Question 3

The shortest processing time (SPT)rule is most useful when the job shop is not congested.

Accepted Answer

A) True 
 B)False  False

Question 4

If the following jobs are sequenced according to the SPT rule,then job B is completed on day (assume zero for today's date)

Accepted Answer

A) 6. 
B) 14. 
C) 15. 
D) 22. 
A) 6. 
B) 14. 
C) 15. 
D) 22.

Question 5

Scheduling specifies when labour,equipment and facilities are needed to produce a product.

Accepted Answer

A) True 
 B)False

Question 6

The theory of constraints (TOC)approach to scheduling concentrates on scheduling the bottleneck resources.

Accepted Answer

A) True 
 B)False

Question 7

If the following jobs are sequenced according to the DDATE rule,then the maximum job tardiness (in days)is (assume zero for today's date)

Accepted Answer

A) 12 days. 
B) 15 days. 
C) 16 days. 
D) 27 days. 
A) 12 days. 
B) 15 days. 
C) 16 days. 
D) 27 days.

Question 8

Job-shop scheduling is usually performed by skilled machine operators.

Accepted Answer

A) True 
 B)False

Question 9

Four products (1,2,3,and 4)must be processed on one of four machines (A,B,C,and D).The times required in minutes for each product on each machine are shown below:   If management assigns products to machines so that the total time to complete all jobs is minimized,then the time to complete Product 1 is

Accepted Answer

A) 10 minutes. 
B) 9 minutes. 
C) 16 minutes. 
D) 12 minutes 
A) 10 minutes. 
B) 9 minutes. 
C) 16 minutes. 
D) 12 minutes

Question 10

If the following jobs are sequenced according to the LPT rule,then the maximum job tardiness (in days)is (assume zero for today's date)

Accepted Answer

A) 7 days. 
B) 10 days. 
C) 20 days. 
D) 25 days. 
A) 7 days. 
B) 10 days. 
C) 20 days. 
D) 25 days.

Question 11

The following set of jobs must be processed serially through a two-step system.The times at each process are in hours.If Johnson's Rule is used to sequence the jobs then the makespan time (in hours)for all jobs is

Accepted Answer

A) 42 hours. 
B) 53 hours. 
C) 90 hours. 
D) 95 hours. 
A) 42 hours. 
B) 53 hours. 
C) 90 hours. 
D) 95 hours.

Question 12

If the following jobs are sequenced according to the DDATE rule,then job A would be completed on day (assume zero for today's date)

Accepted Answer

A) 8. 
B) 12. 
C) 16. 
D) 22. 
A) 8. 
B) 12. 
C) 16. 
D) 22.

Question 13

The scheduling rule that minimizes the makespan time for a set of jobs that must be processed through a two-step system where every job follows the same sequence through the two processes is

Accepted Answer

A) the shortest processing time (SPT). 
B) Johnson's Rule. 
C) the assignment method. 
D) the minimal slack rule. 
A) the shortest processing time (SPT). 
B) Johnson's Rule. 
C) the assignment method. 
D) the minimal slack rule.

Question 14

The sequence in which jobs should be processed is determined using linear programming.

Accepted Answer

A) True 
 B)False

Question 15

Typically,there are more options available when scheduling employees because labour is a very flexible resource.

Accepted Answer

A) True 
 B)False

Question 16

If the following jobs are sequenced according to the SLACK rule,then the mean tardiness (in days)for all jobs is (assume zero for today's date)

Accepted Answer

A) 11.25 days. 
B) 9 days. 
C) 20 days. 
D) 12.5 days. 
A) 11.25 days. 
B) 9 days. 
C) 20 days. 
D) 12.5 days.

Question 17

If a job is ahead of schedule,then its critical ratio (CR)will be

Accepted Answer

A) less than one. 
B) greater than one. 
C) equal to one. 
D) none of the above. 
A) less than one. 
B) greater than one. 
C) equal to one. 
D) none of the above.

Question 18

If the following jobs are sequenced according to the SPT rule,then the mean tardiness (in days)for all jobs is (assume zero for today's date)

Accepted Answer

A) 16 days. 
B) 13 days. 
C) 5.2 days. 
D) 3.2 days. 
A) 16 days. 
B) 13 days. 
C) 5.2 days. 
D) 3.2 days.

Question 19

Gantt charts show the planned and yet to be completed activities against total activities.

Accepted Answer

A) True 
 B)False

Question 20

Minimizing overtime is one of several objectives that could be considered when constructing a schedule.

Accepted Answer

A) True 
 B)False

Exam 22: Scheduling

If the following jobs are sequenced according to the DDATE rule,then the mean tardiness (in days)for all jobs is (assume zero for today's date)

Scheduling using the theory of constraints (TOC)requires that process batch sizes and transfer batch sizes always match.

The shortest processing time (SPT)rule is most useful when the job shop is not congested.

If the following jobs are sequenced according to the SPT rule,then job B is completed on day (assume zero for today's date)

Scheduling specifies when labour,equipment and facilities are needed to produce a product.

The theory of constraints (TOC)approach to scheduling concentrates on scheduling the bottleneck resources.

If the following jobs are sequenced according to the DDATE rule,then the maximum job tardiness (in days)is (assume zero for today's date)

Job-shop scheduling is usually performed by skilled machine operators.

If the following jobs are sequenced according to the LPT rule,then the maximum job tardiness (in days)is (assume zero for today's date)

The following set of jobs must be processed serially through a two-step system.The times at each process are in hours.If Johnson's Rule is used to sequence the jobs then the makespan time (in hours)for all jobs is

If the following jobs are sequenced according to the DDATE rule,then job A would be completed on day (assume zero for today's date)

The scheduling rule that minimizes the makespan time for a set of jobs that must be processed through a two-step system where every job follows the same sequence through the two processes is

The sequence in which jobs should be processed is determined using linear programming.

Typically,there are more options available when scheduling employees because labour is a very flexible resource.

If the following jobs are sequenced according to the SLACK rule,then the mean tardiness (in days)for all jobs is (assume zero for today's date)

If a job is ahead of schedule,then its critical ratio (CR)will be

If the following jobs are sequenced according to the SPT rule,then the mean tardiness (in days)for all jobs is (assume zero for today's date)

Gantt charts show the planned and yet to be completed activities against total activities.

Minimizing overtime is one of several objectives that could be considered when constructing a schedule.

Operations Management

Quality Management

Statistical Process Control

Operational Decision-Making Tools: Acceptance Sampling

Product Design

Service Design

Processes and Technology

Capacity and Facilities Design

Operational Decision-Making Tools: Facility Location Models

Human Resources

Operational Decision-Making Tools: Work Measurement

Project Management

Supply Chain Management: Strategy and Design

Global Supply Chain Procurement and Distribution

Forecasting

Inventory Management

Operational Decision-Making Tools: Simulation

The Sales and Operations Planning Process

Operational Decision-Making Tools: Linear Programming

Resource Planning

Lean Systems

Filters