Processing times and due dates of 9 jobs are given as follows: Job 1 2 3 4 5 6 7 8 9
Proc Time 4 3 7 9 8 15 6 7 10
Due Date 35 40 44 25 20 43 40 22 38
Assume that all jobs arrive at time 0
a) Generate a schedule that minimizes the mean flow time. Break ties with the smallest job number first (i. e., if 3 and 8 have identical parameters, 3 should be scheduled first).
b) Calculate mean flow time, mean tardiness, and maximum tardiness of the schedule obtained in a)
c) Generate a schedule that minimizes the maximum tardiness. Break ties with the smallest job number first.
d) Calculate mean flow time, mean tardiness, and maximum tardiness of the schedule obtained in c)