Unit - II

Sequencing Problems
Johnsons Rule

1
 Sequencing Problems
N Jobs in M machines
Characteristics:
There are N Jobs designates as J1, J2, J3,. Jn.
Each Job is processed in M machine described as M1, M2, . Mm.
No passing of Job is permitted. All Jobs are done in the same order
i.e. M1-M2-M3-..-Mm-1-Mm
The actual processing time m11, m12,,mnm are known in
advance
 Sequencing Problems
N Jobs in M machines
Solution Principle:
As usual this N-job by M-machine can be reduced to a Two machine N
job model provided one of the following condition is satisfied.

The smallest processing time in M1 is greater or equal to the

maximum processing time in M2, M3, M4,.. Mm-1.
The smallest processing time in Mm is greater or equal to the
maximum processing time in M2, M3, M4,.. Mm-1.
 Sequencing Problems
N Jobs in M machines
Solution Principle:
On satisfying the conditions the M machine problem is reduced to a
two machine model by creating two hypothetical machines as follows:

Di = mi1+mi2+mi3+mi4+..+mim-1
Ei = mi2+mi3+mi4+..+mim-1+mim

Once the reduction is done, we use the routine Johnson method for
finding the optimum sequencing.
 Sequencing Problems
Johnsons Rule Algorithm
Rule 1: Look at the processing time through M1: m11, m12 m1n and
similarly for M2: m21, m22 m2n. Select the job with smallest time
component.

Rule 2: If m1r is the smallest, then the associated job Jr will be taken up
first in the machine M1.

Rule 3: If m2s is the smallest, then the associated job Js will be taken up
last in the machine M2.

Rule 4: If m1r = m2s and are the smallest, then the job Jr first in the
machine M1 and do the job Js last in the machine M2 .
 Sequencing Problems
Johnsons Rule Algorithm
Rule 5: If m1r = m1p and are the smallest, then do either Jr-Jp order or
Jp-Jr order, first in the machine M1.

Rule 6: If m2s = m2t and are the smallest, then do either Js-Jt order or
Jt-Js order, last in the machine M2.

Rule 7: Eliminate the decided job(s) from the analysis and repeat steps
1 to 6 for sequencing the remaining jobs. Continue this process by
placing these jobs next to the first or preceding to the last, as the case
may be.
 Sequencing Problems
Johnsons Rule Algorithm
Rule 8: After placing all the jobs we simply calculate the overall time
elapsed, as the time between the start time of job 1 in machine M1 and
the finish time o the last job in machine M2.
Calculation of Idle time:
Sequencing does not keep both machines fully engaged. Sometimes
M2 is kept idle till the needed job gets completed in M1 because of
M1M2 order. Similarly if all jobs go for second round, M1 will have to
wait for the completion of last job in M2.
Idle time of machine M1 = completion time of last job in M2
completion time of last job in M1.
Idle time of machine M2 = sum of all idle times from the very
beginning till the end.
 Sequencing Problems
N Jobs in M machines
Problem 1: The time cost (in days) to do four jobs in five machines
are given below. Obtain the optimum sequencing by using Johnsons
rule. Job order is M1-M2-M3-M4-M5

Machines
Jobs
M1 M2 M3 M4 M5

J1 7 5 2 3 9

J2 6 6 4 5 10

J3 5 4 5 6 8

J4 8 3 3 2 6
 Sequencing Problems
N Jobs in M machines
Machines
Jobs
M1 M2 M3 M4 M5
J1 7 5 2 3 9
J2 6 6 4 5 10
J3 5 4 5 6 8
J4 8 3 3 2 6

Smallest processing time on M5 (6 days) is greater than or equal to

the largest processing time on M2 (6 days), M3 (5 days), and M4 (6
days),.
Hence Johnsons rule could be applied.
 Sequencing Problems
N Jobs in M machines
Create hypothetical machines M6 and M7 such that jobs hours of M6
is (M1+M2+M3+M4) and jobs hours of M7 is (M2+M3+M4+M5)

Machines Hypo. Machines

Jobs
M1 M2 M3 M4 M5 M6 M7

J1 7 5 2 3 9 17 19

J2 9 6 4 5 10 21 25

J3 5 4 5 6 8 20 23

J4 8 3 3 2 6 16 14
 Sequencing Problems
N Jobs in M machines
Perform the regular algorithm of Johnsons rule to these two new
machines M6 and M7

Machines Hypo. Machines

Jobs Rank
M1 M2 M3 M4 M5 M6 M7

J1 7 5 2 3 9 17 19 1

J2 9 6 4 5 10 21 25 3

J3 5 4 5 6 8 20 23 2

J4 8 3 3 2 6 16 14 4
 Sequencing Problems
Final result with idle time

Total Time required = 51 days

 Sequencing Problems
N Jobs in M machines
Problem 2: The time cost (in days) to do six jobs in four machines
are given below. Obtain the optimum sequencing by using Johnsons
rule. Job order is M1-M2-M3-M4

Machines
Jobs
M1 M2 M3 M4

J1 6 5 3 4

J2 7 2 5 5

J3 9 6 3 3

J4 8 5 5 4

J5 8 3 4 3

J6 9 5 5 4
 Sequencing Problems
Final result with idle time

Total Time required = 57 days