Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

Which of the following is not part of the procedure for a minimization problem under the assignment method of loading?

Accepted Answer

A)  performing row reductions 
B)  performing column reductions 
C)  developing a constraint matrix 
D)  developing an opportunity cost matrix 
A)  performing row reductions 
B)  performing column reductions 
C)  developing a constraint matrix 
D)  developing an opportunity cost matrix

Question 3

The dispatch list contains the order in which the work is assigned to a productive resource.

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

A)  26 days. 
B)  16 days. 
C)  10 days. 
D)  5.2 days. 
A)  26 days. 
B)  16 days. 
C)  10 days. 
D)  5.2 days.

Question 5

The process of smoothing out the work assigned is known as

Accepted Answer

A)  production control 
B)  sequencing 
C)  load levelling 
D)  dispatching 
A)  production control 
B)  sequencing 
C)  load levelling 
D)  dispatching

Question 6

Finite scheduling will not load a resource beyond its fixed capacity.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A)  118 days. 
B)  6.6 days. 
C)  33 days. 
D)  23.6 days. 
A)  118 days. 
B)  6.6 days. 
C)  33 days. 
D)  23.6 days.

Question 8

A scheduling technique which loads without regards to capacity, then levels the load and sequences the jobs is known as

Accepted Answer

A)  finite scheduling 
B)  infinite scheduling 
C)  advanced planning and scheduling 
D)  load levelling 
A)  finite scheduling 
B)  infinite scheduling 
C)  advanced planning and scheduling 
D)  load levelling

Question 9

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

Question 10

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

Accepted Answer

A)  16.4 days. 
B)  22.6 days. 
C)  28.7 days. 
D)  33.0 days 
A)  16.4 days. 
B)  22.6 days. 
C)  28.7 days. 
D)  33.0 days

Question 11

Automated scheduling systems typically include the following features except

Accepted Answer

A)  staff scheduling 
B)  schedule bidding 
C)  staff bidding 
D)  schedule optimization 
A)  staff scheduling 
B)  schedule bidding 
C)  staff bidding 
D)  schedule optimization

Question 12

Johnson's rule gives an optimal sequence for jobs processed serially through a two step system.

Accepted Answer

A) True 
 B)False

Question 13

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 14

The assignment method of linear programming can be used for both the loading and employee scheduling.

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

A)  5 days. 
B)  8.33 days. 
C)  10.6 days. 
D)  25 days 
A)  5 days. 
B)  8.33 days. 
C)  10.6 days. 
D)  25 days

Question 16

If the following jobs are sequenced according to the LPT rule, then the total number of jobs that would be late is (assume zero for today's date)

Accepted Answer

A)  5 jobs. 
B)  4 jobs. 
C)  3 jobs. 
D)  2 jobs. 
A)  5 jobs. 
B)  4 jobs. 
C)  3 jobs. 
D)  2 jobs.

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

Job shop scheduling is also known as shop floor control.

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

If the following jobs are sequenced according to the SPT rule, then the total number of jobs that would be late is (assume zero for today's date)

Accepted Answer

A)  0 jobs. 
B)  1 job. 
C)  2 jobs. 
D)  3 jobs. 
A)  0 jobs. 
B)  1 job. 
C)  2 jobs. 
D)  3 jobs.

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

Which of the following is not part of the procedure for a minimization problem under the assignment method of loading?

The dispatch list contains the order in which the work is assigned to a productive resource.

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

The process of smoothing out the work assigned is known as

Finite scheduling will not load a resource beyond its fixed capacity.

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

A scheduling technique which loads without regards to capacity, then levels the load and sequences the jobs is known as

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)

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

Automated scheduling systems typically include the following features except

Johnson's rule gives an optimal sequence for jobs processed serially through a two step system.

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)

The assignment method of linear programming can be used for both the loading and employee scheduling.

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

If the following jobs are sequenced according to the LPT rule, then the total number of jobs that would be late is (assume zero for today's date)

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

Job shop scheduling is also known as shop floor control.

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 SPT rule, then the total number of jobs that would be late is (assume zero for today's date)

Introduction to Operations and Supply Chain Management

Quality Management

Statistical Process Control

Product Design

Service Design

Processes and Technology

Capacity and Facilities Design

Human Resources

Project Management

Supply Chain Management Strategy and Design

Global Supply Chain Procurement and Distribution

Forecasting

Inventory Management

Sales and Operations Planning

Resource Planning

Lean Systems

Filters

Exam 17: Scheduling

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

Which of the following is not part of the procedure for a minimization problem under the assignment method of loading?

The dispatch list contains the order in which the work is assigned to a productive resource.

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

The process of smoothing out the work assigned is known as

Finite scheduling will not load a resource beyond its fixed capacity.

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

A scheduling technique which loads without regards to capacity, then levels the load and sequences the jobs is known as

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)

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

Automated scheduling systems typically include the following features except

Johnson's rule gives an optimal sequence for jobs processed serially through a two step system.

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)

The assignment method of linear programming can be used for both the loading and employee scheduling.

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

If the following jobs are sequenced according to the LPT rule, then the total number of jobs that would be late is (assume zero for today's date)

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

Job shop scheduling is also known as shop floor control.

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 SPT rule, then the total number of jobs that would be late is (assume zero for today's date)

Introduction to Operations and Supply Chain Management

Quality Management

Statistical Process Control

Product Design

Service Design

Processes and Technology

Capacity and Facilities Design

Human Resources

Project Management

Supply Chain Management Strategy and Design

Global Supply Chain Procurement and Distribution

Forecasting

Inventory Management

Sales and Operations Planning

Resource Planning

Lean Systems

Filters