Sequencing Problem

"An order is to be
observed in all
things"
INTRODUCTION
NT an appropriate
f an
order for a series of jobs
ate order
to be
g e l e c t i o no f a n
done on a finite number of service
e-assigned order, is called sequencing.
ne pre-as A
ach of which
products, practical situation may correspond
respond to
s t t yproducinga
liies
of is to be to an
processed through different machines,
finite in number. ber. machines,

PROBLEM
OF SEQUENCING
af
of machine operator who has to perform three
a oD knurling on a finite number of different jobs. Letoperations,
there be sixnamcly (i) turning,
jobs and the time
p r o b l e m

hreading,
MRsider and( i )
these operations
rform these
R q u i r e dt op e r f o r
operation (in minutes) for each job is known. Also it is given that each job
ied 1o gthen for threading, and lastly for knurling. The problem of the machine operator
turn
goshich
o decide whic
job should be processed first, which to process next, and so on, i.e., the order
jobs for the above-mentioned operations in order to minimize the total time required
Keguence)oft
quen the jobs. This
This is an example of six-job and three-machine sequencing problem. We now
out all the jobs.
o tuTn the general
case.

nsider Let there be n jobs to be performed one at

sequencing problem may be defined as:
The general The sequence (order) of the machines in which each job should
be
hie on each of m machines. time required by the jobs on each of the machines is also
rmed is given. The actual or expected
therefore, is to find the sequence out of (n !y" possible
en The general sequencing problem, time between the start of the job in the first machine and
euences which minimize the total elapsedmachine.
last job on the last
hecompletion of the
underlying a sequencing problem
Given below are the assumptions to completion on that
machine.
machine, is to be performed up
I. Each job, once started on a
of the order of the
Such a time is independent
each machine is known.
2. The processing time on

ps in which they are to be processed. negligible.

from one machine to another is
over
S. The time taken by each job in changing idle and job is next
and the machine both
are

the machines as soon as the job

A JOb starts on next to the job.
Ne machine and the machine is also

more one than job simultaneously. is to be given priority. The

machine may process i.e., no job
6. h of job has no significance,
Order of completion
O Completion of jobs is independent
of sequence of jobs.
328
SEQUENCING
OPERATIONSNS RESPESES
USED IN
12:3. BASIC TERMS
are
in sequencing
terms
of the basic number of service facilities
ties thw.
Some
It refers to the
1. Number of machines:be completed.
through which ioh. a

pass before it
is assumed to
2. Processing
order: It refers to the
order (sequence) in which given
machines are required g
manL:

completing the job. each

It indicates the time required by a job on machine
3. Processing time: between starting the first iob and
It is the time interval
4. Total elapsed time:
job including the idle time (if any) in a particular order by the given set of machines completingthethe lay
machine: It is the time for which a not has a
machine does not
have jod
5. Idle time on a to
the end of job (i-1) to the start job i. of proCe
i.e., idle time from
No passingrule: It to
refers maintaining the order in whieh
the rule of
6.
processed on given machines. For example, if n jobs are to be processed through thre jobs are to be
M, and M in the order Mi, M2,
and M3, then this rule will mean that each job will. nachines M
M first, then to M and lastly to M3 machine
12:4. PROCESSING n JOBS THROUGH TWO MACHINES
Let there benjobs, each of which is to be processed through two machines, say M, and M
order M,M. That is, each job has to pass through the same sequence of operations. In other a in the
job is assigned machine M, first and after it has been completely processed on
on rds, a
machine M. it is
assigned to machine M2. If the machine M2 is not free at the moment for processing the same
ne
then the job has to wait in a waiting line for its turn on machine M2, .e., job,
i
is not
= 1, 2;:j = 1, 2, .., n) be the time required for processing ith job on the jth machine.
passing allowed Ie
Since
passing is notallowed, therefore machine M, will remain busy in processing all the n
iobs
one-by-one while machine M2 may remain idle after completion of one
job and before starting of
another job. Thus the objective is to minimize the idle time of the second
machine. Let X be the time
for which machine M2 remains idle after
finishing (j-1)th job and before starting processing the jth
job 1, 2, n). Clearly, the total elapsed time Tis given by
..,

T
where some of the X;s may be zeros.
The problem now is to minimize T. However, since E is the total time for
has to work and is thus fixed, it does not form a part of thetp: which machine Ma
reduces to that of
minimizing 2 X. A very convenient procedureoptimization problem. Thus, the proe
for obtaining a sequence
performing jobs to minimize 2X is well
illustrated by the following Gantt Chart
Utilised time
ldle time on M
M f13 4 15
n
Mat an
Ka1 l2a22 22 23 24 25 2n
Time taken in hours
Fig. 12.1 Gantt Chart
 NG PROBLEM

ENC) 329
it 8
in apparent that
chart,
chart,

From
the

if t
n>Xz1 + bz
for
Theexpression for
sion X22 may be rewritten as otherwisec
X22 Max, { t12-Kzi -I21. 0)

Thus X+ X22 Max, jt12-21 u since Na y

S i m i l a r l y

X23 Max. (u+ i2+ Iis- h1-2-X21-Xn. 0}

This gives

X21 + X22+ X23 Max,

Max
we have
In general,

