$(15$ points$)$ Consider the following scheduling problem in which jobs are available at time zero to be processed by the machines $M1$ and $M2,$ and makespan is the measure of performance to be minimized.

$\backslash$table$[[$Job$,\backslash$table$[[$Route$],[$Operation$]],\backslash$table$[[$Processing Time$],[$Operation$]],\backslash$table$[[$Due$],[$Date$]]],[1,2,1,2],[1,M1,M2,10,12,18],[2,M1,-,1,-,15],[3,M2,-,4,-,10],[4,M2,M1,1,4,25],[5,M2,M1,3,6,30],[6,M1,M2,8,9,17]]$

Assume that job preemption, job splitting and operations overlapping are not allowed.

What is the total tardiness of jobs in the optimal schedule to minimize the makespan?

Show your work on your answer sheet and mark the choice that you think is correct.