using genetic algorithm step 1( parameter setting) show the calculation.

2) Shortest Processing Time Propose job with the start of minimum finishing time. So that, the finishing time will be increasing order Job Processing time (days) 1 Delay (days) Due Date (day-th) 12 Finishing Time (day-th) 7 15 1 29 2 1 1) 4 3 26 6 6 16 8 11 11 10 8 3 24 13 10 3 28 16 13 17 19 14 14 22 8 4 4 21 26 5 3 33 30 12 4 13 34 21 2 3 23 39 16 9 6 30 45 15 Total number of delays = 67 Days Total number of late jobs = = 6 Jobs 2) Shortest Processing Time Propose job with the start of minimum finishing time. So that, the finishing time will be increasing order Job Processing time (days) 1 Delay (days) Due Date (day-th) 12 Finishing Time (day-th) 7 15 1 29 2 1 1) 4 3 26 6 6 16 8 11 11 10 8 3 24 13 10 3 28 16 13 17 19 14 14 22 8 4 4 21 26 5 3 33 30 12 4 13 34 21 2 3 23 39 16 9 6 30 45 15 Total number of delays = 67 Days Total number of late jobs = = 6 Jobs