yMax
Max. -
1SSn

Now, if we denote, Xay by D, (S), then the problem becomes that of finding the sequence

S for processing the jobs 1, 2, . , n so as to have the inequality D, (S) SD, (S) for any
qpence &Syother than <S">, In other words, one has to determine an optimal sequence so as to
ninimize D, (S) applying the above rule. This can be achieved iteratively by successively
terchanging the consecutive jobs. Each such interchange of jobs gives a value of D, (S) smalie
r cqual to its value before the change.

Optimum Sequence Algorithm

Theiterative procedure for determining the optimum sequence forn jobs on 2 machines can be
ummarized as follows
Step 1: List the jobs along with their processing times in a table as shown below :

Job number J J Js
Processing time on machine M 12 t13 tn
Ma 21 I22 23
Sep 2. Examine the rows for processing times on machines M, and Ma, and find the smallest
MOCessing time in each row, i.e., find out min. (p t2) for all j.

f the smallest processing time is for the first machine M, then place the coresponding
in the first available position in the sequence. If it is for the second machine, then place the
espondin
ATTesp ndng job in the last available position in the sequence.
Step 4. If there is a tie in selecting the minimum of all the processing times, then there may be
re situations
for the machine, i e., min (t1 2)= lu= I2 then
ee the um among all processing times is same
HOCss kth jobfirst and the th job last.
 OPERATIONS RESEARC
330 machine M. Monly,
times
1, on
for the minimum occurs among processing then seloe
elec
(b) Ifthe tie
arbitrarily the job
to process
first.
occurs among
processin8 ly M, times on
chine
machine
then
for the minimum seles
(c) If the tie
arbitrarily the job processlast.
to
assigned and repeat steps
through 4, placine acing the remaini
offthe jobs already bcen assigned.
Step 5. Cross until all the jobs have
or next to last,
jobs next to first for machines M and M
Calculate idle time in a sequence finich
Step 6. time (time when the last Job
Total elapsed
(a) ldle time for M,
=
finishes on M,
the first job in a sequence
Time at which
(6) ldle time for M
=

in a sequence starts on M,)

