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: \[\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 { V } & 3 & 5 \\ \text { W } & 1 & 1 \\ \text { X } & 4 & 9 \\ \text { Y } & 2 & 3 \\ \text { Z } & 5 & 7 \end{array}\] If Eva uses the first come, first served priority rule to schedule these jobs, what will be the average completion time?

A) 3 hours B) 5 hours C) 7 hours D) 7.2 hours E) 8 hours A) 3 hours B) 5 hours C) 7 hours D) 7.2 hours E) 8 hours

The following table contains information about five jobs waiting to be processed at work center number three. \[\begin{array} { | c r c | } \hline \text { Job } & \begin{array} { r } \text { Processing Time } \\ \text { (hrs) } \end{array} & \text { Hours Until Due } \\ \text { a } & 14 & 15 \\ \text { b } & 10 & 20 \\ \text { c } & 18 & 18 \\ \text { d } & 2 & 16 \\ \text { e } & 4 & 21 \end{array}\] Using the EDD rule, the sequence of jobs would be:

A) d-e-b-a-c. B) a-d-c-b-E. C) e-d-b-a-c. D) a-d-c-e-d. E) e-b-c-d-a. A) d-e-b-a-c. B) a-d-c-b-E. C) e-d-b-a-c. D) a-d-c-e-d. E) e-b-c-d-a.

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 \\ \text { X } & 3 & 5 \\ \text { Y } & 2 & 2 \\ \text { Z } & 1 & 1 \end{array}\] If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average completion time?

A) 7.5 hours B) 5 hours C) 3 hours D) 2.5 hours E) 2 hours A) 7.5 hours B) 5 hours C) 3 hours D) 2.5 hours E) 2 hours

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 | } \hline &{ \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}\] After the row and column reductions, what is the minimum number of lines needed to cover all of the zeroes?

A) 0 lines B) 1 line C) 2 lines D) 3 lines E) 4 lines A) 0 lines B) 1 line C) 2 lines D) 3 lines E) 4 lines

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: \[\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 { V } & 3 & 5 \\ \text { W } & 1 & 1 \\ \text { X } & 4 & 9 \\ \text { Y } & 2 & 3 \\ \text { Z } & 5 & 7 \end{array}\] If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the average completion time?

A) 3 hours B) 5 hours C) 7 hours D) 7.2 hours E) 8 hours A) 3 hours B) 5 hours C) 7 hours D) 7.2 hours E) 8 hours

What is the optimum job sequence for the jobs listed below using Johnson's rule? \[\begin{array} { c c c } \text { Job } & \begin{array} { c } \text { Processing time (hrs) } \\ \text { Center 1 } \end{array} & \text { Center } 2 \\ \text { d } & 13 & 23 \\ \text { e } & 23 & 13 \\ \text { f } & 16 & 18 \\ \text { g } & 20 & 17 \end{array}\]

A) e-g-f-d B) d-g-f-e C) d-f-g-e D) e-d-f-g E) f-e-d-g A) e-g-f-d B) d-g-f-e C) d-f-g-e D) e-d-f-g E) f-e-d-g

Exam 22: Scheduling

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: Job Processing Time (hrs) Due (hrs from now) V 3 5 W 1 1 X 4 9 Y 2 3 Z 5 7 If Eva uses the first come, first served priority rule to schedule these jobs, what will be the average completion time?

(Multiple Choice)

4.8/5

(79)

Question 81

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

(True/False)

4.7/5

(71)

Question 82

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each are as follows: Car Body Work (hrs) Paint (hrs) A 10 2 B 5 4 C 7 5 D 3 6 E 1 7 Where in the optimum sequence should car A be scheduled?

(Multiple Choice)

4.8/5

(90)

Question 83

The priority rule where jobs are processed according to the smallest ratio of time remaining to due date to processing time is:

(Multiple Choice)

4.9/5

(79)

Question 84

