d$)$ Using the LPT$($longest processing$$ time$)$ decision rule for sequencing the$$ jobs, the order is$($to resolve a$$ tie, use the order in which the jobs were$$ received$)$:

Sequence

Job

$1$

$$

E

A

C

D

B

$.$

$.$

$.$

Question content area right

Part $1$

The following jobs are waiting to be processed at the same machine center. Jobs are logged as they$$ arrive:

$$

Job

Due Date

Duration$($days$)$

Upper A

$313$

$8$

Upper B

$312$

$16$

Upper C

$325$

$40$

Upper D

$314$

$5$

Upper E

$315$

$3$

All dates are specified as manufacturing planning calendar days. Assume that all jobs arrive on day $275.$ Assume each job starts at the beginning of the day and finishes at the end of the day$($a job that begins on day $275$ and takes $8$ days will finish on day$282,$ and the next job begins in the morning of day$283).$ Compute all times based on initiating work on day $275.$