2 ((time when thejth job
j1 in a sequence finishes on M.1
1)th job
-

(time when the (j- is

through two machines as under
time to process all jobs
Step 7. The total elapsed
job 1n a sequence finíshes on machin .
Time when the nth
Total elapsed time
=

job on machine M.
required for processing jth
Time
job
where processing (j- 1)th and
=
l remains idle after
Time for which machine M2
before starting work on jth job.
of n jobs on two machines gives us the
ne
Note. The procedure outlined above for the processing
minimum total elapsed time.

SAMPLE PROBLEMS

should go through two machines

to perform, each of which
1201. In a factory, there are six jobs the jobs are given here. You are
A and B, in the order A, B.
The processing timings (in hours) for
determine the sequence for performing the jobs that would minimize the total elapsed tine,
required to
T. What is the value of T ?
Job J Js J4
5 6 3
1 3 8
Machine A 2 2 10
6 3
Machine B [Madras M.B.A. 204)
Solution. The smallest processing time in the given problem is 1 on machine A. So, pertorm

in the beginning as shown below

The reduced set of processing times becomes

6
Job 2 4
3
Machine A 3 8 5 6
10
Machine B 3 2*
both
The minimum processing time in this reduced problem is 2 which coresponds to J4 and s t h e
machine B. Since the corresponding processing time of Js on machine A 1s larghall

corresponding processing time of J4

on machine A, Js will be processed in the last and a
processed next to last, The updated job sequence is
 M I N G1 1 O l E M

331
proceeing tlmoN A
ling
elm

M hne

Manhine
iin tieamong Jobs
tie for the amallent 10
NiN,
lhere

.on maehine A, and to J, on processing

time In this reduced
problem. 'These
machine . As the
m m n h
is larger than the coiesponding
processing time of
corresponding
processing lime
l0Now step 4(a) applien and J, ahould be J, machine B,
Nau on
placed next. The updated job J, wil is
iesl
A, be
m rl
sequence

This arquece
ta the
in optlimum
the optlmum one, The total
elupsed time In
Marhine A
caleulated below
Machlne
Out Idle time on B
Out
6
6
16
16 22
15 22
15 25
20 25
20 26
27
27 29
From the above informntion, wo get T 29 hours.
1Mletime of machine A is (29 26)= 3 hours and that for
The Gantt chart for the ubove machine B is one hour.
problem can be illustrated as below:

Machine A
Machine BX21

LILL
3 LLLLLLLLILLLLLLLLL
1 2 16 18 21 24 27 30

Flg. 12.2
202. A book binder has one
Niber of dilferent books. The time printing press, one binding machine, and the
manuseripts of a
required to perform the printing and binding operations
shown below, Determine the order In which books should be for each
Nlotal time requlred to turn out all the processed, in order to minimize
books
Book 2 3
Printing Ume (hrs.) 30 120 50 20 90
Binding tinme (hrs.) 80 100 90 60
100
30 10
Soluti, Panjab B.Com. 2006)
P. Here, the books
. ) denotes thewilltimefirstin gohours
a1,2, 6 to the printing press and then on the binding
machine. If
ime on printing press and
B, (i l, 2, 6) the bindingg =

OOks, then since min. {P, B 10corresponding to B. book 6 will be processed in the
problemn then reduces to the
following five and two machines :
 OPERATIO PEREMA
332 3 4
2
Rook 120
50 20
30 90 50
P 80
00
B Therefore, book 4 will be
Pa
which corresponds tocells sed just in
Now, Min. ({P, B}= 20 below
entries are
the sequence
shown in
as
t
heginning. The

left with 4 books and two

two
After assigning
books 4 and 6, we are now machines with
as follows
th
processing times 2 3
Book 20 50
30 90
100 90
80 30
B corresponds to P and B,, i.e., there
which
Now, the minimum of P and B, is 30 a tie for
So, place book I next to the first and book 5 next
to the last, us the yielding the
minima. we
sequence,
||6J
2 machines with their respective
We are now left with the problem of 2 jobs and nroa.

fimes
as follows
Book 2 3
P 120 50*
100 90
Here, since smallest printing time is 50 hours for book 3, we place book 3 in the third cell
and
the remaining book 2 in the fourth cell and get the following optimal sequence

The minimum elapsed time from the start of the first book to the completion of the last hot
corresponding the optimal sequence is computed as shown in the following table

Book
Printing machine Binding machine ldle time of
Timein Time out Timein Time out binding machine
0 20 20 80
20 50 80 160
50 100 160 250
100 220 250 350
220 310 350 380
310 420 420 430
From the above table it is clear that minimum
machine is 10 hours (from 420 hours to 430 elapsed time is 430 hours. ldle tume ror
hours) and for binding machine is 20+40 0U =

Remarks 1., It may be noted that the total

machine and the total processing time on elapsed time is equal to the sum of the idle time of binding
2. The total- elapsed time
binding machine.
can also be calculated
by using Gnatt chart.
PROBLEMS
1203, We have five jobs, each of which rder Ab.
must go through the
Processing times in hours are given in the table two machines A and D"

Job() belowN
Machine A(A) 3
10
Machine B(B) 9 3
Determine a sequence 7 8 Panjab M.CA.0
for the five
jobs that will minimize the elapsed time.
SEQUENCINGP R O A
PROBLEM
333

ceady-made garment company has to process 7 items through two stages of production, viz., cutting
The time taken by each of these items at the different stages are given as
sewing.

3 6
tem
3 12
Cutting
6 8
ewing
r d e r in
in which seven items are to be processed so as to minimize the total processing time.
which these seve
an
order
Pind Delhi M.Com. 2010]

company
has six jjobs on hand coded 'A' to 'F". All the jobs have to go through two machines 'MT
1205. A time required for each job on each machine, in hours, is given below
uir. The
A C D
3 12 18 9 15 6
MI 18 24 15
9 24
M II
sequence
table eduling the six jobs on the two machines. Punjabi M.BA. 2005
Draw a
a Seven jobs are to be processed on two machines A and B in the order A B. Each machine can
120

process
only one job at a time. The processing times (in hours) are as follows
2 3
Job
0 12. 13 16
Machine A
15 11 16
Machine B
sequence of processing the jobs and the total elapsed time. IDelhi M.Com. 2006]
Suggest optimum
07, the
In machine
below
shop, 8 different products are being manufactured each requiring time on two machines
A and B as given
Product Time (in min.) on machine A Time (in min.) on machine B
30 20
45 30
15 50
V 20 35
80 36

VI 120 40
VII 65 50

VII 10 20
Decide the optimum sequence of processing of different products in order to minimize the total manufacturing
time for all the products. Name and discuss the scheduling model used.
[A.I.M.A. P.G. Dip. in Management (June) 1996]
1208. The maintenance of a company is divided in two parts C and C2 which cares for the maintenance
crew
the parts which
ofarethewomseven machines M1, M2».., M in the factory. Crew C is responsible for replacement of
out while crew C2 oils and resets the machines back for operation. The time required by crews C and

C on different machines is given below:

Maintenance time (in hrs.)
Machines Crew C2
Crew C
24 10
M 20
14
M 22 8
M3
20 18
Ma
30 10
Ms
28
M6
16
M
in what order the machines should be handled by crew C1 and C2 so that the total time taken is minimized.
us0 determine what shall this time be?
334 OPERATIONS RE
12:5. PROCESSING n JOBS THROUGH k MACHINES ESEARCO
method available by which we can obtain optimal sequene
cels) inin problems
There is no general handled only by entm Dral.
machines. They can be
involving processing
and
of n jobs on k

time-consuming exercise because a total

of (n !)* diff different sequencesation,
wouldwhich
very lengthy method applicable under the co
consideration in such a case. However,
we do have a

and if either or both of

the conditions stipulated below o n tha
cond Teaire
passing of jobs is permissible
is to be processed through k machines, say M
Let there be n jobs, each of which
the order Mp The list of jobs
M, Ma ...
with their processing times is M, m
Job Number
3
Mi 12 13
Ma I21 t22 t23
Processing time 33
Ma 32 **

on machine

