1. Six jobs need to be sequenced through a facility that can only process one job at a time. It is time tuo right now. The jobs are shown on the table below: Job 1 2 3 4 5 6 Processing time P; (in minutes) 45 5 20 30 60 Due date d 200 30 30 45 100 100 12 a) Give the sequence/s that minimizes the number of late jobs. Show your iterations solution b) Give the sequence/s that minimizes total tardiness of all jobs. Show your solution 2. Eight jobs are to be processed by a single machine. Their processing times and due dates and weights are given on the table below: Job A B C D E F G H Processing time P; (in days) 20 15 20 10 12 5 8 7 Due date d 100 80 40 25 40 60 60 60 Weight wj 1223 23 1 1 Give the sequence that minimizes maximum Weighted tardiness. 3. Six jobs need to be sequenced through a machine shop, with each job to be finished once started. The following table shows the processing times and the due dates of these jobs. Job A B C D E F Processing time P; (in days) 10 15 20 8 4 5 Due date di 18 40 40 25 50 50 Weight Wj 1 2 1 2 3 2 a) What sequence would minimize total flowtime? Determine this minimum flowtime. What sequencing rule can be used to minimize total flowtime? b) Use the branch and bound procedure to determine the job sequence that will minimize total weighted tardiness of the set of six jobs