1 2 3

INTRODUCTION

Sequencing problem is the problem of determining an
appropriate order (sequence) for a series of jobs to be
done on a finite number of service facilities so as to
minimize the total time taken for finishing all the jobs.

If there are n jobs and m machines then the sequencing
problem is to determine the optimum sequence selected
among (n!)m theoretical alternatives, that is
technologically feasible.
ASSUMPTIONS

1. Only one operation is carried out on a machine at a time.
2. Processing times are known and do not change.
3. Each operation as well as the job once started must be
completed
4. Only one machine of each type is available
5. No inventory aspect of the problem is considered
6. An operation must be completed before its succeeding
operation can start.
7. Transportation time in moving jobs from one machine to
another is negligible.
IMPORTANT DEFINITIONS

Total elapsed time () is the between starting the first job and
completing the last one.

Idle time on a machine is the time the machine remains
idle during the total elapsed time.

No passing rule in a sequencing problem :
If each of then jobs is to be processed through two machines
M
1
and M
2
in the order M
1
M
2
then this rule means that each
job will go to machine M
1
first and then to Machine M
2

PROCESSING n JOBS on 2 MACHINES
(Johnsons method)
Let A
11
, A
21
, A
31

An1
be processing times of n jobs on Machine 1 and Let A
21
, A
22
,
A
32
. A
n2
be processing times of n jobs on Machine 2.
Step 1
Find the minimum processing hours in M
1
and M
2

Step 2
If the minimum is in M
1
machine write the Job sequence No in the Optimal
sequence table (write the sequence from left to right in the Optimal sequence
table) If the minimum is in M
2
machine write the job sequence No in the Optimal
sequence table (write the sequence from right to left in the optimal sequence table)
If there is a tie (i.e both M
1
and M
2
is equal then compare the lowest with other M
1
& M2 hours, which one is lower give the preference.
Step 3
Cancel the jobs already assigned in the optimal sequence table and repeat steps 1
to 2 until all the jobs have been assigned.

PROCESSING n JOBS ON 3 MACHINES
Let A
1
, A
2
, A
3
be the three machines. Let the order of operations be
A
13
, A
21
, A
3
. This problem can be converted into a two machine problem
if any one of the following conditions is satisfied.
Condition 1
Min A
i1
Max A
i2
(mini. time on machine 1 max. time on
machine 2)
Condition 2
Min A
i3
Max A
i2
(mini. time on machine 3 max. time on
machine 2)
The method fails if none of these conditions is satisfied. If one of the
conditions is satisfied , then the processing times on H and K machines are
given by
Hi = A
i1
+ A
i2
, i = 1,2,3.., n-1
Ki = A
i2
+ A
i3
, i = 1,2,3,., n
Now proceed to determine the optimal sequence as we discussed early
PROCESSING n JOBS ON m MACHINES

Let there be m machines A
1
, A
2
,., A
m
. This problem can be converted
in to a two machine problem if one of the following condition is satisfied..

CONDITIONS
If Min A
i1
Max Aij j = 1,2,3. m-1
or Min Aim Max Aij j = 2,3.., m

If any one of the condition is satisfies then
Hi = Mi1+Mi2+Mi3+..Mm-1
(Add from first machine to last before the machine)
Ki = Mi2+Mi3+Mi4+.Mij
(Excluding first machine then add up to last machine)
After getting the two machine type equations, then proceed the problem
like what we discussed in earlier methods.
MATHEMATICALLY APPLICATIONS
n JOBS 2 MACHINES
Find the sequence that minimizes the total elapsed time required
to complete the following tasks on machines M and M in the
order M , M. Also find the minimum total elapsed time

TASKS A B C D E F G H I

M1 2 5 4 9 6 8 7 5 4
M2 6 8 7 4 3 9 3 8 11







OPTIMAL SEQUENCE
MACHINE 1 MACHINE 2
MACHINE/
TASKS
M1 M2 ORDER OF
CANCELLATION
A 2 6 1
B 5 8 7
C 4 7 4
D 9 4 6
E 6 3 2
F 8 9 9
G 7 3 3
H 5 8 8
I 4 11 5
A C I B H F D G E
To find the minimum total elapsed time









Minimum total elapsed time = 61 time units
Idle time for machine M1 = 61-50 = 11 time units
Idle time for machine M2 = 2 time units
n JOBS 3 MACHINES
Find the sequence that minimizes the total elapsed time required
to complete the following tasks on the machines in the order
1-2-3.Find also the minimum total elapsed time (hours) and the
idle times on the machines.






Minimum time on Machine 1 = 3
Maximum time on Machine 2 = 5
Minimum time on Machine 3 = 5
Condition 1 Minimum time on Machine 1 Maximum time on Machine 2
Condition 2 Minimum time on Machine 3 Maximum time on Machine 2
Condition 2 is satisfying, hence we can convert this into 2 machine problem.

H = Machine 1 + Machine 2
K = Machine 2 + Machine 3











Optimal sequence
MACHINE H MACHINE K
A D G F B C E
To find the total elapsed time








The Minimum total elapsed time = 59 hrs.
Idle time on Machine 1 = 59-46 = 13 hrs
Idle time on Machine 2 = 3+2+5+4+4+7+12 = 37 hrs
Idle time on Machine 3 = 7 hrs


n JOBS m MACHINES
Solve the following sequencing problem giving an optimal solution
if passing is not allowed
CONDITIONS
Min M1 = 8 Min M4 = 14
Max M2 = 8 Max M3 = 8
Condition 1 Min M1 Max M2 &M3 condition is satisfied
Condition 2 Min M4 Max M2 & M3 Condition is satisfied
(if any one is satisfied proceed to next step)

Hi = Mi1+Mi2+Mi3 (except last machine) = 28, 26, 24,19
Ki = Mi2+Mi3+Mi4 (except first machine) = 29,33,30,26







Optimal sequence
Machine H Machine K

To find the total elapsed time







Minimum total elapsed time = 82 time units
Idle time on M1 = 82-42 = 40 time units
Idle time on M2 = 8+4+5+7+(82-50) = 56 time units
Idle time on M3 = 13+5+3+7+(82-57) = 53 time units
Idle time on M4 = 19 time units