C$.$ nsider a $5-$job scheduling problem to minimize total tardiness. The table below provides the processing times, and due dates for all of the jobs.

You are in the process of applying B&B with Basic Bounds to solve this problem.

A node where job $1$ is assigned to fifth position, i$.$e$.,".\_.1"$ has been created. Compute the basic lower bound for this node.

Selected Answer: $57$

Correct Answer: $57$

Question $19$

Consider a $5-$job scheduling problem to minimize total tardiness. The table below provides the processing times, and due dates for all of the jobs.

$p_j{d}_j$

$11226$