Single Machine Static Scheduling

Assume a set 5 jobs ready for processing on a single machine. Let pj

and dj be the processing time and due date, respectively, of job j, as
given in the Table below. The machine can process only one job at a
time. If any job j completes its processing beyond its due date, then it
is considered to be tardy. If Cj is the completion time of job j, then its
tardiness is given by Tj = max{Cj – dj, 0}, i.e., is the extra time beyond
the due date that its completion takes. What is the order in which the
jobs should be processed so as to minimize the total tardiness, 𝒋 𝑻𝒋 ? It
can be proven that for this problem it is never optimal to preempt a job
that is currently being proceesed. job pj dj
1 7 8
2 1 12
3 5 6
4 2 14
5 6 18
1