write step by step solution

Problems 1-7 will use the following data (note, some of the questions are 2-machine, and some are 3machine... but the given processing times will not change). 1. Develop the MILP formulation, and use a package to solve the 9/P2/Cmax problem. 2. Develop the LPT list-scheduling solution to the 9/P2/Cmax problem. 3. Apply the Multifit method to the 9/P2/Cmax problem. Use k=7; however, if during the iterations Multifit finds an optimal solution, you may stop there. As part of this question, compare the answers of Q1-3. 4. Assume we modify the problem to have 9/R3/Cmax. (Yes, this now has three machines, Q13 had 2 machines). The given processing times are those if the job is assigned to M1. If assigned to M2, the job will take 1 more time units (than on M1 ). If assigned to M3, the job will take 2 more time units (than on M1). Use Sule's procedure as presented in class to develop a solution. (You need not show the Gantt chart for this solution) 5. Develop a solution to the 9/P3/Cbar problem using SPT list scheduling and LPT list scheduling. Comment on the differences, if any. 6. Develop the optimal 9/P3/,Ci solution. 7. Determine the solution to the 9/P3/iw1Ci using WSPT. Assume the odd numbered jobs have a weight of 2 and the even numbered jobs have a weight of 1 . Problems 1-7 will use the following data (note, some of the questions are 2-machine, and some are 3machine... but the given processing times will not change). 1. Develop the MILP formulation, and use a package to solve the 9/P2/Cmax problem. 2. Develop the LPT list-scheduling solution to the 9/P2/Cmax problem. 3. Apply the Multifit method to the 9/P2/Cmax problem. Use k=7; however, if during the iterations Multifit finds an optimal solution, you may stop there. As part of this question, compare the answers of Q1-3. 4. Assume we modify the problem to have 9/R3/Cmax. (Yes, this now has three machines, Q13 had 2 machines). The given processing times are those if the job is assigned to M1. If assigned to M2, the job will take 1 more time units (than on M1 ). If assigned to M3, the job will take 2 more time units (than on M1). Use Sule's procedure as presented in class to develop a solution. (You need not show the Gantt chart for this solution) 5. Develop a solution to the 9/P3/Cbar problem using SPT list scheduling and LPT list scheduling. Comment on the differences, if any. 6. Develop the optimal 9/P3/,Ci solution. 7. Determine the solution to the 9/P3/iw1Ci using WSPT. Assume the odd numbered jobs have a weight of 2 and the even numbered jobs have a weight of 1