Scheduling Problem (Min sum of weighted tardiness) A workshop uses a single machine to process three jobs. The request to process the three jobs is received at time 0 and the due dates are measured from this date. The objective is to determine the sequence of the three jobs that results in the minimal tardiness penalty. A job is tardy if it completes after its due date. Its tardiness is the positive difference between its completion time and its due date. The processing times, due dates, and tardiness penalties follow. Table: The Jobs' Characteristics Job Processing Time (Days) Due Date (Days) Tardiness Penalty (KD/day) 1 5 25 19 2 20 22 12 3 15 35 34 - explain and write constraints