The quantity sent to a bottleneck operation could be split into two or more process batches to better utilize a bottleneck resource rather than process the entire batch.

(True/False)

4.9/5

(86)

Question 85

The following table contains information about five jobs waiting to be processed at work center number three. Job Processing Time (hrs) Hours Until Due a 14 15 b 10 20 c 18 18 d 2 16 e 4 21 Using the EDD rule, the sequence of jobs would be:

(Multiple Choice)

4.9/5

(81)

Question 86

The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: Job Processing Time (hrs) Due (hrs from now) W 4 4 X 3 5 Y 2 2 Z 1 1 If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average completion time?

(Multiple Choice)

4.8/5

(80)

Question 87

One disadvantage of appointment systems is:

(Multiple Choice)

4.7/5

(69)

Question 88

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each are as follows: What is the optimum sequence (first car to last)?

(Multiple Choice)

4.7/5

(85)

Question 89

In an assignment model where there are fewer jobs than resources:

(Multiple Choice)

4.9/5

(70)

Question 90

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: Job (Hours) Resource A B C D 1 5 8 7 7 2 4 9 5 9 3 6 9 8 7 4 7 6 6 9 After the row and column reductions, what is the minimum number of lines needed to cover all of the zeroes?

(Multiple Choice)

4.9/5

(85)

Question 91

When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas.

(True/False)

4.8/5

(76)

Question 92

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: Job Processing Time (hrs) Due (hrs from now) V 3 5 W 1 1 X 4 9 Y 2 3 Z 5 7 If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the average completion time?

(Multiple Choice)

4.7/5

(73)

Question 93

Flow-shop scheduling is used in high-volume systems.

(True/False)

4.8/5

(85)

Question 94

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 at X's required resource, the scheduler schedules X to be begun immediately and assumes that X will be done four days from now. This is an example of:

(Multiple Choice)

4.9/5

(86)

Question 95

What is the optimum job sequence for the jobs listed below using Johnson's rule? Job Processing time (hrs) Center 1 Center 2 d 13 23 e 23 13 f 16 18 g 20 17

(Multiple Choice)

4.8/5

(80)

Question 96

Infinite loading and finite loading are two major approaches used to load work centers.

(True/False)

4.8/5

(66)

Question 97

Makespan is the total time needed to complete a group of jobs.

(True/False)

4.9/5

(77)

Question 98

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

The priority rule where jobs are processed according to the smallest ratio of time remaining to due date to processing time is:

The quantity sent to a bottleneck operation could be split into two or more process batches to better utilize a bottleneck resource rather than process the entire batch.

The following table contains information about five jobs waiting to be processed at work center number three. Job Processing Time (hrs) Hours Until Due a 14 15 b 10 20 c 18 18 d 2 16 e 4 21 Using the EDD rule, the sequence of jobs would be:

One disadvantage of appointment systems is:

In an assignment model where there are fewer jobs than resources:

When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas.

Flow-shop scheduling is used in high-volume systems.

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 at X's required resource, the scheduler schedules X to be begun immediately and assumes that X will be done four days from now. This is an example of:

What is the optimum job sequence for the jobs listed below using Johnson's rule? Job Processing time (hrs) Center 1 Center 2 d 13 23 e 23 13 f 16 18 g 20 17

Infinite loading and finite loading are two major approaches used to load work centers.

Makespan is the total time needed to complete a group of jobs.

Introduction to Operations Management

Competitiveness

Forecasting

Product and Service Design

RELIABILITY – Static

Strategic Capacity Planning for Products and Services

Decision Theory– Static

Process Selection and Facility Layout

Work Design and Measurement

learning curve– Static

Location Planning and Analysis

The Transportation Model– Static

Management of Quality

Quality Control

Acceptance Sampling– Static

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

JIT and Lean Operations

Maintenance– Static

Supply Chain Management

Project Management

Management of Waiting Lines

Linear Programming

Filters