Consider P$3|$ prmp $|$

Cj with the additional constraint that the completion

of job j has to be less than or equal to a given fixed deadline dj$.$ Preemptions

may occur only at integer times $1,2,3,...$

jobs $1234567891011$

pj $23358889121416$

dj $\backslash$infty $\backslash$infty $\backslash$infty $\backslash$infty $\backslash$infty $\backslash$infty $1112132829$

Find the optimal schedule and compute the total completion time.