2. Consider the following 11-job 2-machine scheduling problem in which all jobs are available at time zero, and makespan is the measure of performance to be minimized. Job Route Processing
<p><img alt="Erica and Bob participate in a friendly Hackathon that allows each to solve one question a day out of the three offered. There will be one easy, one medium