2) Consider eight jobs and three unrelated parallel machine problems. Generate different random processing times for each job and machine pairs (you will generate 24 numbers). The process times must be integer number between 5 and 45(at least four of them must be less than 10 and four of them must be greater than 40). (a) Apply the algorithm given in lecture to minimize the makespan algorithm. (b) Assign jobs to machines with minimum processing time for the corresponding jobs. Calculate the makespan of this solution. Compare the solution in part (a). 3) Suppose we now have two-machine flow shop problem. Consider the same processing times generated for Machine I and Machine 2 in Problem 2. Each job must be processed first on Machine 1 and then processed on Machine 2. Find the optimal schedule that minimize the makespan 4) Suppose we now have three-machine flow shop problem. Consider the same processing times generated for Problem 2. Each job must be processed first on Machine 1, then Machine 2, and then Machine 3. Apply one of the heuristic algorithms given in lecture to minimize the makespan 2) Consider eight jobs and three unrelated parallel machine problems. Generate different random processing times for each job and machine pairs (you will generate 24 numbers). The process times must be integer number between 5 and 45(at least four of them must be less than 10 and four of them must be greater than 40). (a) Apply the algorithm given in lecture to minimize the makespan algorithm. (b) Assign jobs to machines with minimum processing time for the corresponding jobs. Calculate the makespan of this solution. Compare the solution in part (a). 3) Suppose we now have two-machine flow shop problem. Consider the same processing times generated for Machine I and Machine 2 in Problem 2. Each job must be processed first on Machine 1 and then processed on Machine 2. Find the optimal schedule that minimize the makespan 4) Suppose we now have three-machine flow shop problem. Consider the same processing times generated for Problem 2. Each job must be processed first on Machine 1, then Machine 2, and then Machine 3. Apply one of the heuristic algorithms given in lecture to minimize the makespan