Find the position for each job by using Johnsons rule.

Position 1Position 2Position 3Position 4Position 5Position 6

We use the following four step process to find the optimal sequence.

Step 1: Find the minimum processing time considering times on both machines.

Step 2: Identify the corresponding job and the corresponding machine for the minimum time identified at Step 1.

Step 3: Scheduling Rule (M2, A) (1,2,3,4)

(a) If the machine identified in Step 2 is machine M1 then the job identified in Step 2 will be scheduled in the first available schedule position.

(b) If the machine identified in Step 2 is machine M2 then the job identified in Step 2 will be scheduled in the last available schedule position.

Step 4: Remove the job from consideration whose position has been fixed in Step 3; and go to Step 1.

Continue this process until all jobs have been scheduled.