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} { l c c } \text { Job } & \text { Processing } & \text { Due } \\ &\text { Time (hrs) } & \text { (hrs from now) } \\ \hline \mathrm { W } & 4 & 4 \\ \mathrm { X } & 3 & 5 \\ \mathrm { Y } & 2 & 2 \\ \mathrm { Z } & 1 & 1 \end{array}\] If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness?

A) 0 hours B) 1.5 hours C) 1.75 hours D) 2 hours E) 2.25 hours A) 0 hours B) 1.5 hours C) 1.75 hours D) 2 hours E) 2.25 hours

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} { l c c } \text { Job } & \begin{array} { c } \text { Processing } \\ \text { Time (hrs) } \end{array} & \begin{array} { c } \text { Due } \\ \text { (hrs from now) } \end{array} \\ \hline \mathrm { V } & 3 & 5 \\ \mathrm {~W} & 1 & 1 \\ \mathrm { X } & 4 & 9 \\ \mathrm { Y } & 2 & 3 \\ \mathrm { Z } & 5 & 7 \end{array}\] If Eva uses the shortest processing time first 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 A) 2 hours B) 2.2 hours C) 2.33 hours D) 2.4 hours E) 3 hours

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} { l c c } \text { Job } & \begin{array} { c } \text { Processing } \\ \text { Time (hrs) } \end{array} & \begin{array} { c } \text { Due } \\ \text { (hrs from now) } \end{array} \\ \hline \mathrm { V } & 3 & 5 \\ \mathrm {~W} & 1 & 1 \\ \mathrm { X } & 4 & 9 \\ \mathrm { Y } & 2 & 3 \\ \mathrm { Z } & 5 & 7 \end{array}\] If Eva uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in her shop today?

A) 2 jobs B) 2.33 jobs C) 2.4 jobs D) 2.67 jobs E) 3 jobs A) 2 jobs B) 2.33 jobs C) 2.4 jobs D) 2.67 jobs E) 3 jobs

Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time. \[\begin{array} { c c c } &{ \text { Processing Time (mins) } } \\ \text { Job } & \text { ST1 } & \text { ST2 } \\ \hline \text { A } & 20 & 12 \\ \text { B } & 10 & 32 \\ \text { C } & 8 & 9 \\ \text { D } & 14 & 7 \\ \text { E } & 5 & 6 \\ \text { F } & 18 & 6 \end{array}\]

\[\begin{array} { c c c c c } \quad \qu

There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: \[\begin{array} { l c c c } & & { \text { Machine } } \\ \text { Job } & \text { A } & \text { B } & \text { C } \\ \hline 1 & \$ 6 & 9 & 4 \\ 2 & 4 & 4 & 3 \\ 3 & 8 & 7 & 4 \end{array}\] What is the total cost for the optimum assignment of jobs to machines?

The answer of There are three jobs to be done...

Given the following information concerning jobs awaiting processing at a single work center, what processing sequence will result if the critical ratio rule is used? \[\begin{array} { l c c c } \text { Job } & \begin{array} { c } \text { Process Time } \\ \text { At This } \\ \text { Operation (hrs) } \end{array} & \begin{array} { c } \text { Process Time } \\ \text { At Remaining } \\ \text { Operations (hrs) } \end{array} & \begin{array} { c } \text { Final Due } \\ \text { Date (hrs) } \end{array} \\ \hline \mathrm{P} & 6 & 4 & 8 \\ \mathrm{Q} & 10 & 15 & 40 \\ \mathrm{R} & 5 & 10 & 30 \\ \mathrm{~S} & 8 & 12 & 45 \\ \mathrm{~T} & 6 & 8 & 24 \end{array}\]

The sequence will be P - T - Q - R - S.

Exam 16: Scheduling

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): Job Processing Time ( days ) Due Date (days from now) 2 2 5 6 6 10 3 4 4 8 What is the average completion time for the earliest due date priority rule schedule? Average job tardiness? Average number of jobs at the center?

(Short Answer)

4.7/5

(78)

Question 41

Determine the processing sequence for the six jobs shown in the following table using Johnson's rule. Calculate total throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much? Processing Time (hrs) Job ST1 ST2 a 4 6 b 9 8 c 10 5 d 6 9 e 9 7 f 12 10

(Essay)

4.8/5

(78)

Question 42

A manager must assign four engineers to projects, one to a project. The leader of project C has indicated that he does not want engineer 2 or 3 on his project. Given the following cost figures for each project-engineer combination, and keeping in mind that two combinations are undesirable, determine assignments such that total cost will be minimized. Engineer 1 \ 18 12 20 19 2 17 18 * 10 3 25 28 * 14 4 28 18 24 25 $\text { *undesirable }$

(Essay)

4.9/5

(70)

Question 43

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 Due Time (hrs) (hrs from now) 4 4 3 5 2 2 1 1 If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness?

(Multiple Choice)

4.7/5

(79)

Question 44

A Gantt chart is a basic scheduling tool that is most useful in low-volume systems.

(True/False)

4.9/5

(65)

Question 45

Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: Process Time (Hours) Job Center A Center B 4 5 6 6 1 2 5 2 If these jobs were scheduled in the sequence shown, when would idle time occur at machine B?

(Short Answer)

4.9/5

(78)

Question 46

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) 3 5 1 1 4 9 2 3 5 7 If Eva uses the shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness?

(Multiple Choice)

4.8/5

(100)

Question 47

To facilitate utilization of bottleneck operations, in theory of constraints scheduling can be split into __ to reduce waiting times.

(Multiple Choice)

4.8/5

(99)

Question 48