M k3
kn
An optimum solution to this problem can be obtained, if either or both of the followinc.
hold
(a) min. '1j2 max.
ij for i
2, 3, ..k-1,
or (b) min. tj2 max.
lij, for i 2, 3, ..k-1.
Optimal Sequence Algorithm
The iterative procedure for determining the optimal sequence for'n' jobs on "* machines can he
summarized as follows
Step 1. Find min. I1j, min. tj and maximum of each of
for all j = 1, 2, .., .
Step 2. Check the following
(a) min. 1j2 max.ij for i 2, 3, .., k-1
or (b) min. tj2 max. Iij, for i = 2, 3, , - .
Step 3. If the inequalities of step 2 are not satisfied, method fails. Otherwise go to next step.
Step 4. Convert the k machine problem into a two-machine problem by introducing two fictitious
machines G and H, such that
GjIj + j t . +k-1,j
and
'Hj 2 t jt.+ 1j
Step 5. Determine the optimal sequence for the n' jobs and 2' machines
equivalent sequeneing
problem with the prescribed order GH in the same way as discussed earlier. The
shall be optimum for the given problem. resulting sequE
Remarks 1. In addition to conditions given in
Step 4, if
is a fixed positive constant ay+'yt.+1,C
for all j = 1, 2,
n, then determine the d
two machines Mj and M,
.,
optimal
Mgk by using the optimal sequence sequence
in the order
M1,
for n Jo0d aan
2. In addition to the conditions
given in Step 4, if algorithm.

then there will be n!

'y and
aj tnj forj =1, 2,
optimal sequences, each of which will
yield minimum total elapsed ume:
3. The
above-mentioned procedure of solving the
sequencing The
method is applicable only to those problems
is not a
general pro elof
sequencing problems in which the minimum cost
 335
hlugh irst and/or last machine Is greater than or
Rihe foty
There are many industrial
tiooro maehinos.
. equal to the cost of processing
M H e wier whieh
whleh does not obey this rule, operations, in which the machines are
uter
SAMPLR PROBLEMS
ethe eptimal sequence of jobs that minimizes the total elapsed time based on the
e epesing time on machines isgiven in hours and passing is not allowed:
D
4
G
4

MA 11 5 12
Delhi M.Com. 2006; Visvesvaraya M.B.A.
(June) 2011)
given 7 jobs each ot which is to be
Nwerien. We
We are processed through 3 machines M. M, and
onder M, M, M,
4the
ar 7 and k= 3; we observe that min. ty = 3, min. t3 = 5 and max.t = 5. Since
Thevefve,for
is satisfied, the problem can be converted into that of 7 jobs and 2 machines.
is satisfi
max. y
the two machines, such that
G and H are
if
G y+
H- y+ y for j = 1, 2, 7
nhiem can be rewritten as the following 7 jobs and 2 machines problem
C D E F G
3+4= 7 8+ 3 = 11 7+2 9 4 + 5 = 9 9+ 1 10 8 + 4 12 7+ 3 10
R 4+6= 10 3 + 7 = 10 2+5 = 7 5+ 11 = 16
4+6 10 3 + 12 =15 1 + 5 =6
Isine the optimal sequence algorithm, the following optimal sequence can easily be obtained :

