Problem $2$

A factory uses a single machine to process three jobs. Both the processing time and the due dates

$($in days$)$ for each job are given in the following table. The due dates are measured from zero, the

assumed start time of the first job.

The objective is to determine the job sequence that minimizes the late penalty for processing all

three jobs. The problem includes the following constraints:

The noninterference constraints that guarantees that no two jobs are processed

concurrently.

Due$-$date constraints.