a) If job-1 is placed into the 4th order, find all feasible schedules considering the dominance conditions.

b) For all schedules in part (a) compute the objective values and find the best schedule. Can we say that the best schedule also must be an optimal schedule?

Transcribed Image Text:

Consider 1|rj|Lmax problem with the following data: Job 1 2 4 5 P₁ 6 18 10 10 0 7 18 8 dj 8 42 24 3 12 12 44 8 90 Find the optimal sequence using the branch and bound with the preemptive due date as lower bound and compute Lmax Consider 1|rj|Lmax problem with the following data: Job 1 2 4 5 P₁ 6 18 10 10 0 7 18 8 dj 8 42 24 3 12 12 44 8 90 Find the optimal sequence using the branch and bound with the preemptive due date as lower bound and compute Lmax

Answer rating: 100% (QA)

To solve the 1rjmax problem using branch and bound with the preemptive due date as a lower bound we ... View the full answer