The EDD priority rule usually does well with regard to:

(Multiple Choice)

4.9/5

(80)

Question 49

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) 3 5 1 1 4 9 2 3 5 7 If Eva uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in her shop today?

(Multiple Choice)

4.7/5

(83)

Question 50

Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time. Processing Time (mins) Job ST1 ST2 A 20 12 B 10 32 C 8 9 D 14 7 E 5 6 F 18 6

(Essay)

4.7/5

(76)

Question 51

Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.

(True/False)

4.9/5

(70)

Question 52

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

(Multiple Choice)

4.9/5

(70)

Question 53

The assignment method is limited to a maximum of two jobs per resource.

(True/False)

5.0/5

(79)

Question 54

There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: Machine Job A B C 1 \ 6 9 4 2 4 4 3 3 8 7 4 What is the total cost for the optimum assignment of jobs to machines?

(Short Answer)

5.0/5

(80)

Question 55

A work center can be a: (I) machine. (II) group of machines. (III) department. (IV) facility.

(Multiple Choice)

4.7/5

(76)

Question 56

Given the following information concerning jobs awaiting processing at a single work center, what processing sequence will result if the critical ratio rule is used? Job Process Time At This Operation (hrs) Process Time At Remaining Operations (hrs) Final Due Date (hrs) 6 4 8 10 15 40 5 10 30 8 12 45 6 8 24

(Essay)

4.8/5

(70)

Question 57

Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): Job Processing Time ( days ) Due Date (days from now) 2 2 5 6 6 10 3 4 4 8 What is the average completion time for the shortest processing time priority rule? Average job tardiness? Average number of jobs at the center?

(Short Answer)

4.9/5

(80)

Question 58

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the throughput time 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 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.9/5

(89)

Question 59

If optimal sequencing through three work centers is desired, Johnson's rule II is used rather than Johnson's rule.

(True/False)

4.8/5

(69)

Question 60

Determine the processing sequence for the six jobs shown in the following table using Johnson's rule. Calculate total throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much? Processing Time (hrs) Job ST1 ST2 a 4 6 b 9 8 c 10 5 d 6 9 e 9 7 f 12 10

A Gantt chart is a basic scheduling tool that is most useful in low-volume systems.

Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: Process Time (Hours) Job Center A Center B 4 5 6 6 1 2 5 2 If these jobs were scheduled in the sequence shown, when would idle time occur at machine B?

To facilitate utilization of bottleneck operations, in theory of constraints scheduling can be split into __ to reduce waiting times.

The EDD priority rule usually does well with regard to:

Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time. Processing Time (mins) Job ST1 ST2 A 20 12 B 10 32 C 8 9 D 14 7 E 5 6 F 18 6

Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

The assignment method is limited to a maximum of two jobs per resource.

There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: Machine Job A B C 1 \ 6 9 4 2 4 4 3 3 8 7 4 What is the total cost for the optimum assignment of jobs to machines?

A work center can be a: (I) machine. (II) group of machines. (III) department. (IV) facility.

If optimal sequencing through three work centers is desired, Johnson's rule II is used rather than Johnson's rule.

Introduction to Operations Management

Competitiveness, Strategy, and Productivity

Forecasting

Product and Service Design

Extension: Reliability

Strategic Capacity Planning for Products and Services

Extension: Decision Theory

Process Selection and Facility Layout

Work Design and Measurement

Extension: Learning Curves

Location Planning and Analysis

Extension: The Transportation Model

Management of Quality

Quality Control

Extension: Acceptance Sampling

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

Jit and Lean Operations

Extension: Maintenance

Supply Chain Management

Project Management

Management of Waiting Lines

Linear Programming

Filters

Exam 16: Scheduling

Determine the processing sequence for the six jobs shown in the following table using Johnson's rule. Calculate total throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much? Processing Time (hrs) Job ST1 ST2 a 4 6 b 9 8 c 10 5 d 6 9 e 9 7 f 12 10

A Gantt chart is a basic scheduling tool that is most useful in low-volume systems.

Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: Process Time (Hours) Job Center A Center B 4 5 6 6 1 2 5 2 If these jobs were scheduled in the sequence shown, when would idle time occur at machine B?

To facilitate utilization of bottleneck operations, in theory of constraints scheduling ________ can be split into __________ to reduce waiting times.

The EDD priority rule usually does well with regard to:

Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time. Processing Time (mins) Job ST1 ST2 A 20 12 B 10 32 C 8 9 D 14 7 E 5 6 F 18 6

Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.

Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy?

The assignment method is limited to a maximum of two jobs per resource.

There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: Machine Job A B C 1 \ 6 9 4 2 4 4 3 3 8 7 4 What is the total cost for the optimum assignment of jobs to machines?

A work center can be a: (I) machine. (II) group of machines. (III) department. (IV) facility.

If optimal sequencing through three work centers is desired, Johnson's rule II is used rather than Johnson's rule.

Introduction to Operations Management

Competitiveness, Strategy, and Productivity

Forecasting

Product and Service Design

Extension: Reliability

Strategic Capacity Planning for Products and Services

Extension: Decision Theory

Process Selection and Facility Layout

Work Design and Measurement

Extension: Learning Curves

Location Planning and Analysis

Extension: The Transportation Model

Management of Quality

Quality Control

Extension: Acceptance Sampling

Aggregate Planning and Master Scheduling

MRP and ERP

Inventory Management

Jit and Lean Operations

Extension: Maintenance

Supply Chain Management

Project Management

Management of Waiting Lines

Linear Programming

Filters

To facilitate utilization of bottleneck operations, in theory of constraints scheduling can be split into __ to reduce waiting times.