JOHNSON’S RULE FOR

SEQUENCING OF ‘n’ JOBS

 Sequencing of n-jobs through 2-machines

Assumptions
1. The processing times on different machines are
independent of the order of the job in which
they are to be processed;
2. Only one job can be processed on a given
machine at a time;
3. The time taken by the jobs moving from one
machine to another is negligible & taken as
equal to ‘zero’;
4. Each job, once started on a machine is to be
performed up to the completion on that
machine;
 Sequencing of n-jobs through 2-machines

5. Machines to be used are of different types;

6. All jobs are known & are ready for processing
before the period under consideration begins;
7. Processing times are given and do not change
 Sequencing Jobs Through Two Serial
Process

Johnson’s Rule
1. List time required to process each job at each
machine. Set up a one-dimensional matrix to
represent desired sequence with # of slots equal
to # of jobs.
2. Select smallest processing time at either
machine. If that time is on machine 1, put the
job as near to beginning of sequence as possible.
3. If smallest time occurs on machine 2, put the job
as near to the end of the sequence as possible.
4. Remove job from list.
5. Repeat steps 2-4 until all slots in matrix are
filled and all jobs are sequenced.
 Numerical – Example (2-machines)
• In a machine shop. 8 different products are being
manufactured each requiring time on two machines in
the sequence A -> B as follows :
Product 1 2 3 4 5 6 7 8
Time in M/c ‘A’ 30 45 15 20 80 120 65 10
(in minutes)

Time in M/c ‘B’ 20 30 50 35 36 40 50 20

• Find out (i) Optimum sequence, (ii) Total Elapsed
time for optimum sequence, (iii) Idle time in both the
machines, and (Iv) Total waiting time.
Product M/c 1 M/c 2
OPTIMUM SEQUENCE
1 30 20
2 45 30
3 15 50

4 20 35 8 3 4 7 6 5 2 1

5 80 36
6 120 40
7 65 50
8 10 20
Calculation of Elapsed time, Idle time & Waiting
time

Product M/C A M/C B Idle time Waiting

Time In Time out Time in Time out M/c A M/c B time

8 0 (+10) 10 10(+20) 30 10

3 10 (+15) 25 30(+50) 80 5

4 25(+20) 45 80(+35) 115 35

7 45(+65) 110 115(+50) 165 5

6 110(+120) 230 230(+40) 270 65

5 230(+80) 310 310(+36) 346 40

2 310(+45) 355 355(+30) 385 9

1 355(+30) 385 385(+20) 405 20

Total 144 45
Sequencing of n-jobs through more than 2
machines
EXAMPLE (SAY n-JOBS THRU’ 3-MACHINES)
 Assumptions (in addition to whatever in case of
2-machines)
1) The smallest processing time on Machine ≠ 1 is
greater than or equal to the largest processing
time on Machine≠ 2;
2)The smallest processing time on Machine≠ 3 is
greater than or equal to the largest processing
time on Machine≠2.
 Re-write the given problem in the form of n-jobs
through 2-machines, as explained the following
numerical.
 Numerical
• 5 jobs have to be processed through 3 machines X, Y, & Z
in the order X→Y→Z . Processing times are given below :
Jobs Processing time in minutes
X Y Z
1 9 6 5
2 10 7 10
3 7 4 8
4 8 3 7
5 12 5 4
Find out i) sequencing, ii) Elapsed time, iii) Idle time and iv)
Waiting time.
 Numerical
Solution
• Convert this into two machines:
Jobs M/c ≠ G (X+Y) M/c ≠ H(Y+Z)
1 15 11
2 17 17
3 11 12
4 11 10
5 17 9

3 2 1 4 5
 Numerical

Job M/c X M/c Y M/c Z Idle time Waiting

Time Time Time Time Time Time X Y Z time
in out in out in out
3 0(+7) 7 7(+4) 11 11(+8) 19 - 7 11 -
2 7(+10) 17 17(+7) 24 24(+10) 34 - 6 5 -
1 17(+9) 26 26(+6) 32 34(+5) 39 - 2 - 2
4 26(+8) 34 34(+3) 37 39((+7) 46 - 2 - 2
5 34(+12) 46 46(+5) 51 51(+4) 55 9 13 - -