b S e q u c i

349

Chapter 10

Job Sequencing Problems

10.1 Introduction
10.2 Basic Terminology

0.3 Principal Assumptions

0.4 Processing 'n' Jobs through Two Machines
(A and B)
10.5 Processing 'n' Jobs through Three Machines (A, B and
C)
Objective Questions
Exercise

10.1 INTRODUCTION:
In
any manufacturing process, materials flow through a succession of
machines or work stations to get transformed into finished
products.
It is important schedule the operations
to properly so that the
manufacturing facilities (e.g., machines) are properly utilized. The idle
ume of machines (the time interval
during which a machine remains
Vacant) should be minimized. Also, the total cycle time of the
manufacturing process (called as "elapsed time") should also be
minimized.
Sequencing model helps in determining the optimal sequence of jobs
which results in minimum elapsed time and minimum idle time of
machines.

10.2 BASIC TERMINOLOGY:

each machine.
Processing Time: The time required by eachjob at
Processing Order: The order in which machines are required for
completing the job.
 Sequencing Problems

350 Vipul'sM Operations Research (BMMSI

351
(3) Elapsed Time: The time between the starting of the first job and
Jobs Machiness
completion of the last job. A

(4) Idle Time: The time during which a machine remains waiting or
I
Processing Time (Hrs.)
vacant during the total elapsed time. 16
6
II 8
(5) Job Sequence: The order of completion of jobs.
2
In sequencing problem, involving 'n' jobs, there can be n!
a
TV
10
contributions of job sequences, out of which one or more sequences 12
V 10
will provide "minimum elapsed time." This sequence or sequences is 14
called "optimal job sequence". Determine

a) Sequence of
jobs to minimize total elapsed time.
10.3 PRINCIPAL ASsUMPTIONS: for each machine.
b) Idle time
(1) Each machine can perform only one type of operation and can Solution:

undertake only one job at a time. a The smallest processing time = 2hrs. (for job Ill on machine A)
(2) Only one machine of each type is available. Job Il to be scheduled first.
(3) All jobs require the same sequence of operations.
(a) In a two machines problem, each job is processed first on
i) Next minimum time 4hrs. (for job Il on machine B)
=

machine A and then on machine B.

Job II to be scheduled last.
(b) In a three machine problem, the sequence of operations is A, B,
C.
(4) The processing times of all jobs on all machines are known and tii) Next minimum time =
6hrs. (for job I on machine B)
remain constant. Job I to be scheduled before Job II (i.e. secondlast).
(5) Each job must be completed before another job is taken up for III
processing Next minimum time = 8hrs. (for job IV on machine A)
6) No job is required more urgently than the other. Job IV to be scheduled after Job II.
(7) Transit time to move a job from one machine to another is negligible.
II V slot
v) The remaining job, i.e. Job V will be placed in the empty
10.4 PROCESSING 'N' JOBS THROUGH TWO MACHINES IV vII|
(A AND B): Calculation (Hrs)
Elapsed Time Machine B
Example 1: Machine A
Job Out
There are five jobs I, I, II, V and V which need to be processed orn Out
In 2+10 12
two machines A and B in the order AB (i.e. first on machine A and then 2
zero 0+2 2 12+12=24
on machine B). 2 + 8 10 12
IV 2 24 +14 38
The processing time for these jobs machine A and B is given 24
on
V 10 10+10 20 38 +6 =44
below: 20+ 16 3 6
38
I 20 4444+4=4
36+8 44
"idle time
II36
= 48hours
)Total Minin Elapsed time
 h Sequencing Problems

352 Vipul'sM Operations Research (BMS idle time

353

Tolal Minimum
Elapsed time
T o t a lM i n i n

(b) Idle time on machine A= 48 -

44 = 4 hours 161 min.
time on
machine A= 161 -109 =52
Idle time on machine B = 2-0 =2
hours ldle

Min.
Example 2: on machine B =
16-0
le time
Four jobs I, II, I and IV are to be processed on two machines A and B
ldle

