1. Use Johnsons algorithm to find the optimal sequence of the following two machine problem. Estimate the L1 and L2 limits of the optimal sequence and the make span. Make span is associated with a static schedule and is defined as the time required to complete the schedule. The data show processing time on machine1 and machine2 respectively. Follow the example worked out in the note. The key issue is to understand the heuristic rules used.

   Job M1 M2

   1 4 6

   2 5 3

   3 2 7

   4 3 4

   5 8 4

   6 6 5