Consider the 5-job sequencing problem using the data of Table 10.20 at p.426. 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 t=3 iterations. 4. Carry out 5 iterations using the simulates annealing algorithm with To = 0.500,Ti = 0.5Ti-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. TABLE 10.20 Data for Problem 10-11 mal Job, j Processing time in days, T; Due date, d; Holding cost, h; ($/day) Penalty cost p; ($/day) 10 12 5 7 9 12 30 9 3 1 5 4 25 10 20 12 8 15 40 4 Example 10.3-6 (Job Sequencing) 5 jobs are sequenced on a single machine. TABLE 10.13 Data for a Single-Machine 5-Job Sequencing Problem Job,j Processing time in days, T; Due date, d; Holding cost, h; ($/day) Penalty cost, P; ($/day) 15 20 1 2 3 4 5 10 8 6 7 4. 10 a UN 3 2 5 4 6 10 22 10 8 + in 30 12 15 Define Sk = job sequence used in iteration k, N(Sk) = neighborhood sequences of Sky Zk = total cost (holding + penalty) of sequence Ski s* = best sequence available during the search, z* = total cost associated with s*