Problem $16-14($Static$)$

The production manager must determine the processing sequence for seven jobs through the grinding and then deburring departments. The same sequence will be followed in both departments. The manager$$s goal is to move the jobs through the two departments as quickly as possible. The foreman of the deburring department wants the SPT rule to be used to minimize the work$-$in$-$process inventory in his department.

PROCESSING TIME

$($hours$)$

Job Grinding Deburring

A $36$

B $24$

C $15$

D $43$

E $94$

F $87$

G $62$

Click here for the Excel Data File

a$.$ Prepare a schedule using SPT for the grinding department.

b$-1.$ What is the total flow time in the grinding department for the SPT sequence?

b$-2.$ What is the makespan to process the seven jobs in both the grinding and deburring departments?

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

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

c$-3.$ What is the makespan to process the seven jobs in both the grinding and deburring department, based on your job order in c$-1?$