help me....

Consider the 5-job sequencing problem using the data of Table 10.20 at p.426. 1. Formulate the optimization model to find the optimal solution. 2. Find the optimal solution using LINGO. 3. Carry out 5 iterations using the tabu search algorithm with =3 iterations. 4. Carry out 5 iterations using the simulates annealing algorithm with To = 0.500,T; = 0.51,-1, and t = 3 accept-iterations. 5. Carry out 3 iterations using the genetic algorithm with the same calculation process of example 10.3-6. 40 Use the following random numbers: 0.7047 0.0971 0.9041 0.2615 0.4995 0.3459 0.0138 0.1972 0.8901 0.0809 0.4041 0.5696 0.5181 0.5693 0.9417 0.6367 0.6369 0.4230 0.5483 0.8178 0.8607 0.0255 0.1038 0.9626 0.6448 0.7966 0.6594 0.7253 0.7211 0.4761 TE 10-11. Apply TS with 7 = 3 iterations to solve the 5-job sequencing problem using the data in Table 10.20. (Hint: You may find it convenient to use file excelJobSequencing.xls to compute the cost functions.) TABLE 10.20 Data for Problem 10-11 Job. j Processing time in days, T Due date, d) Holding cost, hi ($/day) Penalty cost pj (S/day) 1 2 3 4 5 10 12 5 7 9 12 30 9 25 40 3 1 5 2 4 10 20 12 8 15