1.

value:

15.00 points

Problem 16-10
The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that
follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.

Job
a
b
c
d
e
f
g
h

TIME (hours)
Machine A
Machine B
16
5
3
13
9
6
8
7
2
14
12
4
18
14
20
11

a. Determine a sequence that will minimize makespan time.

The sequence is

.
e-b-g-h-d-c-a-f

b. Find machine Bs idle time.

hrs

Idle time

c. For the sequence determined in part a, how much would machine B's idle time be reduced by splitting
the last two jobs in half?
New idle time

hrs, savings of

hrs.

Time remaining: 1:43:15

2.
value:

15.00 points

Problem 16-11
Given the operation times provided:

Center 1
Center 2

A
20
27

B
16
30

JOB TIMES (minutes)

C
D
43
60
51
12

E
35
28

F
42
24

a. Develop a job sequence that minimizes idle time at the two work centers.

The sequence is

.
(Click to select)

b. Determine idle time of center 2, assuming no other activities are involved.

minutes

Idle time

3.
value:

15.00 points

Problem 16-14
The production manager must determine the processing sequence for seven jobs through the grinding
and deburring departments. The same sequence will be followed in both departments. The managers
goal is to move the jobs through the two departments as quickly as possible. The foreman of the
deburring department wants the Shortest processing time rule to be used to minimize the work-inprocess inventory in his department.

Job
A
B
C
D
E
F
G

PROCESSING TIME
(hours)
Grinding Deburring
3
6
2
4
1
5
4
3
9
4
8
7
6
2

a. Prepare a schedule using Shortest processing time for the grinding department.

The sequence is

.
(Click to select)

b-1. What is the flow time in the grinding department for the Shortest processing time sequence?
hours

Grinding flow time

b-2. What is the total time needed to process the seven jobs in both the grinding and deburring
departments?
hours

Total time

c-1. Determine a sequence that will minimize the total time needed to process the jobs in both
departments.

The sequence is

.
(Click to select)

c-2. What flow time will result for the grinding department?

Grinding flow time

ask your instructor a questionreferencesebook & resources

4.
value:

30.00 points

hrs

Problem 16-17
Given the following information on job times and due dates.

Job
a
b
c
d
e
f

Job Time
(Hours)
3.5
2.0
4.5
5.0
2.5
6.0

Due Date
(Hours)
7
6
18
22
4
20

a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest
processing time, (3) Earliest due date, and (4) Critical ratio.

Sequence for First come, first served

(Click to select)

Sequence for Shortest processing time

(Click to select)

Sequence for Earliest due date

(Click to select)

Sequence for Critical ratio

(Click to select)

a-2. For each method, find the average job flow time and the average job tardiness. (Round your
answers to 2 decimal places.)
First Come, First
Served
Average flow time
Average job tardiness

5.

value:

25.00 points

Problem 16-18

Shortest Processing
Time

Earliest Due Date

Critical

The Budd Gear Co. specializes in heat-treating gears for automobile companies. At 8:00 a.m., when
Budds shop opened today, five orders (listed in order of arrival) were waiting to be processed.

Order
A
B
C
D
E

Order Size
(units)
16
6
10
8
4

Per Unit Time in

Heat Treatment
(minutes/unit)
4
12
3
10
1

Due Date
(min. from now)
160
200
180
190
220

a. If the due date rule is used, what sequence should be used?

The sequence is

.
(Click to select)

b. What will be the average job tardiness? (Round your answer to 2 decimal places.)

Average job tardiness

c. What will be the average number of jobs in the system? (Round your answer to 2 decimal places.)

Average number of jobs

d. Would the Shortest processing time rule produce better results in terms of average job tardiness?
(Round your answer to the nearest whole number.)
new average job tardiness is
(Click to select)

minutes.