A make-to-order system has 6 jobs to complete on a single machine. Let tj denote the time job j (in minutes) to complete job j and dj be the due-date of. Wehave: t1 =30,t2 =25,t3 =35,t4 =40,t5 =15,t6 =30. Assume also that jobs have the following due times (in minutes) d1 = 110, d2 = 50, d3 =220,d4 =150,d5 =100,d6 =200.
a. Find the sequence of these jobs to minimize the maximum lateness.
b. Find the sequence of these jobs to minimize the maximum lateness if jobs have the following precedence constraints: 1 → 2 → 3 and 6 → 5 .