Example3:
=|16 Min.
in the order AB.
Processing Time (Min.) Five jobs 1, I1, IL, IV, V are to be
Jobs Machine A Machine B order
AB. processed on two machines A and B
the
n
47
I 26
Processing Time (Min.)
19 45 Jobs Machine A |
III 19 I Machine B
IV 16 34 35
20 40
Find: III 20 25
(a) Total elapsed time (minimum). V 15
(b) Idle time for each machine. V 10 18
Solution
Find:
Sequence of Allocations Minimum time (Machine) Job
16 (A) ) Total elapsed time (minimum).
1st IV IV b) Idle time for each machine.
Solution:
Sequence of Minimum time (Machine)
19 (A)
Allocations Job
2nd 19(B) I e
IV I I 5 (B)
IV
1st TV
Note: Job II allocated as for Job II time on other machine is less.
10 (A)
19 (B) V
2nd V
3rd VI
20 (A)
19 (B) II
3rd 20 (A)
4th IVI III| V
VII
Elapsed Time Calculation (Min.)
other machineis less.
Job Machine A Machine B Jo lI allocated as for lob II time
Note:JOb on

In Out In Out 20 (A) II

IV
0+16 16 *16 16+34= 50
IV zero 4th
50 50+45 = 95
II 16 16+19 35
35+2661 95 95+ 47= 142
35
III 61 61+48 109* 142 142 +19 (161)] 5th
 sequerirng
ng Problerns

354 Vipal' Operations Research (BMS) 35 (M)

355

40 (M) E
Elapsed Time Calculation (Min.) 7
Job Machine A Machine B F
In Out In Out G
V 7ero 0 10 10 10 10 18 28 Sequence- C D G F| El BA
10 10 20 30 30 30 25 55 Elapsed Time Calculation (in
30 30 20 50 55 55+40 95 Job Machine 1 Hrs)
50 50 45 95 95 95+35 130 In Machine 2
Out In
IV 95 95 15 110 130 130+5-135) Out
C 0 15
idie time 15 60
D 15 35 60 90
(a) Total Minimum Elapsed time =|135 min G 35 95 95 140
F 95 195 195
(b) ldle time on machine A= 135 110 =25 Min. E 195 270
235
270 305
B 270
ldle time on machine B =
(10-0)+ (30 - 28) =12 Min. 310 310 335
A 310 335
Example 4: (MU, April 2018) 335 350
There are 7 different *idle timne
products in a machine shop. Their
manufacturing time in Hrs. on machines 1 and 2 are given below: Each
of the
products must go through two machines 1 and 2 in the order 1-2.
Total Minimum Elapsed time =350 Hrs.
Products Time in Hrs on Time in Hrs on ldle time on Machine 11
Machine 1 Machine 2
=15 Hrs
A 25 15 ldle time on Machine 2 =
=[115 Hrs.
40 25
Example 5: (MU, April 2017)
C 15 45
D 20 30
Five jobs, I, I, II, IV and V are to be processed on two machines A
E 75 nd B in the order AB.
35
F 100 40 Processing time (minutes)
G 60 45 Job Machine A Machine B
(i) Find the optimal sequence of 90 70
products manufacturing that
minimizes the total elapsed time. 40 80
ii) Find the total Elapsed time for the 50
optimum sequence. 40
(iii) Calculate the idle time for machine 1. TV 30 10
(iv) Calculate the idle time for machine 2. 5
V 25
Solution: Find optimal sequence of jobs.
Sequence of Allocations Minimum time (Machine) Job (Product) ) Find total minimum elapsed hme
15 (M2) A ii) Find idle time for each
2 15 (M)
macn
C
3 20 (M1) D
25 (M2) B
 abSequencing P r

357
356
Vipul'sTM Operations Research (BMs Solution:

Sequence o f
mum time (Machine)
Solution: Allocations
Job
Sequence of Allocations Minimum time (Machine) Job 2 (A)
10 (B) IV
1st
25 (A)
40 (A) III 3 (B)
40 (A)
2nd 3(B)
5 I
V
Sequence=V n| | Lob V allocated as for Job V time on other machine is less.
Elapsed Time Calculation (Min.) 3 (B)
Job MachineeA Machine B 3rd
In t Out In Out
0 25 25 *25 35 60 4 (B)
25 40 65 *65 50 115
I 65 40 105 115 80 195
4th I V II V IV

I 105 90 195 195 70 265

