Exercises Solve the following 10-job T-problem using heuristic procedures. Jobj 1 2 3 4 5 6 7 8 9 10 32 26 55 98 80 41 24 Pi d; 7 153 23 172 100 164 162 168 234 230 184 212 156 a) Find a solution using the best dispatching rule among SPT, EDD, and MDD. b) Find a solution using the greedy heuristic procedure. c) Find a solution using the insertion procedure. d) Find a solution using a neighborhood search procedure (adjacent pair- wise interchanges), initialized by a sequence that takes the jobs in EDD order. e) Find a solution using a neighborhood search procedure (last-insertion neighborhoods), initialized by a sequence that takes the jobs in EDD order. Exercises Solve the following 10-job T-problem using heuristic procedures. Jobj 1 2 3 4 5 6 7 8 9 10 32 26 55 98 80 41 24 Pi d; 7 153 23 172 100 164 162 168 234 230 184 212 156 a) Find a solution using the best dispatching rule among SPT, EDD, and MDD. b) Find a solution using the greedy heuristic procedure. c) Find a solution using the insertion procedure. d) Find a solution using a neighborhood search procedure (adjacent pair- wise interchanges), initialized by a sequence that takes the jobs in EDD order. e) Find a solution using a neighborhood search procedure (last-insertion neighborhoods), initialized by a sequence that takes the jobs in EDD order