Objective Oriented Learning Process RBT
• Branch: Mechanical Engineering
• Semester : VII
• Subject code & Title: 18ME703 & Operations
Research
• Topic : Sequencing Problem - Introduction, Types - n
jobs with 2 machines and with 3 machines.
• Faculty Name : Mr E Sakthivelmurugan
Sequencing problem
• Definition: To determine the order or sequence in which the jobs are to be
processed through machines so as to minimize the total processing time.
Here the total effectiveness, which may be the time or cost that is to be
minimized is the function of the order of sequence. Such type of problem is
known as sequencing problem.
• Suppose there are n jobs (1, 2…n) each of which has to be processed one at
a time at each m machines A, B, C…The order of processing each job
through each machine is given. The problem is to find a sequence among
(n!)m number of all possible sequences for processing the jobs so that the
total elapsed time for all the job will be minimum.
Terminology and Notations
• Number of machines
• Processing order
• Processing time
• Idle time on a machine
• Total elapsed time
• No passing rule
Assumptions
(a) The processing times Ai and Bi etc. are exactly known to us and
they are independent of order of processing the job on the machine.
That is whether job is done first on the machine, last on the
machine, the time taken to process the job will not vary it remains
constant.
(b) The time taken by the job from one machine to other after
processing on the previous machine is negligible.
(c) Each job once started on the machine, we should not stop the
processing in the middle. It is to be processed completely before
loading the next job.
(d) The job starts on the machine as soon as the job and the machine
both become idle (vacant). This is written as job is next to the
machine and the machine is next to the job.
(e) No machine may process more than one job simultaneously.
(f) The cost of keeping the semi-finished job in inventory when next
machine on which the job is to be processed is busy is assumed to be
same for all jobs or it is assumed that it is too small and is
negligible. That is in process inventory cost is negligible.
(g) While processing, no job is given priority i.e. the order of completion of
jobs has no significance. The processing times are independent of sequence
of jobs.
(h) There is only one machine of each type
Types of Sequencing Problems
• (a)‘ n’ jobs are to be processed on two machines say
machine A and machine B in the order AB. This means
that the job is to be processed first on machine A and then
on machine B.
• (b)‘ n’ jobs are to be processed on three machines A,B
and C in the order ABC i.e. first on machine A, second on
machine B and third on machine C.
• (c)‘ n’ jobs are to be processed on ‘m’ machines in the
given order
• (d) Two jobs are to be processed on ‘m’ machines in the
given order.
‘ n’ jobs are to be processed on two machines
Problem 1
• There are five jobs, which are to be processed on two machines A and B in
the order AB. The processing times in hours for the jobs are given below.
Find the optimal sequence and total elapsed time.
Jobs 1 2 3 4 5
Machine A (hrs) 2 6 4 8 10
Machine B (hrs) 3 1 5 9 7
Optimal Job Sequence
1 3 4 5 2
Total Elapsed Time Calculation
Job Machine A Machine B Idle time of
sequence machines
In Out In Out A B
1 0 2 2 5 0 2
3 2 6 6 11 0 1
4 6 14 14 23 0 3
5 14 24 24 31 0 1
2 24 30 31 32 2 0
Result:
• Total elapsed time = 32 hours
• Idle time of machine A = 2 hours
• Idle time of machine B = 7 hours
‘ n’ jobs are to be processed on three machines procedure
(a) Identify the smallest time element in the first column, i.e. for machine 1 let
it be Ar.
(b) Identify the smallest time element in the third column, i.e. for machine 3,
let it be Cs
(c) Identify the highest time element in the second column, i.e. for the center
machine, say machine 2, let it be Bi.
(d) Now minimum time on machine 1 i.e. Ar must be ≥ maximum time
element on machine 2, i.e. Bi
OR
Minimum time on third machine i.e. Cs must be ≥ maximum time element
on machine 2 i.e. Bi
OR
Both Ar and Cs must be ≥ Bi
(e) If the above condition satisfies, then we have to workout the time elements
for two hypothetical machines, namely machine G and machine H. The
time elements for machine G, Gi = Ai + Bi.
The time element for machine H, Hi = Bi + Ci
(f) Now the three-machine problem is converted into two-machine problem.
We can find sequence by applying Johnson Bellman rule.
(g) All the assumption mentioned earlier will hold good in this case also.
Problem 1
• There are 5 jobs each of which is to be processed on three machines A, B,
and C in the order ACB. The time required to process in hours is given in
the matrix below. Find the optimal sequence.
Job 1 2 3 4 5
Machine A 3 8 7 5 4
Machine B 7 9 5 6 10
Machine C 4 5 1 2 3
• Machine in ACB order:
Job 1 2 3 4 5
Machine A 3 8 7 5 4
Machine C 4 5 1 2 3
Machine B 7 9 5 6 10
• 3 machine into 2 machine problem:
Jobs 1 2 3 4 5
Machine G (hrs) 7 13 8 7 7
Machine H (hrs) 11 14 6 8 13
• Optimal Job sequence:
Optimal Job Sequence
5 1 4 2 3
Total Elapsed Time Calculation
Job Machine A Machine C Machine B Idle time of
seque machines
nce In Out In Out In Out A C B
5 0 4 4 7 7 17 0 4 7
1 4 7 7 11 17 24 0 0 0
4 7 12 12 14 24 30 0 1 0
2 12 20 20 25 30 39 0 6 0
3 20 27 27 28 39 44 17 18 0
Result
• Total elapsed time = 44 hours
• Idle time of machine A = 17 hours
• Idle time of machine c = 29 hours
• Idle time of machine B = 7 hours
Problem 3
• A machine operator has to perform three operations, namely plane turning,
step turning and taper turning on a number of different jobs. The time
required to perform these operations in minutes for each operating for each
job is given in the matrix given below. Find the optimal sequence, which
minimizes the time required.
Problem 4
• A machine operator has to perform two operations, turning and threading,
on a number of different jobs. The time required to perform these
operations in minutes for each job is given. Determine the order in which
the jobs should be processed in order to minimize the total time required to
turn out all the jobs.
Problem 5
• Find the optimal sequence that minimizes the total elapsed
time required to complete the following tasks on two machines
I and II in the order first on Machine I and then on Machine II.
Problem 6
• There are seven jobs, each of which has to be processed on
machine A and then on Machine B (order of machining is AB).
Processing time is given in hours. Find the optimal sequence
in which the jobs are to be processed so as to minimize the
total time elapsed.