IV 195 30 225* 265 10 (275) 5(A)
IVII V I
idle time 5th
Total Minimum Elapsed time 275 min.
Idle time on machine A = =50 Min. 6th II I V I V |I V
Idle time on machine B = = 30Min. Calculation (Hrs.)
Example 6: Elapsed Time Machine B
Machine A
Six jobs I, I, I1, IV, V, VI are to be processed on two machines A and Job n
Out
In Out
B in the order AB. 2+6 8
0+2 2 2
Processing Time(Min.) II zero
8
8+8 16
Jobs MachineA| Machine B 2 2+57 16+9 25
7+8 15 16
I 5 8 VI 7 25+4 29
25
II 2
IV 15 15+9 24 34
34+3 37
10 3 24+10 34
24 40
40+343
IV 9 4 34 +6 40*
V 6 34
VI 8 *idle time =43 Hrs
Find: (a) Total Minim Elapsed time
-3
Hrs
(a) Total elapsed time (minimum).
(b) Idle time for each machine. D) ldle time on machine
 quencing Problems
job!

358 Vipul'sM Operations Research (BMS

Find:
359
Totalelapsed time (minimum).
Idle time on machine B =
(2-0)+ (34 29) + (40-37) =
10 Hrs. (a)
(b) Idle time for each machine.A, B, C.
Solution:

