Problem 4 (20 points): To complete a project, you need to process eight jobs for which 2 identical machines are available. The table below gives the process times. ABCDEFGH 64 32 16 8 4 2 1 1 1. (8 points) Use LPT+LST to assign jobs to the two machines and sequence their processing. The rule may not always be optimal in general, but here the resulting makespan must be the minimum one. Explain why. 2. (6 points) If somebody sells you a software that can be installed on a machine to cut the processing time of the longest job (job A) by half, and if the project costs you $100 per day before it is finished, what is the maximum price you should be willing to pay for that software? 3. (6 points) If somebody offers to lease you a third (identical) machine for a payment. Should you accept it for the purpose of minimizing the makespan? . If you accept the machine for the purpose of minimizing the total waiting time of all jobs, how would you schedule these jobs on the three machines and what happens to the makespan? Problem 4 (20 points): To complete a project, you need to process eight jobs for which 2 identical machines are available. The table below gives the process times. ABCDEFGH 64 32 16 8 4 2 1 1 1. (8 points) Use LPT+LST to assign jobs to the two machines and sequence their processing. The rule may not always be optimal in general, but here the resulting makespan must be the minimum one. Explain why. 2. (6 points) If somebody sells you a software that can be installed on a machine to cut the processing time of the longest job (job A) by half, and if the project costs you $100 per day before it is finished, what is the maximum price you should be willing to pay for that software? 3. (6 points) If somebody offers to lease you a third (identical) machine for a payment. Should you accept it for the purpose of minimizing the makespan? . If you accept the machine for the purpose of minimizing the total waiting time of all jobs, how would you schedule these jobs on the three machines and what happens to the makespan