please solve

Consider the following data related to single machine job scheduling: where the objective of scheduling is minimize the total number of late jobs. Let the following sequence of jobs be the initial solution: [1,2,3,4,5,6]T. Answer the following: (a) Create an immediate neighborhood for the above solution by swapping adjacent two jobs only. (b) Create an extended neighborhood for the above solution by swapping any two jobs only. (c) Execute 6 iterations of the simulated annealing with following parameters: Initial temperature be 100 . Neighborhood type = Extended neighborhood, Move type = Random walk, Pool size =1, Max \# tries = 3. Cooling mechanism = After every iteration, update the temperature as Tnew=0.9Told (d) Execute 3 iterations of the tabu search with following parameters: Neighborhood type = Immediate neighborhood, Move type = Greedy Move, Tenure period =2, and Tabu list contains the move, i.e., make the move as tabu, not the entire solution. (e) Assume that instead of one machine, there are two similar parallel machines in the system. A job can be processed on either of the two machines. Propose a solution structure that can handle the two parallel machines. (f) For the above solution structure, propose a mechanism to generate a neighbor. (g) Estimate the maximum number of neighbors that you will get using the above mechanism. Hint: Instructions for Obtaining Random Number:: For each problem (12) or its part where random numbers are needed, obtain them from the consecutive random digite from Random Number Table as follows. Start from a seed location. Assume for this HW the seed location is first column 8 first row of the table (Le, seed at (1,1) ). Now read the five-digits of from ths seed location and form a random numbers, oy placing a decimat point in front. From aeed (1,1) the first random number is 0.13962 , and the second random number io 0.70992. Once you reach the end of the first row, otart from the firat column of the nent row. Always metart the genemation of nandow numbers for each new problem (or any mub-problem) for this HW from seed (1,1). If any randem