10.5 PROCESSING 'N' JOBS THROUGH THREE MACHINES (smallest time on 'A
22 Hrs.
(A, B ANDc): AMIN

BMAX
(largest time on 'B)
22 Hrs.
(a) The problem of processing 'n' jobs on three machines can
be
converted into a problem of 'two machines' if ANY ONE of
the
AMIN2BM 3MAX, we can convert the
following conditions is satisfied: achines (G and H) problems. problem into a two fictitious
(i) The smallest time for any job on the first machine is greater than
or equal to the
largest time for any job on the second machine. To Ta+T
TH YB+Tc
AMIN2BMA
(ii) The smallest time for any
Processing Time (Min.)
job on the third machine is greater Jobs G
than or equal to the largest time for any job on the second I 43
machine. 44
II 47 46
CMIN2BMax| III 42 41
(b) If any of the above conditions is satisfied, the problem can be IV 42 45
converted into two fictitious machines, say G and H. V 43 39
For deciding the sequence of Allocations,
Time of G =Time of A+ Time of B Sequence of Minimum time (Machine) Job
Time of H = Time of B+ Time ofC
Allocations
c) Utilizing the fictitious machines G and H, the sequence of 39 (H)
Allocations is decided. 1st V
(d) For calculation of Elapsed time, the original time values of machines
A, B and C are used.
41 (H)
(e) ldle time of each machine is calculated.
Example 7:
2nd IIV
Five jobs I, I, II, V, V are to be processed on three machines A, B
and Cin the order ABC. 42(G) IV

Machine A
Processing Time (Min.)
Machine B Machine C
3rd IV
Jobs
I 22 21 23 43(G) I
II 25 22 24
23
4th
19 22
IV 22 20 25
V 24 19 20

5th
 TODiEIS
Job Sequencing

360 Vipul's Operations Research (BMs)

Elapsed Time Calculation (Hrs.) 361
Job Machine A Machine B Machine B
Jobs rocessing Time (Milin.)n
In Out In Out In Out 32 H
II
41 23
IV zero 0+22 22 22 22+ 20 42 42 42+2567 III 28
I 22 44 44 65 67 90 IV 34
27
44 69 69 91 91 115 V 22
92 41
III 69 *92 111 115 137 34
V 92 116 116 135 137 (157) Sequence of
*idle timne Allocations
Minimum time (Machine)
Job
(a) Total Minimum Elapsed time =157 Min.J 22 (H
1st
(b) Idle time on machine A= 157- 116 = 41 Min. V V
Idle time on machine B 22 +2+4+1+5+22
=
= 56 Min. 23 (H)

ldle time on machine C =42 +1 = 43 Min.

2nd
L IV
Example 8:
Five jobs I, II, II, V, V are to be processed on three machines A, B
27(H)
3rd
and C in the order ABC. IIIV
Processing Time (Min.)
Machine A | Machine B Machine C 28(H)
Jobs 4th
20 12 11
26 15 13
24 10 17
IV 22 14
V 23 18 16
5th VI IIV
Find: (Hrs.)
(a) Total elapsed time (minimum). Elapsed Time Calculation Machine B
Machine B
A, B, C.
Job Machine A Out
(b) Idle time for each machine Out In
In Out In
*41 57
Solution: V 41
zero 23 *23 77
Minimum time on machine A = 20 Min. b4
64
23 49 49 100
machine B = 18 min 83
Maximum time on 83
49 73 73 *105 116
105
Since, AMIN BMAx. I 73 93 93 123 (137
123
two fictitious machines' problem. IV 93 115 *115
. We this into a
can convert

Machine G and H are two fictitious

machines. *idle time =137
Min.

Te TA+T a) Total Minimum Elapsed time

=22Min.
TH= TB+Tc
(b) ldle time on machine A= 137-11
 quencing Problems

362 Vipul'sTM Operations Research (BMS) 363

Find:

Idle time on machine B = 23 +8+9+ 10 + 10+14 =|74 Min.

rotal m i n i m u
elapsed time.
(b) Idletime for each machine.
bsb s I, II, II, IV
V are to be
Idle time on machine C = 41 +7 + 6+5+7
=66 Min 2 F o u rj o

order AB.
processed on two machines A
and B in the

OBJECTIVE QUESTIONS:
Processing Time (Min.)
Jobs Machine A |
(1) Fill in the blanks with appropriate words given below:
28
Machine B
49
(a) The time required by each job on each machine is called
21 7
time.
50 21
(b) The order in which machines are required for completing the jobs is
IV 18
called 36
(c) The time between the starting of the first job and completion of the Find:

lastjobin sequencing problems is called (a) Total minimum elapsed time.

d) the time during which a machine remains waiting or vacant in each machine.
(b) Idle time for
sequencingproblem is called time. E i v e iobs I, I, l , IV, V are to be
processed on two machines A and B in the
(e) In sequencingproblem, the order of completion of jobs is called order AB.

Processing Time (Min.)

Ams.: (a processing); (b - processing orderh c - elapsed time;
Jobs Machine A MachineB
(d-idle); (e -job sequence)] 90 70
(2) Match the followingg
40 80
Group 'A' Group 'B'
40 50
Processing time (i) Total time between starting of 1st job and|
(a) 10
completion of last job IV 30

V 25 35
(b) Idle time (ii) Time required by a job on any machine
(ii) The order in which machines are required
(c) Elapsed time Find:
for job completion (a) Total minimum elapsed time.

(d) Processing order (iv) The time during which a machine is waiting (b) Idle time for each machine.
A and B in
or not working two machines
VI to be processed on
SIX jobs I, II, III, IV, V,
are

[Ans.: (a- ii); (b -iv); (c- i); (d- ii) the order AB.
Processing Time (Hrs.)

Machine A Machine B
EXERCISE: Jobs 10
be processed on two machines A and B in the
(1) Five jobs I, II, III, IV, V are to
4
order AB.
Processing Time (Hrs.) 12
Machine A Machine B 11
Jobs IV
8 3 8
V
4 10
II VI
Find:
IV 6
(a) Total minimum elapsed time.
V 7
(b) Idle time for each machine.
 uencing Prob
jobSequencing Problems
364
Vipul'sM Operations Research (BMS)
jobs I, I1, III, IV are to be 365
(5) Five jobs I, II, IIL, IV, V are to be processed three machines A, ler ABC. process three
the order ABC.
on B and C in the machine: A, Band Ci n
Processing Time (Hrs.) Processing Time (Hrs.)
Jobs Machine A Machine B
Jobs Machine A Machine B Machine C
I
Machine C 14
12 11 13 I 17 24
15 12 14 14
18 10
13 9 12 14
IV 23
V 12 9
10 9
V 14 9 Find:
10
Find: (a) Total elapsed time (minimum)
(a) Total elapsed time (minimum). (b) Idle time for each machine A, B, C.
(b) Idie time for each machine A, B, C.
6) Five jobs I, II, I, IV, V are to be
the order ABC.
processed on three machines A, B and C in

Processing Time (Hrs.)

Jobs Machine A | Machine B Machine C
I 10 12 20
12 15 26
18 10 24
21 8 22
V 15 18 23
Find:
(a) Total elapsed time (minimum).
(b) Idle time for each machine A, B, C.
(7) Four jobs 1, I, IL, IV are to be processed on three machines A, B andC in
the order ABC.
Processing Time (Hrs.)
Jobs Machine A | Machine B Machine C
9 6 7
11 8 10
12 5 8
IV 10 9 5
Find:
(a) Total elapsed time (minimum).
(b) Idle time for each machine A, B, C.