Algorithm of Johnson’s rule

1. List all operation time on two machines (M₁&M₂).

2. Scan for minimum among all operation times.

3. If Minimum time on M₁ job Schedule as early as possible on M₁, Go to step 4

4. If Minimum time on M₂ job Schedule as late as possible on M₂, Go to step 4

5. Eliminate Job already assigned, i.e., delete the assigned job.

6. Go to Step 2 for remaining jobs.

7. If ties occurs , it can be broken just by job number or any other rules as follows:

a. If tie in same machine schedule J_i with higher priority than J_r, where r>i

If tie in different machines assign the job for the first machine (as early as possible)

Related Posts:

• JOB SHOP SCHEDULING
• Description of Job Shop Scheduling
• Assumptions in static JSSP
• Johnson’s Rule
• Illustration for Johnson’s rule
• Modified Johnson’s Rule for n x m JSSP
• Limitations of Johnson’s Rule
• What makes scheduling problems hard?

Table of Contents

© 2006 Kumaravel & Project Team