A foreman has determined the expected processing times at a machine for a set of jobs and now wants to sequence them. Given the following information, do the following:

Job Job Time $($days$)$ Due Date $($days$)$

a $4\mathrm{.}510$

b $6\mathrm{.}017$

c $5\mathrm{.}212$

d $1\mathrm{.}627$

e $2\mathrm{.}818$

f $3\mathrm{.}319$

a$-1.$ Determine the processing sequence using $(1)$ MST$,(2)$ SPT$,(3)$ EDD, and $(4)$ CR$.$

Rule Sequence

MST

$($Click to select$)$

SPT

$($Click to select$)$

EDD

$($Click to select$)$

CR

$($Click to select$)$

a$-2.$ For each sequence, calculate the average days late, the average flow time, and the average WIP. $($Do not round intermediate calculations. Round the final answers to $2$ decimal places.$)$

Rule Average lateness Average flow time Average WIP

MST & EDD

day$($s$)$

day$($s$)$

jobs

SPT

day$($s$)$

day$($s$)$

jobs

CR

day$($s$)$

day$($s$)$

jobs

b$.$ Which rule is best?

$($Click to select$)$

has the lowest average flow time & average WIP, but

$($Click to select$)$

have the lowest average days late.