ADG BFCE
Fr totai elapsed time, we have
Job
A D G B F C E
7 4 22 30 37
In:
14 22 30 37 46
Out:
22 30 37 46
n inc7 o14
12 17 25 34 39
Out:
6 43 49
In 13 24
M 49 54 59
Out 13 24 36 43
time is 13 hours for
his table indicates that the minimum total elapsed times is 59 hours. Idle
,37 hours for M2 and 7 hours for M3.
the machines M, G
=
1, 2, ) in the
We have 4 jobs each of which has to go throughbelow:
Ma, Mg. Processing time (in hours) is given Machines
M4 Ms M6
M1 M2 M3 10 25
Job A 7 2
18 8 8 19
Job B 6 9 15
17 5 7
Job C 11 5 8 12
Job D 20 M.Com. 1998
total elapsed time. [Meerut
Detemine *aoEquence
seq of these four jobs that
minimizes the
 OPERATION RESEA
li2, i3, j4 and
and
336 12; max. of ts
.. are 8, 9, 6
and
=

= ll and min.6
Solution. Here min.
2 max,
ly (i
=
2, 3, 4, 51
and min. i16
respectively.
conditions
min. h2 2
max. ly Sied, the
Since, the
as C
be written D
given problem can 36
Job 46 39
5 40
48 31
Machine G 52
Machine H
where G, and H r sequence is easily obtaine
imal sequence
the following optimal
sequence
algorithm,
ing the optimal
CAB|D
table :
following
The total elapsed time
is given in the
Machines

Job M3 M4 Ms M6
M M2 24-29 29-36
H-16 16-24 36-51
C 0-11 44-46 46-56
29-37 37-44 56-81
A 11-29 61-67 67-75
46-52 52-61 81-100
B 29-46 73-77 77-85
46-66 66-70 70-73 100-112
D
elapsed time is 112 hours.
minimum total
This table shows that the
out is not allowed:
1211. Solve the following sequencing
problem when passing
Machine (Processing time in hours)
tem D
15
15
10 12
12
3 16
6
3 17
V 17
Solution. Here, min.A; 12, and max. B, = 5 and max. C = 10.
Since min. A; 2 max. B; and max. C, the given problem can be rewritten as

I Ill IV
ltem
Machine G 24 24 24 24
24 24 24 24
Machine H
where G, A, + B, + C and H, = B, + C+ D

Since G,= H, and A, = D, are satisfied, therefore using the optimal sequence algorithm, e
41 = 24) sequence, each giving us an optimal sequence
I ll II IV, I I1 IV I1, 1IVII1 etc
Each of the above optimal sequence will yield us the same total elapsed time. For tne ca
sed
time, we have
tem I V
In 0 43
Machine A 15 27 60
Out 15 27 43
In 15 60
Machine B 27 43
Out 20 63
29 46
 E N C I N GP R O B L E M

337
Item
In 20 29 V
Machine C
Out 24 46
39 63
In 24 51
39 7
Maohine D Out 39
67
is 84 hour 67 84
time
otalelapsed tim

PROBLEMS
the tollowing data
Given
1212
Job

Machine A 2 10
14
Machine B
Machine CC 6
jobs: A CB
Onier of processing
(c Sequence suggested :Jobs 5, 3, 6, 2, 1, 4.
the total elapsed time for the sequence
Determine
optimal?
suggested.
given sequence
( s the mEwe is 'No', determine the optimal sequence and the total
We have seven jobs, each of which must go through machines elapsed
time associated with it.
(in hours) are given in the following table
A, B and C in the order A BC.
Presng times

Job 3
Machine A (4) 14
Machine B (B) 6 2 5
Machine C(C) 10 1S 13 18 9
Determine the optimal sequence and total elapsed time associated with it.
[Delhi M.B.A. (PT.) 2009
1214, Determine the optimal sequence of jobs that minimizes the total
elapsed time based on the following
formation

Job 6
Machine A 10 12 6 9
Machine B 6 3 4
Machine C 10 6
Processing time on machines is given in hours and passing is not allowed. Delhi M.Com.2008)
1215. Find the sequence that minimizes the total time required in performing the following jobs on three
chines in the order ABC
Precessing time ob
(in hours) on

Mactine
Machine B
Machine C 8 10 9
[Meerut M.Se. (Math.) 1997
of a number of
1216. (a) A book binder has one printing press, one binding machine and the manuscripts
for each book is known.
aeent books. The time required to perform the printing and binding operation
minimize the total time required to process
eemune the order in which the books should be processed in order to
state any algorithm you might use.)
the books. Find also the total time required. (Clearly Processing time (in minutes)

Book 3
60 50
Pinting time 40 90 80
30 40
60 20
Bindingtime 50
in (a), viz., finishing. The time
additional operation is added to the process described
uppose that an
quired for this operaion is given below:
Finishing time (in minutes)

Book 2 100
60 70
Finishing time 80 100 time.
Find also the mininmum total elapsed
Wh
l 15 the order in which the books should be processed? M.B.A. (June) 2011)
Visvesvaraya
338
PERATIONS RESEAR
7 items through two
of production, PCH
stans.

m a n u f a c t u r e r has to process viz

garments different stages are given belo
o in approprvate units
1217. A readymade taken for each of these at
the
The time
cuting and sewing. 4
6
Item 3
Cutting 5
Process time 6 12
Sewing these stages 8
to be processed through
so

ninimize the totu

as

these items are

onder in which
(a) ind an
and packing, with procece.
processing time.
third stage of production is added, viz., pressing sing time for
(b) Suppose a
5
these
items as follows 3 6
13 12 7
tem
Processing time 10 12 11 10

(Pressing and packing) so as to minimize the time to.

are to be processed
these seven items ocess all
Find an order in which
the items through all the
three stages (IAS 1991
an optimal solution when passing is not
problem, giving
1218. Solve the following sequencing Job

C
15
10
16
Machine M
Machine M2 4 7
3
Machine M 12 10
Machine M 14
giving an optimal
solution when passing is not allo wed
1219. Solve the following sequencing problem, Machine (Processing time in hours)
M2 M3 M,
Job M
25
20
11
12
10
18
2 28
17
[Madras M.B.A. 19961
optimal solution
allowed, solve the sequencing problem giving
an
1220. When passing is not
Machines (processing time in hours)
M2 M3 M4
Job M 4 11

8
12
C 12 13
13 2
D [Meerut M.Sc. (Math.) 199

12:6. PROCESSING 2 JOBS THROUGH

k MACHINES
M, in
is to be processed on k machines say M, M2
,

Let there be two jobs 1 and 2 each of which is known

of each of the two jobs through k machines
two different orders. The technological ordering
same for both the jobs. The exact or expected processing
times
in advance. Such ordering may not be time. The objecuve
are known. Each machine can perform only one job
at a
on all the given machines
the jobs so as to minimize total elapsed time.
is to determine an optimal sequence of processingg soluuo
in case can be obtained by making use
of graph. The
The optimal sequence this
procedure can be summarised in the following steps rot
job 1
horizontal representing the processing time
Step 1. Draw two perpendicular lines, one
one
job
and the vertical representing the processing time for job
while job 2 remains idle,
remains idle. verucaal lines
the horizontal and
time for jobs 1 and 2 on
Step 2. Mark the processing
respectively according to the given order of machines.
 E N C I N G P R O B L E M

tp Co
ious blocks
Construct various blocks starting from the 339
the end point. origin (starting
s until
nchines
the line starting from point) by pairing the same
Draw origin to end igin

lin which makes an angle of 45° point by

an a
gonally
ally
along
of this line moving horizontally,
thes

first job is under with the horizontal

gment
of

ent of the line indicates that the

of
thecates

process while
vertically and
line (base). The
s e g m e n t

second second horizontal

ertical segment of the line shows that
both the jobs job is under process job is idle. Similarly,
i g o n .

um
An optimum path is one that
are under while first job is
idle.
the
process The
Step.
the pati which diagonal movement minimizes
is
the idle time simultaneously.
for both
Thetotal elapsed time
me is maximum.
obtained by adding the
the jobs.
Thus, we must
Step
1or
that job. idle time for
ine either job to the
SAMPLE PRO BLEM processing
hod to minimize the
1221. Use graphical metho
i.e., h time added to
mchines
shown, machine find the which shouldprocess the
.

al time elapsed to complete both the jobs: job be done following jobs on the
Sequence A
first. Also calculate the
Job 1 B
Time
4 D
Job 2 Sequence B 2
6
Time A 2
D
3 E
2
Calation, The solution procedure [Karnataka B.E. (Prod.) 1994; 6
for
solving the above Meerut M.Sc.
following steps. (Math.) 1996]
1,
problem can be summarised in the
Draw
Sen set of axes at the
right angle to each other where
ine of iob I on different machines while
ib 2 while job I remains idle. job 2 remains idle and X-axis represents the processing
Y-axis represents
Step 2. Mark the
processing times for jobs 1 and 2
processing time of
thegiven order of machines as shown in on X-axis and
Y-axis respectively
Fig. 12.3: according to
Job 2
20
Finish
E
Job 1
14
D 2
waits

9 15 17
Job 1
D

For Fig. 12.3

Chine example,
A as
machine Atakes 3 hours for job I and 3 hours for job 2. Construct the rectangle for
3
3.
shown
own in Fig. 12.3. Similarly construct other rectangles for
Construct machine B, CD and E.
marked "finish' isvarious blocks starting from
obtained.
the origin by pairing the same machines until a
340 OPERATION RESEARCH
Step 4. Draw a line starting from origin to the point marked finish' by mavi.
vertically and diagonally along a line which makes an angle of 45 with the horizontas orizon
horizontally along this line indicates that first job is under process while second iohaxis,
moving vertically along this line indicates that the second job is under process while firsemi
The diagonal movement along this line shows that both the jobs are under process simauls irst job niislarly
i
Since, simultaneous processing of both the jobs on a machine is not possible, theretsly.
movement is not allowed. In other words, diagonal movement through rectangles areasis dagon
both the jobs.
Step 5. An optimal path is one that minimizes the idle time for botl
choose the path on which diagonal movement is maximum as shown in Fig. 12.3.
Thuss, alWelowed.
mwst
For the elapsed total time, we shall add the idle time for either of the two jobs to tha
time of that job. Now, since the idle time for the chosen path 1s 5 hours for job I ar
2, the total elapsed time is obtained as follows hours cessi
for jnogb
Processing time ofjob I + idle time for job
= 17 + (2 +3) 22 hours.
Processing time of job 2 + idle time for job 2
20+2 = 22 hours.
1222. Using graphical method, calculate the minimum time needed
process job 1 and 2 to
on
machines A. B, C, D and E ie, for each machine find the job which should bedone irst. Aive
calculate the total time needed to complete both jobs.
Machines
Job 1 Sequence C D
Time (hours) 6 8 4 12
Sequence B D
Job 2 E
Time (hours) 10 6 12
Solution. Draw two axes at right angle to each other where X-axis represents the processing time
of job 1 on different machines while job 2 remains idle, and Y- axis
represents the processing time of
job 2 on different machines while job I remains idle.
Mark the processing times for both the jobs I and 2 on X-axis and Y-axis
to the given order of machines as
respectively according
shown in Fig. 12.4. For example, machine A takes 6 hours for job
1 as well as for job 2. Construct the rectangle for machine A as shown Fig. 12.4. Similarly, construct
other rectangles for machines B, C, D and E.

Job 2 A
0 Finish
36
32
Job 1
28
D waits
24

2o
16
12

8 12 16 20 24 28 32 36
40Job 1
B C D *
Fig. 12.4
 SEOUENCING ING PROBLEM

origin to the point rting from 341

linea
alon a line which makes an
a marked
angle of 45" finished'
mal
gonally by
remain.Job ng of job I while job 2 with the moving horizontally, vertically
a n da
e o e s e n t s p r o c e s s i n g

hains idle. The diagonal remains horizontal

idle; a vertical move axis. A horizontal
I
movement (i.e., mOverepresents processing
job
u n d e rp r o c e s s
while
simulta
ltaneously. Since simultaneous a
45 line) shows that both the
of job
movement is not processing
allowed. of both the jobs jobs are
mal path is one that
on a
machine is not
n optima minimizes idle time for
ncide ith 45° line to
An
with the maximum both job 1 and 2.
45°
This means, this
ximum, as shown in Fig. extent. Thus,
shoul
moveme is maximum we must path
diagonal

for either job to the Drocee n Fig. 12.4. The total choose the path on which
idle
the idl
time processing time for that job. elapsed time is obtained by adding
The idle sime for the chosen path is: Job =
4 + 6
The total
elapsed time is obtained as follows: or
10 hours and Job 2 =
4 hours.
Processing time of Job 1 + Idle time of Job 1
34 + (46) 44
Processing time of Job 2 + Idle
time of
hours.
Job 2
40 +(32 28) =
44 hours.
PROBLEMS
anaA machine shop has four machines A, B, C and D. Two
The time (in hours) taken on each ot the jobs must be processed through each of these
machines and the
are given below: necessary sequence of jobs
through the shop
Job 1 Sequence
Time
lova C
Job 2 Sequence ovloe D
I Time
2
graphic method to obtain the total minimum
Use
elapsed time.
1224. Use graphic method to find the minimum
weare given the following information: elapsed total time sequence of 2 jobs and 5 machines, when

Machines
Sequence tit s A
2 B
Job 1
Time (in hours) C
3
Job 2 Sequence 2
Time (in hours)
6
[Meerut M.Sc. (Math.) 2000; Karnataka B.E.
1225, Two jobs are to be
processed on four machines a, b, c and d. The
(Mech.) 1994]
machines is as follows technological order for these jobs on
Job 1: a
b
Job 2: 9 d b
Frocessing times are given in the following table:
Job Machine

2
Find the ptimal
sequence of jobs on each of the machines.
340 OPERATIONS RESEA
Draw line starting from origin to the point marked finish
by m u i .
ing horizota
Step 4. a
makes an anglethe horizontal
of 45" with
a line which
vertically and diagonally along Me
indicates job
that first is under process while second ioh ioIs,
dle. Similat Moving
horizontally along this line under
process whilef.
indicates that the second jod 1s first job is
moving vertically along this line jobs are under process sim
The diagonal movement along this line shows that both the id
not possible, theradusly
Since, simultaneous processing of
both the jobs on a machine IS efore diagona
movement through rectangles areas :
movement is not allowed. In other words,
diagonal not onal
Step 5. An optimal path that minimizes the idle time
is one
as shown
for both the jobs. T.
in Fig. 12.3,
allowed,
movement is maximum
choose the path on which diagonal
idle time for either of the two jobs to the
For the elapsed total time, we shall add the
time of that job. Now, since the idle time for
the chosen path is 5 hours for job 1 andand 22 heCessin
hours for
time is obtained as follows: job
2, the total elapsed
I1
Processing time of job l + idle time for job
17 +(2 +3) 22 hours
Processing time of job 2 idle time for job 2
= 2 0 2 = 22 hours.

method, calculate the minimum time needed to process job 1 amd 9

1222.
machines A,Using graphical
.

B, C, D and E, i.e., for each machine find the job which should be done fir five
Also
calculate the total time needed to complete both jobs.
Machines
D
Job 1 Sequence A B C
4 12
E
4
Time (hour) 6
Blto raueC A lo D E
Job 2 Sequence epig 8 6 12
Time (hours) 10
Solution. Draw two axes at right angle to each other where X-axis represents the processing time
axis represents the processing time of
of job 1 on different machines while job 2 remains idle, and Y-
job 2 on different machines while job I remains idle.
Mark the processing times for both the jobs 1 and 2 on X-axis and Y-axis respectively according
to the given order of machines as shown in Fig. 12.4. For example, machine A takes 6 hours for job

1 as well as for job 2. Construct the rectangle for machine A as shown Fig. 12.4. Similarly, construct

other rectangles for machines B, C, D and E.

Job 2. Finish
40
36
E
32
Job 1
28 waits

20
16

LLLLLLLL
4 8 12 16 20 24 28 32 36 40Job1
D

Fig. 12.4
GFQUENCING PROBLEM 341

line starting from origin to the point marked 'finished' by moving horizontally, vertically
Draw a
and
diagonally alo a line which makes an angle of 45' with the horizontal axis. A horizontal move
eprese
of job I while job 2 remains idle; a vertical move represents processing of joo
processing
Iremains
ile job 1 idle. The diagonal movement (i.e., a 45° line) shows that both the jobs are
Since processing of both the jobs on a machine is not
whrcess simultaneously.
under process

diagonal movement is not allowed.

simultaneous
ssible, therefore

antimal path is one that minimizes idle time for both job 1 and 2. This means, this path
Aincide with 45 line to the maximum extent.. Thus, we must choose the path on which
shou

is maximum, as shown in Fig. 12.4. The total elapsed time is obtained by adding
movement

for either job to the processing time for that job.

d i a g o n a l

idle time
the ke idle time for the chosen path is : Job 1 = 4 +6 or 10 hours and Job 2 = 4 hours.
time is obtained follows
as
The total elapsed
Processing time of Job 1 + Idle time of Job 1
3 4 +(4 6) = 44 hours.
Processing time of Job 2 +Idle time of Job 2
= 40 +(32 28) = 44 hours.

PROBLEMS

four machines A, B, C and D. Two jobs must be processed through each of these
1223. A machine shop has
machines and the necessary sequence of jobs through the shop
ochines, The time (in hours) taken on each of the
aregiven below:

Sequence A
Job Time
A
Sequence
Job 2
Time

Use graphic method to obtain the total minimum elapsed time.

sequence of 2 jobs and 5 machines, when
1224. Use graphic method to find the
minimum elapsed total time
information:
we are given the following Machines
C D
Sequence
Job Time (in hours) 2 4 6

Job 2
Sequence C D
Time (in hours) 4
B.E. (Mech.) 1994]
[Meerut M.Sc. (Math.) 2000; Karnataka
order for these jobs on
four machines a, b, c and d. The technological
1225. Two jobs are to be processed on
machines is as follows: d
a b
Job1 b
C
Job 2: O8ov d

in the following table:

Processing times are given
Machine
Job

sequence of jobs on each of the machines.

Find the optimal
342

122 A mavhine shop has six machines A, 8, C D, and Two Jobw munt
be pradeso.
OPENATIOND RIAARr
machines. The times on machines and the necensary sequenco of the Joba through the
the ahopan though whop ane
given bely
tPnter
30
elow
Job A C10 D10 R2
Job A-10 C-00 B13 D-10 F15 F16
Determine the optimum sequence for the Job in order to minimize the total time necewary to d,20
to
Mnwinh the
uiba,
12:7. MAINTENANCE CREW SCHEDULING
The problem of schecduling job in a factory can be extended to scheduling the factory
maint
crews in such a way so as to minimize theiridletime. Let a compuny have a set of different e
in its plant that need preventive maintenance. The crew team is divided into two gro
crew Breets
ching
First, crew A takes the machine and replacesthe parts according tothe needs. Then crew
machine and puts it back into operation. If the servico times of both the groups on the he
machines are known, we can determine the optimal sequence in which the maintenance iohe ren
so that the idle time of the crews is the least.
Like for sequencing problems given earlier, the rules when the service times are given in the
rows
form may be summarised as
() Choose the smallest of all values that appear in the two
rows.

(in) If the value is in the first row then the machine corresponding to the value shall be seruio
by crew A in the beginning.
(ii) If it is in the second row, then that machine will be serviced by crew A in the end,
(v) If there is a tie in the same row, either of the machines involved is sclected and assigned the
the second
the last, place accordingly as the tie is in the first or
row.
first, or
machine involved.
(v) After making the assignment, cross out the
are made.
(vi) Repeat steps (i) to (v) until all the assignments
SAMPLE PROBLEM

in two groups, C, and C, which cares for

1227. The maintenance crew of a company is divided
the maintenance of the machines. Crew C, is responsible for
replacement of parts which are worn out
back for operation. The times (in hours) required by
while Crew C2 oils, and resets the machines
and on different machines which
need working on them are as follows
crews C Cz M
M3 MA Ms Mg
Machine: M M2 14
6 10 11 10
8
Crew C 7 12 8 6
Crew C2 that the total time taken i
machines be handled by crew C and C so
In what order should the
minimised?
items and crews as the service facilities, the optima
Solution. Treating the machines as seven

obtained as
sequence can easily be
My Ma Ms Ma M M Ma
have
For the total elapsed time, we
M6 M M
Mi M4 Ms M3 57
35 49
0 4 15 25 63
In 25 35o49 57
Crew Ci 15 63
Out
27 35 49 57
60
Crew C2
In
4 15
21 35 42 55 62
Out
11
 NCNG PROBLEM
ENCNGPR

by the crew
by the to 343
the time
t o t a lt i m
require
handle seven
of the crews Cand C2 are machines is
ne
t i m e( i n
ours)
shown in Fig. 12.5
66 hours. The working and
and the
Work time
Idle time
C |M Ma Ms Mg M MM
M M
MsMg Mg M Ma
10 20 30 40 50
Hours 60 70

Fig. 12.5
PROBLEMS
has eight large machines
A company
A and B. Crew AA takes which receive
machine preventive
1228.
wded
into two crew

second Cra
The second
the maintenance. The maintenance
"Power' and team is
crew resets the
ance schnceredto
nintenance
schedule.

to be in effect. The
considered
Cond
machine and replaces parts
puts it back into according to a given
gssingrule
is servicing times for each operation. At
machine are given below :all times thee
b C
Machine: d
Crew A 5O 4
222 16
Crew B: 6 10 12 8
o15 11 9
20 7
etermine the optimal sequenceof scheduling the 2 21
a chart.
factory maintenance crews to minimize their idle
gEsent it on
úme and
an0 Arefrigeration company has six plants located in different
ont toto be
irach plant
be completely
completel overhauled. The parts of a
is carried out in two city. Every year, it is necessary
overhauling
Crw of workmen with completely different skills. The work on stages A and B, and each stage
mleted. A plant
C has to be closed for the entire stage B can start only when
stage A has
nerhaul ofthe six plants is as follows period of its
overhauling. The present schedule of the
Time required by Crew (days)
Plant Pi P2 P P
Crew A 6 6 Ps P6
4
Crew B boco 94 2 10
lo) Determine the optimal sequence.
6)If downtime of any of the six plants costs Rs. 800 per day for a
day, and idle time for crew B costs Rs. 430 per day. Which of the twoplant, idle time for crew A costs Rs. 250
schedules, the present one and the one
2muned in (a), will be more economical? What are their costs? respective