Hi memebers.I am trying to solve a scheduling problem of n jobs each with a given processing time(pi)& a due date(di)with the objective of minimizing total tardiness.First I have to know the optimal sequence/solution which is obtained by taking the minumum total tardiness of all the n! possible arrangements. Can someone help me with the programming (I am a complete novince in this field).

Note: Tardiness = max(0,ci-di) where ci is the completion time of job i. For example suppose we have 3 jobs J1,J2,J3 having 2,4,6 and 4,7,9 as their respective processing time and due date. Then if the arrangement is J1 J2 J3 we shall have c1=2, c2=6,c3=12 and so total tardiness = 0 + 0 + 3 = 3. But if the arrangement if J3 J1 J2 then c3=6,c1=8 & c2=12 resulting in total tardiness of 9 (0+4+5).
Regards