QUESTION $23$

The following table contains the data for a $3-$job instance of $1|$r$\_($j$)|$L$\_($max $).$

Obtain the EDD sequence for this problem and calculate its objective function value. Fill in the following table and Lmax value.

Lmax $=$ QUESTION $24$

Is the EDD sequence optimal?

We don't know, because the EDD sequence has the machine idle and a job waiting for it at the same time Yes, because the EDD sequence is always optimal for $\backslash (1\backslash$mid $\backslash )$ rjlLmax

We don't know, because the due dates are so close to each other

Yes, because the EDD sequence never has the machine idle and a job waiting for it at the same time

QUESTION $25$

Which of the following job$-$position pairs can be fixed and why?

We can't fix any job$-$position pair based on the given data

Job $2$ must be assigned to position $1$ because it has the earliest due date

Job $3$ must be assigned to position $1$ because it can be processed even before any other job is available

Job $1$ must be assigned to position $3$ because it has the latest due date

QUESTION $26$

What is the optimal sequence$($using the spaced out format $"1233")$ and its Lmax value?

Optimal Sequence $\backslash (=\backslash )$

Lmax $\backslash (=\backslash )$