~r

·~. :r. cha ter 29

SEQUEN CING

INTRODUCTION TTR.\.CT'.01..0G) A ~ D ~OT\ TIL S

Suppos~ the re are II jo bs to pe rfo rm. each or which requir~ The h'lflo.,. ~; '.,-,.., r ' :r i.-C - ' ..!. - ,,_ 11 -,e ~ tn thj<c
processing on so me or all of III diffe re nt machines. The chap<.:r
e ffecti veness (i.e. cos t. time or mileage. etc.) can be mea.~ured for
(i "amber g( \ ~ i: -:x=, r.."1C ,e., 1.. i: f ;;_7 LI ues through
any g iven seque nce of jobs at each machine. and the most s uitable
seque nce is to be selected (whic h optimizes the e ffec tivenes , v.hich a Job ml.!>( pa,,, be1.x-e r , _ -:-;>it'.'l:!tl.
measure) among all (11 !)"' theore ticall y possible sequences . Fo r e,i'"!lp•e. J bo.:-, ·- "le! "'-., ......,re t:.:?S w be proce,....xl
Although. theoretically, it is always possible to select the best through cow.;,osm;. pr.:-.o;:;. tim..•~•; ,=-r..::. l,1 I.his eurnple..
sequence by testing each one. but it is prac tica lly imposs ible the boob. uJr..nr:.;~ ::.~ ;. .l.:l... L"le c:rfferem proces5es
because of large number of computations. consrrw1.<: t.'l.: ~ - •~-·-""'..n.
In particul ar, if 111 = 5 and 11 =5, the total num be r o f possible ( ii) Prl>l.-essing On:iu . I, r.::;·as to De ~ m ~ Inc h , anous
seque nces w ill be (5 !) 5 = 25,000.000.000. Hence the m.a.::hin~ m.'. requ.:rec for -~ l ~g tbe Job.
e ffective ness for each of (5 !) 5 sequences is to be computed before ( iii) Proc~ Time. I i = = 6:: c:...-.x req~~ b~ exh job o n
selecting the most s uitable one . But, this approach is practiealh e:ic h rruchule. ~ ~ n T ~~ d...~ e the processing
impossible to adopt. So easier methods of dealim! " i th such ti.me reqwred i.x c l'--.t, t,~ ft machi ne
proble ms are needed . - (i=L :: .... r::
Before proceeding to our actual discussion w e should e'\pl:tin ( fr > ldJe T~ on a '.\l:ac.binc. Tb 1;, t:.'le nme fo r \\hic b a
what the sequencing problem is. m.h.:hme rem;.un, 1-C..- J-.m::i:-,; Dr L..-.o.1 e bpScd time.. The
The proble m o f sequen c ing may be defined as fo llows: n0w noo X sh.ill ~ ~ to ._kl1\){.c' t'.~ 1dk time or m:ichio e j
Definition. S11ppose there are 11jobs (I , 2. 3 . .... 11). each of t-..:N ~o the c'I.J ,,i the - l ltl._ J'-'C' .1n,J the ;,lJn 0 1 the Ith j ob.
which has to be processed one at a time at eacl, of m machines ( 1•) ToUI Ellp..--ed Ttme. Tus ~ Li-i-::" nme t-..·N ~n st:lrtin!! the
A, B, C , ... TJ,e order of processi11g each job tl,ro11gh machines fir-1 jot, .md -·'-'mrkon~ L~ l:b1 J'-' b. Thi,, J..iso in.: lude; idle
is give11 (for example,job I is processed tl,ro11gh machines A. C. nme. if .:-x1st,,. I: \\1;J ~ J._~._l(_'\i t,;' the.- :.;- mbol T .
B-irr this order). The time that eacl, job must require on eacl, EJNTU ( B . Tech.) 2003}
macl,irre is k11ow11. The problem is to fi11d a uq11e11ce a1no11g ( i·i ) ~ o P..1..~ Ruk nu, n.Jt'.' m<.in:, tb:1 1 passing is not
(11 !)m number of all possible seq11e11ces (or combi11ario11s ) (or :ilk),, t-J. i. .-. the :-..m1<;· ,,!\.kt- ,, i .i'-~ is m:1int'.1.ined o~·er e:ic h
order)for processi11g the jobs so that the total elapsed time for all 111.1, h i~ . I t c·xh ,,, th< r. -_1obs i.,; tu t,e pro...--css<!d lhrough two
tl,ejobs will be 111i11in111m. m.1Ch.rni;.-s _\ .U1J 6 t0 ~ 0nkr AB. then this rule mea~s th:il
Mathematically, let ,· .,ch 1,--t- wtll f '' ll' m.1,·hi0<.· -\ fin- 1 :inJ the n 10 B.
A; = time for job ion mac hine A. ASSl ' ~lPTlO~S L, SEQL' EXO.."'\;G PROBLE.'\lS
B; = time forjob i onmachinefl. ch.:. , i' ;1,,,, m.h: h1n'-· ,·.m pru..~ss mon:- than one o peration :it a
T = time from start of first job to ,,llnpktinn ,lf tl11: last j on. 11111, .
The n, the probkm is t,, <lct,·nnin,· f,,r car h mad,int> :1
! u I F.,,h '-'['<TJti,,n. ,,n,-..· st:.1 ncJ. mus t be 'rfom, c d till
seque nce of jobs i 1 • i 1 • i.1, .. .. i,. . whc rt· li 1 • i, . i_\ •... . i" l is th,· '"-'lllpk t,,,n pe
pcrmutution of the intege rs whid, wi ll minimiL,' r .
<iii! .-\ j,-.tl ,, ..lil <'ntit, . i. •·· <:.' \en tho ugh th . b
· • · ~ e JO repres.:-nts "\ lot
Q . 1. Define the probtem of Sequencing. ,,t 111dl\ 1Ju.1l p.1rts. no lo t ma\ tx· proc, ·db •
[Madra s M.Sc. (Mnth.) 1999. B. Sc. (Mnth.) 199~ ,,n, m.1,hrn,· ..ll a time:- . · t;SS..: Y m o re than
2. Explain what do you mean by a sequencing problem (1\ I i-:.1,h ,,1,-r.1ti,,n must tx: con,pl t · d ,... __ f
[JNTU (B. Tooh.) ll003: Moorut ll002J ,,1x·r:1t1·,,11. \\ h ·t,h ll must pn--- ·d.. e. l: ,,c . ore •'llly 0111er
.. . . "-ll 1.: . lan be2.111 .
J. Give throe different examples of sequonclng probltlnl h\lm , ,,ur I 1· 1 l llllt' tnt,·n a l, t,,r rrcx· ' S . · . ~
dally life.
_ , · 1.: . ~m g arc llld<!penden t
,,,u,•r 111 ,, hil.'h up,•r:uio ns ••n, ~ rf 1· u
o le
• u ,.._ pc onncd.
11•l■ll■■■r.:==~~-~-~-=====~~--.======
(v i)
----~-
There is only one or each lypc or machine.
times oblained by delc1ing processing li'."c.' fur ho1h
SEQUENCING
the machines corresponding to the Job already
(vii) A job is processed as soon as possible suhject to ordering cd
requirements. Continuc~if: 11 ·jobs have been onlcrcd . The rcsuhing
(viii) All jobs arc known and are read y 10 slart processi ng onlering wi ll minimize the elapsed 11me T. _
0
(ix) ~~:n~\~q:~:~:c~;;;::;:~ :~!~~\nachincs is Proof. Since passing is 1101 allowed. all n_Jobs mus1 be
rocessed on m.:ichi ne A withoul any idle for On th~ mhcr .1''"~ IL
negligible. ~and. mach.ine 8 is subjecl 10 its remarm~g idle time al I a nous Now. ir wc dcno1e }, Y, hy D, I S). 1hen 1h<, problem hecorrr-
Q. 1. Whal ,s no paSSlllQ rule In a sequencing algonthm? Explain lhe siages . Lei Y, be ihe time for which mach,ne 8 rem_a.111 s ,die afl er
pnnap1e assumpbons made wl111e dealing witl1 sequenang complelin ~ (i _ l)lh job and before s1art1~g processm g the rth Job 1ha1orlindin g the sequence < S •> for proccrnng lhc Job< I. 2. .
problems. [Punjab (8. Com.) 2004) 11 so as 10 have the inequa li1y D, (S•J s D/ S ) for an ~ ~
(i = I. 2. ---~ n ). Hence. rhe 10131 elapsed time T rs given by 0
2. Distinguish between "Sequenang" and · ScheduJ,ng". < S 0 > 01hcr lhan < S • >. In olher words. -. c have to find che
[JNT\J (8 . Tech.) 2003] T =l: B,+ l:Y, oplimal sequence < S >soas 10 m inimi ✓.e D,( S). This can be done
1= ! /=I
3. Give lhree different examples or sequenang problem from your i1era1i vely by successively in1erchanging lhe consecuti-,e jobs
daily life{JNT\J (8. Tech.) 2003. 02: Madras B.E. (Mech.) 1999] where some or the B, ·s may be zero. Each such inlerchange or jobs gives a value of D,. ( SJ fe,;s than or -\g=, thr ~ ~ ..:.ie i.: me reduced hsl" 2 for
4. Whal are lhe usumpc,on made on sequencing problem? equal 10 iLs va lue before the change . JOO l oo the rra:h•.., 8 S.· J,j.S pc , cN.
[JNT\J B.Tech. 111 (CS & Engs.) 2012]
- - Util ised Time Johnson 's Algorithm for n Jobs 2 Ma chines
Solution or Seque ncing Problem ..... . JdleTimconB The Johnson· s iterali ve procedure ror determining lhe optimal
sequence for an n-job 2-machine sequencing problem can be
Cornirnnm! m the !t...e
be)ov. is ~ .
= Cle QlnJ ~ l.Jsl !ti•=
Al present. solution or following cases are available :
I . n jobs and iwo machines A and 8 , all job processed in the
order AB (or BA ).
2. n jobs and lhree machines A. 8 and C, all jobs processed
iAf-------r'-----~,-------·· r·
A1 A2 A3 A., As An- I An outlined as foll ows:

ou1
Step J. Examine the A, ' s and B, ·s for i = I. 2. ... n and find
mf'1 [A,. B,} fora lli.
in the order. say, ABC (or in any other onler), other
-. B -· .. .. Y 0· ·· y 2 8 2 83 s; · ·Y-1 .. · · ·y ~ ·····s~ G
limi1a1ions are given on page SEQ/6. 1 1 Step 2. (i) Jr lhis minimum be A1 fo r some i = k. do (process ) IO
3. Two jobs and m machines. Each job is 10 be processed the kthjobjirst oraJI.
through the machines in a prescribed order (which is nm (ii) Ir this minimum be B, for some i = r. do (process) the rth
necessarily the same for both the jobs). Time taken in hours j ob lost of all .
4. Problems with n jobs and m-machines. Gann Chart Step 3. (i) If there is a tie for minima A, = B, . pn>CfS.S tlw
All 1hese special cases and their solutions are explained in the kthjobjirst ofal l and rthjob in lhe last.
following sec1ions.
(ii) If lhe 1ie for the minimum occurs among the A , ·s. sel.xt
Processing n Jobs Through T wo Machines Now we wish 10 minimi ze T . However, since ~ B1 is the the job corresponding 10 the minimum of B, ·sand process ii ftrst
1 1
The problem can be described as : (i) only IWo machines A and B or all .
Iota! time for which machine B has to work and 1hus being
are involved, (ii) each job is processed in 1he order AB (say), and constant, it does nol form a part or minimizing T. So the problem is (iii) Ir the tie for mini mum occurs among lhe B, ·s. seli,ct the Ftn:tll ~. lbe •~ ~ e is obcnned :tS :
(iii) the exacl or expecled processing limes
A1 , A2,A 3 , •• ., A,,;81 ,Bi , BJ, ... ,B. are known and may be
reduced 10 tha1 or minimizing, t Y1• A very convenienl procedure
job corresponoing 10 the minimum or A;' s and proo:ss it in lhe
last. Then. go lo next slep.
Step 4. Cross-nu! the jobs already assigned and rep<""al s1<ps I
expressed in lhe following tabular form : Furthc,r. it is :iL-o possibie to cak~ the mi nimum elapsed
r~r obtaining a sequence of performing j obs so as 10 minimi ze 10 3 arranging the jobs nexl 10 lirsl or nex110 las1. un nl all the JObs ti m., c-orresponding 10 the opama.l sequencing. using the
Prc;;,:ng J - - - - -- -J_ob_lll_ _ _ _ _--J 1
~
1 Y, is well explained by 1he Gantt Chan as shown in the fi gure.
have been assigned. indi,i J ml pn., -=ing nm., given in the sutemem of the problem.
The de,,.,L,; :ire gt"en in the folJo,.ing cble.
A,
From this chart, ii is clear Iha! Q. Give Johnson's method I!)< determining the optimal sequence
A, for proq,ssing n jobs on two ma_dlines. Give JUS!fficallOn or the Opcimat,Jot, -8
B, o, B,
Y1 =A 1

Y, ={Ai + Ai - r, - B, , if A, + A2 > r, + B,
rule used in procedure. [GBTIJ (MBA 2011: MeenJt 2007. 02]
I ~..., ---------,---------;
T...,. r- -
ia Tuno out Tlmo in
The problem is lo sequence (order) the jobs so as 10 minimize - 0 otherwise.
Rlustrative Exam les
the lolal elapsed time T. 15
The expression for Y2 may be rewrilten as Example 1 Thrre are Ji•·<' jobs. each of ll'hich m,w go
The solu1ion procedure adopled by Johnso11 (1954) is given I:
below. Yi = max
I A, + A2 - Y, - B, . 0 ). th roug h tiie llro machines A a11d 8 i11 the order AB. Pr,x-ess111g
!3
Solulion Procedure Thus, Y, + Yi = max IA, + A2 - 8 1, A1}, since Y, = A1. times are 1/iven i11 tablt· bdoll' :
Similarly, Processing time (hours) 28
Stt p I. Sclec1. the leas! processing 1ime occurring in 1he li sl
A,,A2,A_., ... , A. and B1 , B1 ,BJ.. -·, B• both. lf Y3 = max IA, + A2 + A3 - 81 - B~ - )'.j - Yi, 0 }. Job I I 2 I Thus. th..· minimum time. i.e. the tim., for slarting or job 2 to
!here is a 1ie, either or the smalles1 processing time
should be selected. r, +Yi +YJ =max{(J A, - r h} B,). T1me rorA I 5 I 9
s1 10
4
I cumpkcion of the las1 job I. is 30 hrs only. During !his time, the
machine -~ remains idle for 2 hr.; (from 28 10 30 hrs) a.nd the machine
2 7
Strp 2. lrthe leas1processingtimeisA,. , selec1nhjobjirsr. Irit 1- 1 1= 1 1= ] TimeforB b Bnc·mains idldor 3 hrs only (from0--1, 22-2.3. a.nd 27-28 hrs).
Detemun,• a se<J11<!1Ce for Ji,,,1nbs that"'" 11111111111 :e tlu el,,pst'd
r r ~
JS B, , do !he nhjob last (when the given onler is AB).

L -r
The h.lla l dupsed time ca.n also be calcula1ed by using Gann
Srep 3. TI1ert' are now n - I jobs lcfl 10 be ordered . Again = ma, { ( B ) '( A -
ch~n as fo llows :
B A } rime T.
repeal sr,•ps I and 2 for the reduced se1or processing /: J I i= I I p :.] , i=I ')' I ·_ . - , or tire machines in this /H' r-iad.
Cairn/ate rhe total ,dlt• mm fi l b (MCA) 2007; IAS 11195) Fmrn the ligu~ ii can be seen that the 101al elapsed time is 30
[UPTU (MBA) 2010; Pun ■ hrs , and th,· 1dk 11me of the machine Bis 3 hrs.
 SEQUENCING SEQ/5
SEQU ENCING

corres nd 10 12 and 16 on A and to_ l i on B. Sin~e, the We are ,,,.,.,. left ,. ,:h 2 '?ool..s and 2 machines with their
corres~nding process ing time of 16 on B is larger ( I 0) th.in th at Solution Obv iously, lhe book s firs! wi ll go 10 pri ntin g pre«
and ancr lhal on lhe binding machine. ff 111 r; = I. 2. .. ., 6J is the re; pectr>e prr.ce ,.n~ r,me-; .l:.'I he low :
of 11(6), so 1 6 will be processed next tol, • ,
Step 6_ Thus in thi s step. we have the sequence 11111c 111 hours on pri111/11g press and 1 ;<i = I. 2. .. ., 6) the brnding
2
tune for books then: since min . !ti; , 111 ) = [QI correspondin g 10 6th
[ 1, 1, I book , so book 6 will be processed in the last. The problem no,;,
will reduce to fire books and two machines as below :
Step 7. Now, since the minimum processing Lime (3) is for 1 1 Al thi~ ,uge. rrun,mlliTl o' 1 andr : , 1s 50 hours for printin g
Book I
Gantt Chart on A and for 1 on B, therefore we have the optimal sequence as of book 3. ~ we place Book 3 ,n the rhird cell aod the remammg
3 30 120
llil 90 I ,. book 2 in the p,un h cell To.,.; . ,.~ get t.he foll owmg opumal
In this problem, it is observed that job may be held in 1, 1, 1, 1 I 1
• I I 80 100 90 50 sequence :
inventory before going to the machine. For example, 4th JOb will
Step 8. For this optimum sequence the total elapsed lime can TI1en , min lt 1,, 121 ) = ~correspondi ng to book 4. Therefore.
be free on machine A after 4th hour and wi ll start on machine B
after 7th hr. Therefore, it will be kept in inventory for 3 hrs. Here it
is assumed that the storage space is available and the cost of
be calculated as follows : 4th book will be processed just to start wi th the process. The
processing of books are shown in the sequence : The min imum e ~ = surung from the fmt book to Lhe
completion of the last book correspoodmg to the optimal sequence
holding the inventory for each job is either same or negligible. For ~:;~:~: ' - - -
ln_M_ac~hin_e_: -ut- - + - l-
nM
_ a_chrin_e s_Ou- t ---1 tdl~ t~me is obtained as sho'll>ll belo"' i,, !li.= followin g tabk :
short durJtion process problems, it is negligible . Second general
assumption is that the order of completion of jobs has no After the assignment of books 4 and 6, we are left with 4 Optimum Printinglbc!wne Binding Machine Idle Time
significance, i. e. no job claims the priority. Sequence of Binding
books and 2 machines as shown below with their processing r-4n rime-out
16 times. ofllool<s rome-<n rime-out Machine
Example 2 In a Jae/O f)', there are six jobs to perform each of
which should go througlr two machi11es A and B i11 tire order AB. 16 22 Book
The processi11g times (i11 hrs)/or the jobs are given here. You are
requested to detem1i11e the sequence for perfom1i11g the jobs that 15 25 90
would mi11imize tire total elapsed li11e T. What is the value ofT' 25 27 90 [}Q]
20 26 27 29 Now the minimum oft 1; andt 2 ; is(JQiwhich is corresponding
to book I and book 5. That is, their is a tie for the minima. So we
Thus, total elapsed time= 29 hours. assign book I next to the first place and book 5 next to the last., It is clear from the table th:u the minimum elapsed rime is 430
Idle time of machine A is (29 - 26) = 3 hours and that of giv ing us the following sequence : hours. Idle rime for prinring machir.e is I O hours ( from 420 hrs. lo
[Madras (MBA) 2004) machine Bis I hour onl y. 430 h.rs) and for binding m:u:hine is 20 -. -!O = 60 hrs .
So lution Step I . The smallest processing time in the given The Gann-chart for this problem can be given as below :
problem is I on machine A So perform 1 1 in the begining as
shown below : Examination PROBLEMS
1. Find the sequence that minimizes the total elapsed time requ ired to (Ans. Optimal seqvence · 1 ..... 3 ..... 5 ..... 4 ..... 2; min elapsed time
complete the following tasks : = 28hrs: idle bme 2 hrs for A and 6hrs lorS.]
Step 2. The reduced set of processing times now becom·es : Tasks A B C D E F G H I 3. Six jobs go first ove, machine I and then over II. The order of the
completion of )Obs has no s,gnmcance. The lollowing table gives the
Job Machine A Timtonlm11chinc : 2 5 4 9 6 8 7 5 4 machine times in hours for six pbs and the two machines :
Tim,onHmacbloc : 6 8 7 4 ) 9 l 8 II
M:ichi~A Je
Job. No.
Machines ·x,, (JNTU B.Tech . Ill (CS & Engg.) 2011)
~toch1nel
(Ans. Optimum sequences are : : 5
(i) A-+C-+1-+B-+H-+F-+D-+E-+G M:>ch1nclt :1 7
Step .I. The minimum processing time in this reduced (ii) A-+ 1 -+C-+ H-+ B-+f-,D-,G-,E
probkm is 2 corresponding to 14 and 1 5 both on the same machine 0 3 6 9 12 15 18 21 24 27 30 (iii) A-, c-,
I -, 1·1-+ B-, F-, D-, G-, E Find the sequence of~ jobs that minimizes the total elapsed time lo
(iv) A-, I -, C-, B-, H-, F-, D-, E-, G complele the jobs. Find the minimum time by using Gantt Chart or by
B . Sin.:c, 1hc processing time of 1 5 on A is larger than that of 1 4 on (v) A -, C-, I -, B-, H -, F -, 0 -, G -, E any other method [Madras (MBA) 2000; Meerut (M.Com.) 1998)
111:,d1inc A so 1 5 will be processed in the last and 1, next 10 last. (vi) A-, 1-, C-+ H -, B-, F-, 0-, E-, G
(vii) A -, I -, C -, B -, l·I -, ~ -+ D -+ G -+ E (Ans. Opti mal seqvence : 3 -, 1-, 5 -, 6 -, 2 -, 4; Min. elapsed
Tiie job seq uence IJ<.-comcs : (viii) A -, C -, I -, H -, B -, _I· -, D -+ E ; G. time = 42hours.]
Example 3 A book binder lras one priming press, one .
Min. elapsed time= 61hrs, idle t,me on I machine 11 hrs, on machine
I 1, binding machine and the manuscripts of a n11mber of different 02hrs.] . . .
4, We have five jobs each of which must go through two machines In the
order AB. Processing times are given in lhe table below :
books. Th e time req11ired ro perfom1 rhe printing and binding (Note :In fact. minimum elapsed lime for altemallve . optimal
Job No.
=~~~ a~~ I~~':,.,~i~=r~~i~r~~~~pt?~1t~~!~~1e
Step -I. The remaining processing times for jobs 1 1 , 1 3 and 16 3
operations for each book is sholl"n below. Detennine the order in for M n.:h1ric A : 10 18
,.,llbe : 6 20
which books should be processed in order to minimi,e rhe toral 2. Following table shows the machine time (In hours) for 5 jobs to be Ma..:hmcB :
16 8
time required ro tum 0111all the books: - processed on two different machines :
Determine a sequence fo, the five jobs that will mlnimlz.e the total
Job I 2 elapsed lime
Book
.\f •h1nc 8 Machine A 3 ~~nh:u~;imal seqvence : 2 -+ 4 -+ 3 -+ 5 -, 1; Min. elapsed time=
Pringing Timc (hrs .1 JO 120 50 MachincB
20 90 100 6
Bind1ngT1mc (hrs.) 80 100 90
<u-r 5. \low Wn' is a rie 3mong three jobs for the smallest 60 30 10 Passing is not allowed. Find the optimal ~~~':,";. i;.:~'.f2;,~~ 5. Find lhe sequence that minimizes lhe total elapsed time required to
pn-.."<"s!Og tin1<:·s in the modified form of 1he problem. These should be processed complete lhe following jobs :
[Punjab (B.Com.) 2006)
 SEQUENCING
SEQUENCING

r Detem1Ine the opt,mal sequence and the elap•~~~ (MBA) 2012) fi c111 11:u,s, mac ~;n~s
G , anu
denoted hy (, and //. ,i nd
, arc uc , I11cd by
corrr.,f"rd•"Y ,,,,,..
No. of Jobs 10 In the machine ~ 8~;~~:=~•a:;v~;'!,:,"nufad ured
2
. G, ~ II,• IJ,. II ,= ll, t C
M:u:hmcA each
= :nngh"';' ll 1l1 IV V Vt Vll VU\ If thi s pro blem w ith prcsc ri hcd nrck nn~ (, /l " ,oh ••f rt-..,
Mach,nc8 6
[JNTU (IV B. Tech., Mech., I Sem.) Feb. 2007 (Set 1 & 2) type; T1m, I inm1n.l ;o 45 15 20 80 120 65
~c~tlt~r~- o pllmal sequence w ill also he optima l for tht ,npnJI
Agra 1999; IAS (Maths.) 1997 (Type)) on nutC'hltlC' -~
[Ans. Optimal seqveoce 3 -+ 1 -+ 5 - 6 -+ 2 -+ 4. M,n @lapsed Time (i n min.) 20 JO 50 _15 36 40 50 20
time = 35hours.]
onmachincB
6. We have seven 1obs each ol which has to go through the machine
M, and M 2 in the order M, 1.1 2. Processing bmes (in hours) are given .
timum sequence of processing of different produds ,n r - -- -t----=-=
J o~b ~l - + -~ Joo2
below. ~:~o~i,;mize the tota~~u=:~~.:e for all the produds X... Y
Job Nameanddiscussthesch[A.I.M~. (P.G. Dip. In Mg1.) June 1996) X ... Y ... .XY
M:iclun< M 1
MllchiocM 2 IO
15
10 [Ans. e~l~':~t:~n: ~ I -, V1 -, V_, I -+ I,
. .X ... Y
... XY .. .
.. XY .. .
X... Y .. .
Min elapsed time= 6 hrs. 45 min.]
Detem,ine the sequence that will minimize the total elapsed time and .. XY ...z.. . . .X... YZ. . rv::
There are 5 jobs each of wh ich must go through the two ':"achines A
prepare the time schedule chart and Gantt chart 11
· and B In the order
BA . Processing time (in hours) are given below .x... n .. ...XY .. .Z iv:
[JNTU B. Tech 111 (CSI Engg.)2011, 1998; Agra 1998) Detem,ine a sequence for 5 jobs that will mlmm,ze the elapsed time.
[Ans. Optimal seqveoce : Now finall y we enumera te all these programs o □e by one using Gana Chan :is sno,,.-,i be!.,...
{~=::: ~=: ~=:~=:~=:: : Min . cl~-dtimc = 67 hou~J
Job
M•chi ncA
I
l
2 l 4 5
4 From these chans it is clear that optimum program is 6th and the 1rummum e.lapsc,j c:m: L' l • bol.n
MachincB 5 l 2.
7. Seven jobs are to be processed on two machines A and B in_the order
A -, B. Each machine can process only one JOb at a time. The [JNTU (B . Tech.) 2003)
processing times (in hours) are as follows : [Delhi (M. Com.) 1997] IOU, .... ........ ~~- i>!lOGlL\),,f J L' TT
b ~ J
Job : 12 The maintenance crew of a company is divided into two parts C1 and 11
I 2 3 4 5 6 7
• C:, which cares for the maintenance_of the 7 machlnesM, , Mi ... , M 7
MuchincA: 10 13 16 in the fadory. Crew C, is responsible for replacement of _the parts
MochincB : 8 16 which are worn, out while crewC2 oils and resets the machines back
for operation. The time required by crews C1 and C 2 on different
Find the Opimum sequence, min. dapsed time , and idletime on A_
machines is given below :
and 8 .
MintenanceTimc( inhrs) Fig . 1
!Ans. Optimum sequence : 6-, 4-, 1-+ 4...., 2-, 3...., 5. ;
Min. elapsed time = 83 hr>. Mochincs f------r-h1
- , _.;..::.M
:::.,'-r--:c
Mc-
, --.-'-,M
-:c,--'r-:c
Mc-
6~ M
;:-,-1
Idle time : 5 hrs. for A 11 hrs. for B.] er.we, 14 22 20 JO 28 16
8. A company has six jobs on hand coded ' A' to 'F '.All the jobs have to Cr<wC 2 20 18 IO
go thrugh two machines 'I.I I ' and ·1.1 II ·. The time required for each
Job on each machine, in hours, is given below : In what order the machines should be handled by crewC, and C 2 so
that the total time taken is minimized. Also, delem,ine what shall this
A B C D
time be?
Ml J 18 15 [Ans. (M2 ➔ M, ➔ M, ➔ Ms ➔ M, ➔ M, ➔ 1.1 7 ) or (1.1 2 -+M, -,M 5
MU 18 -,M 1 ➔ M, ➔ M, ➔ M,) ; minimum total time = 158hrs.) Fig . 2
24 l 15
13. Sal Automobile Works has six cars for repair. The repair consists of
Draw a sequence table scheduling the six jobs on the two machines. two steps procedure viz. dent removing and painting. The time
[Punjabi (M.B.A.) 1998] esfimatesareasfollows · JOll1 · t,.; ~ -- - - - ,.~J, PR(X-,R.\.., ! J
11
!Ans. Optimal sequence : A-, F -, D -, B-, C -, E.
Car Number 3 · 4 JOll1.._..-- ~ ~ -: EL,V?St:-On\ t:F • : -A Ht.ll~
Min. elapsed time= 96~rs. ldletime : 33hrs. lorM/andJhrs. for MIi. )
9. There are six Jobs which must go through two machines A and B In Time Estimate (dent removing) 16 IO II 13 18
the order AB. Processing times In hours are given below. TimcEsli.mate (painting) 15 9 15 II 12 14
I 2 J 4 5 Fing the correct sequence and prepare Gantt chart and schedule
MochincA 8 IO II 12 16 chart so as to minimize idle time. F¼I - 3
20
MachineB 5 0 J 9 [JNTU B.Tech. Ill (CS I Engg.) 2012)

PROCESSrNG n JOBS THROUGH THREE MACHINES

Opti mal Solutio n . So far no general procedure is av ailable
The problem can be described as : (1) Only three machines
A. Band Care involved, (i1) each job is processed in the prescribed for obtaining an optimal sequence in this case . However, the
order ABC ,(ii1) transfer of jobs is not pennitted , i. e.adhere strictly earlier method adopted by Johnson (1954) can be extended to
the order over each machine, and (iv) exact or expected processing cover lhe special cases where either one or both of the following
times are given in the following table · conditions hold : flll. 4
Job Machine A Machine B MachineC (1) The minimum rime on machine A ~ the maximum time
B, c, on machine B.
B, c, (i1) The minimum time on machine C~ the maximum time

I c,
B,
on machine B.
A, B, c. The procedure explained here (without proof) is lo replace the
problem w11h an equivalent problem, involving n jobs and two
FI\J . 5
 Q. 1. Explain the problem of process,ng ,..,,t,s ttm><l.Q~ INN
machines (JNT\J (II. r -.1 IOOOJ
2. Modify Johnson's metllod to solve the prob1em of proct!• smg n
-
Optlmol
-

So-ce nmo ln
--~
-
Machin• A

ron•
M achin• If

n me ln
Tint•
out
-
SEQUENC ING

MochlneC

Time In
----
T~::e
SEQUENCING

-
·1l11 i. 1.1hlc ~tw,"<. lh.tl !ht l<,tal min,mumr ld r""t° ,,~ ,
---
REM/IRK S
If cond ition s mm A, ~ ma• 9 and/or nili,
(1 , r,,, u'ii id, m.,. ,.

c ~ m, , 8 10 ,..O' ~oki i+-- -~ ~-:11 :,rv_..-r ,_ ,v-. >-•

· ~ , r. · r

Job• through three machtnes State e><pl,atty the undert\'11'9 The idle times for indl~ idual mtleh~s rrd'/ t,.a d!f"~...-, ,,.,,,ttt-~-,,. ..--a1
fora ll alttirnative opt,mal \!'QlH!'nce-s Butt,._idl., r .,.-~'O" • a c r-.r, ,:-r'!..,...,..,
~ A t ~ ~ .. ....,.- ,,... ...,,..d - ..
cond1hons. (UMnrt 20011 16 22 22 ~~ -+ - ~----i ~ - - -w
31 3. If w e change the order of mdchin, ~ (s.ay, -4.8( &:,.I. ' P'I~ r;r;, ,,,,. ,....,F1 _,'Jrl.
3. How will you solve the sequenong of n jOl)S on three mactune•7 lb 2A 29 3.1 10 ..
, - • ,,....., 7,v.""_..... ,.. ~,....,.., .,,._,,.~ _...,
[IINNI M.Sc. (M1th.l 2001 J 24 31 34 35
4 . There are n jobs lo be processed on - mechanics eacn Job
req uiring the sa me sequence of operabOns and no pas.smg rule
5
JI 42 42 46 46 51 - - - -- - -- ~&a
~ m~ inamm PROBLEMS
Thus any of the sequences from (1) 1o(v1) may be used lo orde r
is allowed Stating the assumpbons expla;n . how you would
determine the sequencing of )Obs whicll 15 opl)Onal. · b i, · h machines A, Band C. and they all will give a 1. We have five jobs each of which must go through the m,ochr~
:n/~~ e~~~ ti me of 5 1 hrs. Idle time for mac hine A is 9 hrs.
A B and C In lhe order ABC
[Madras (B .E.) 11199; Calleu11 B.Sc. (Slat.) HIM)
f'rocc,;,;1ng T1mrs / in hnor_, , _ _ _
for 8 31 hrs. forC 19 hrs. Job No.
lllustrative Exam les Example 2 Find the sequence that minimi:e_s tir e total Machrnc A
elapsed time required to complete t/re fo llow,ng tasks . Machi nc lJ
Example I There are jil'e jobs. each of•rhich must go thro11gh
machines A. B and C in the o rder ABC. Processing times are given Tasks C O E F G
MachincC
'N""i v~ ~ -e ~ --:r - .. ocs ~
in th e following table : Determine a sequence for the jobs that will m1n1m1ze the total efapsec
[JNT1J 9 TKA. 1 CS ZlC3. - - .1 •-
Timc onMachint l time and idle l ime for each mach ine. ,_ , , . '11.4 11 "7 i>J

Jobi
Proceuing Times Time on Machine /I 4
[Meerut (Maths .) 1998 BP, 93P; Tamlln■du (ERODE) 1!197]
[Ans . (i)2 --. 5 --. 4 --. 3 --; 1. (ii )5 -, 4 -, 3 -> 2 -, 1,
r:;--,;A-:~~-~:~~!:' ,;-;- ~~ ~~~
If, c, TimconJ',fachindl/ 6 7 5 II 12 (iii)5 --+ 2 --+ 4 --+ 3 --+ !;Min lime = 40hours idle times a hrs S. '-Ne ~ 'we-ccs sac.- ::f,.rx;r--s.st-,:; • ~ - ~ ~ .9 Jr0
for /\. 25hrs. for8, and 12 hrs. onC j C.n 7te cr.:er.taC' ~~ ""' .."'S... ~ ; ; w r r E'l!
[Pun)ab (B .Com.) 2006; Madra (B .E.) 1999,
!olc,w,t,c 710MO

lI
IAS (Main) 1998 (Type) 1996; lleerut II.Sc. (Maths.) 1995) 2. Find the sequence that m inimize s the total elapsed time (tn hou~
)
Solution We are given seven tasks each of which is to be required to complete the foll owing jobs on three mactunes
M 1, M 2 and M3 intheorder M 1M M .
performed on 3 machines /, fl _and lll. In the order / . [[.[//_ 2 3

Therefore. we observe that mm . t 1i = 3, mm . t?i =5 and (a ) ~ Job

Detemrine a sequence for f fre jobs that will minimize the elapsed
max., 2 . = 5. Since the condition min, t Ji ~ max. t rs sallsfied ,
21
the problem can be convened into the problem of / tasks and 2 t Machi~
[Ans. 7- 2- · - 3- , - ~-- -,., ,a:a,:r,e •
~ (]EA) PT 2009)
•:2-n
time T . machines. kftemnefcr
[JNTU (Mech. & Prod.) 2004, 2000; I.A.S. (Main) 1992) J. = , c--n. "0J3 =- ~ ~ ~ %:II'~ = , - --n l
Thus. if G and H denote the two machines. such that
Solution I . De~ a > e ~ ~ :,, : c , c s i : , . , , : ~ ~ -
Here min. A, = 6. max. B, = 6, min. C, = 4. G 1 =t 1i + t 2 i andH 1 =t 2i + t 3i for j = l.2. . . , 7. ~esec
tine ::.asec ::r :--e ~ -o--acor
Since one of two conditions is sati sfi ed by min A = max B, , Then the problem can be represented as 7 taskes and 2 [GBTU (MBA) 2012 Type; loteerut 2002)
1
so the procedure adopted in above exampl e can be followed. machines problem :
[Ans . (i )A--+D--+E --. B--+ C (ii)/1 --+ E -> D--+ B--+C
'-bd!llx\
(iii ID--> /I--> E --> B --> C. (ivlD--+ E--+ A -, B --+ C
The equi valent problem. involving fi ve jobs and 1wo fi clitious Task (v)E-->D--+/1--+B-->C (vi) E--; A --+ D--+ B--+ C M .--!!mcl!I
A
mac hine G and H. becomes: Min time = 51hours; ldle limeslorl 9 hrs. forll 31 hrs, for 11119hrs.( M•d11B<C
G 3+4 8+ 3 7+2 4+ 5 9+ I 8+ 4 7+ 3 ~ !In, Qr oa±lc:es S ;,,,er, _, ho<n a,-., passr,g IS r>O(
Processing Times
=7 =II =9 :9 = IO =1 2 = 10 (b ) ~ Job
~ [DalN (II.Com) 2008]
Job/ H Machi~
4+ 6 3+ 7 2+5 5 + 11 I+ 5 -4 + 6 3 + 12 A fAns.. 4 - 5 - 1 - :. - .3 - S: - - :1 -' - 5 - 1 - 3 - 2 - 6 - 7
G1 l= A, + B11 H 1 I= B1 + C11 = 10 = 10 =7 = 16 =6 = 10 = 15 M1 ;,.,, !0!3l - • -.;: -n. J
13 M, 7. FIOO ~~
ir,,. nr;r.,,..~
15 Using the Johnson 's optimal sequence algorithm, the M ~ -
it'. at
~11'\l ,ccs en :iv- nacnnes "' =
1N> toai CrTle requ.red l'l
or:ier ~c
IO
foll owing optimal sequence can be obtained as :
~1~\!e-=: ~O~o~r;j c _. A (lf l: _. B _. D - \ - A. ~ ~, : - ----'-
)<lb
' - - - -- -- -
10 3. Find the sequence thal minimizes the lolal elapsed time required
\ 4.iuil'." 'l 5
lo complete the following tasks. Eac h JO b IS processed in the
\l .a,."ft.tB.""S
To calculate the total elapsed time, we have order ACB ----~
l
~i...-1,,occ W I
This new problem can be solved by the procedure descri bed Job
earlier. Because of lies, possi ble optimal sequences are : T11k In Optimal Sequence [....MM.Sc. (Math.) 1997]
Machine [A ns. ~- s- c1
- i - , - 3 mirumumtotal bme = 53 hrs )
A D 12 6
( i) / 3 I 2 i I l4 ls I Iii) 1 3 1 2 1 4 1 1 is I In 0 3
G
7
B F C E I. Fm tr>o seque<>..--., tn..l min'""---es Ille total elapsed bme (1n hours)
~ IIO complete tne followlng jobs on lhrei! mact11nes
ABC in
I 14 22 JO 37 theocder CBA
Ou1 3 7
1i1i) j J /2 14 l s II I (iv) / 3 l 2 i s l4 I I I In 3 7
14
14
22 30 37 46 ,..~ :r,. ~
II 22 30 37 46 M. ...:tun...• .\
Out
I
J / 1 , , 1s 4 I I
( l'i ) 13 j 2 is i 1 1 4 I Ill
In
7
7
12
13
17
24
25 34 39 47 ~::·~::;; I 12
3
36 43 49 54
II is possi ble 10 calcula1e the minimum elapsed lime for first Ou1 13 (JNTU B . Tech . 111 (CS & Engg.) 2012)
2A 36
op1im;il seq ue nce as shown be low : 43 49 54 [El
'5_-·
.. ._ ' "" '-ll!n

----.--~-·--~-
l..~:k - ~-
& ~ . . . : . . . . a• • C . . • ft. i.t-:4c,-.p: : ~ Ex aruplc 3 l ' , 111\' t.:HtJ•hh ol mcrlw, I. n 1l,·ul,11,· 1hr ,,,mww ,,,

t., .,:t..,,r • .._.,.. :rw.i:.• ~ I - ~~ - .. ,,,,. • r,,,rc 11t· t·d1 d It • /tn\ f "\ 1 p•I• I , 111, / /1-./• : '"'/i , , ttl,I , III Ot. , . \ , JI t I)
-~ ~,,. ....
... .,,,._,.~......
.- ..,,.... .. .:,.~,.,..~ , , _ • .,._ - ~ ; \ r 1',Vl u h - ,m, / I·: 11· j, ,, <tli I, '1hh li111r tin,/ tl h- 1,.J , Hl11 , Ii ,l1t•11l1/ I'<" 1/, 1,1t· f i, , r
\ / , .,. • 11ft 11/,1t c , ,,,. '"'•'' "'"' '" 1,kd 11, l ,m,, ,/, ·11~/"(1th 1hr p>I •,
........... w . . ..... "I' -..~. '~ ., e-r n.,;;s-., .. ~ --~ • - --
...n• •-~ e.-~,-,
•• f• -·

- ..,..,._.,~ . ~~
,,, Ill. ("

f 11n,,J11,,
W.,tn'("' -

~- , .
...,. ..
?•
l
So lution
''-10,.,...'\"
1,11. ,,.,,

11 ,l. p .1ph1c 1I , ,,h11h 111 , ,1 th £' p1, •l 1 lri11 1,

I
I .'

d, , , 11 , , ,·d
«fto'(..- • 'llc.3 l"·n· 11, 1, ,lh"''
Strr I. hr, 1. \\\' t h 11\\ \ • 0 \l i: h 1 ' '-'l" \' " ~111 th e P " 'l f to\~.JII ~ IIIHl' pf

joh I P l\ d1ll c• l\· 111 111ttrl 11m· ~ " l't' J' lll tl IP b : 11 111' 1 IH' II ,

d1 .1 ,, ) 1'" ' 111 1,· p,, ... ,,. 111 thr ,,,,,.,.,11,u>,t '"'"' 1•1 I''" ~
~r q ,111 ~• 1, b I 1d k
1

.,,,,,J, ~1 111 l.. thr p rPd ·, , 111 ~ l l1t h·, l p 1 111h I r11H I 111h -;
,r, ,'\•, 11, ~h 11 ut •1d111 )t IP 1h1· W. " '" " 1•1 d r 1 1• f 111u1 h111 r,

___ __
... , _.,.
. . . .......... . ~-..- ,.,,.,.,
I ..._
._. t

l ,ln4'i ..,,
Ai~

,.,_ h
M '
Hi~

16

.l
1~
·
1.-.c'U

, ,.,.:, ,

11, ,, 1, • u

~ ltll f W.
ft 1f

a.J" _,

•.

l
'
- ~•t '"

,,tu: ,
fll

WI
._.

.......
t
tM<.-. \. .:a(l ,~
t

1J• ' 111 , o. 1 ~1 . 1

, ,1

~ I ti ••
11
•.-a

1 ,

t -IJ\
• .._ fi •:t.~ ~

U
t, l

!, ,

tu
.1

Nt u

Q •
I.'>.,_., L
Ult'
e
~
..... "

t: 1
11 ,t,l .u "'l \ lu,
tf\ ·tw- ... ,,., ,,,
ti.-1 t• uu.h""'"'

cfw- 11•1r ,n
J\ ,,l l 1hl h
,, hh h ,~\. h.-11 1 li n 1111h~ t11llt-" 111i: fl ~ u w
, .. u 11,· , u111pk, ll lill hh w J\ 111 1..,-.. , . lw, r,., h it• I WIid ulslJ
1111 )t •h .' M ,1l.. r 11·, l 11 11 r l 1· l n r in .1t l11 11(" 1\ ., ~ ,'1 1,,~" 111 1hr

" ,,,. r• o.1 111

• o'"' ,U 11111

•d. Chi' h, .. ,, •• ,, .. ,

-0, • , . HI H i&: "4\j fll,,i: t IU.. , ,.. • "'t"-""' • 1JJ 1$o. fi• '"f It
"' u-.-. ti.,, .. ,~
H• f -, ... n,.. ,) t\o td
,,. ' lit.,. IM(

•" ~ •( 1oo... , .,
hl,;,. o iJ'I. ...

OO&J , .. Jot
- -~•.,..•r'
I .. i.,."''r
,. l1•· th("""~,

f ll!U f1 ' u10 ,l ~ ,t )' "'-r U l<J \.. r , ,t ),. f t , l >• \t1I • ft of f h ~ l , ll t•
/II / J 1,,.J f , I.. ,
• ...,.., l ,&.i • , S. A#..,. I

•ai'll'li,.. j
 SEQUENCING
SEQUENCING
Then, Tora/ elapsed rime = Pro~e:;'8 rime for job I +
Sttp 5. The IOlal elapsed time is delennined by adding lhe idle
lime for eilher of lhe jobs lo lhe processi ng lime for lhal
/d/e1imeforjob I= 34 +( 4 + 6) - m. . .
Allcmali;•ely. lolal elapsed 1imc = proc~s ,ng lime for
Rlustrative I # fl II i·M
job. Exam ple 1 Solve the following sequencing problem g,vmt? I ~ T: , = 10. max T,, = IL
job 2 + idle lime for job 2 = 40 + 32 - 28 - 44 hrs . and
:. Idle lime for lhe selecled palh = 4 + 6 = IO hrs. for job I cm optimal .w lution when passin g is no/ of/owed.
and 4 hrs. for job 2. max T,, = &.rn:u T 1, =l 2i.
Job i/)
J I
&amination PROBLEMS Machine In
Since the: con6:ioc~
M1 16 16
1. Two jobs are lo be processed on four machines A. B, C and 0 . The tmm T1 ?max l ., )
M, 6
technological order for these machines is as follows : Scclucncc
Job I lime M, and / min T, , ;,, mn T ' for' = 2. 3. ~- 5
Jobi A B C D
M, } I
Job2
Job 2 ~ are satisfied. the probkm c;c be coover.al into 4-job and
Processing times are given In the f°'lowing table Solution In lhis example.
2-mach ine probletl]_
Machines Use graphic method to obtain minimum elapsed time
""inT,; =9=T13 ."'fnT4; =8=T42 Thus. if G and H om i,,.·o flCt.loocs machmes sucb 1h31
B C [Ans. Graph will show that both the jobs can be done simultaneously w -1 ""'
until job 1 is completed, and after that job 2 Is completed. The total
mt T 1 1 =6 = T25 , max T3; = 8 = T34 . Tc, = , ~ I r,, a::x1 Tc,, = . ~: 7 9 .
elapsed time Is 15 hours.) 1
Find the optimal sequence of jobs on each of the machine 3. use graphical method to minimize the time needed to process the !hen the problem can be reformuia2d as .!-Job and 2-macbine
Since the conditions
following jobs on machines A, B, C, D and E. Find the total time problem as :
(Hlnl An optimal path is one that minimizes the idle time for job 1
(horizontal movement). Similarly, an optimal path is one lhat elapsed lo complele bolh lhe jobs. Also find for each job lhe <"'j" Tv ~m;ixT,i .i=2.3)
minimizes idle llme for job 2 (vertical movement).] madiines on which it should be processed. Processing time Is given
[An1. Tolal elapsed time= 24 hrs.) In minutes. and ("'jn T4;;,, o/ T,1, i= 2. 3) 55 ~
2. A Machine shop has four machines A, B, C, D. Two jobs must be Job 1 A-20 C-10 D-10 8-30 E-25 F-16
bolh are salisfied, conven this problem inlo fi ve jobs and 62 58
proceued through each of these machines. The time (in hours) taken Job 2 A-10 C-30 8-15 D-10 F-15 E-20
[AIMS (BE) Bangfore 2002) two-machine problem. Using lhe optimal sequence algorithm. an optimal sequence is
on each al lhe rnact,ines and lhe neoessa,y sequence of jobs through
lheshopan,givenbelow : (An ■. Minimum total time is 150 hours.]
j= t{s~'.. ~ 'Je:%;~ 7t,~\r~J;~d ~~sir~~:c~o;:1:1 :;~~ obtainM as C ➔ A -> B -> D. 1k total elapsed rune may be
calculated as follows :
sequence for five jobs and two macl1i11es M I and M 4 in the order
PROCESSING n JOBS TifROUGH m MACI-DNES M 1M 4 meaning !hereby M 1 andM 3 have no effecl on _ lhe
Lei each of lhe n jobs be processed lhrough m machines. say optimality of lhe sequences. Following lhe usual optimal
Now delermine 1he oplimal sequence of n jobs through 2
M,.M 1 .M 3 , ... ,Mm in lhe order M 1 M 1 M3 ... Mm, and Tii sequence algorilhm. oblain lhe optimal . sequence Optimal C II C}-1) !}-.:0 ::0-.!0 _\0-I'.7 ~ :::

~=: -
machines by using lhe optimal sequence algorilhm. C-, A -, E -, D-, B. Therefore. lhe 101al elapsed ume may be
s.:,u;:.;: ; ~:~ ~~ :::~
denole lhe lime IJllcen by lhe ith machine to complele the jlh job. Step 5. In addition 10 conditions given in step 4, if calcula1ed as foll ows :
The slep-by-step procedure for oblaining an optimal seq uence is ~1 16
T, ; + T31 + ... + T,m- l)f = C (afi.xedposirivecomttmt) Machine
as follows: M,
D I 5> 74 7-'--.<o SO-S5 91-IO I 9 1-IO I I ll>-130
for all j = I. 2. ... , n, lhen delerminc lhe optimal sequence
Step/. Firsifind,(I) min (T,;),(i1)"'jn(Tmj),and for II jobs and lwo machines M, and M"' in 1he o rder C}-9 9-14 14- 19 19--)2 This table shows that !be Iota.I <elapsed time is wQ} hrs.
OpLScquence 9- 20 2(}-24 24-JO .'~--45 E.xample 3 So/,·e th,, follo wing sequencing problem wlren
M, Mm by using lhc Johnson's oplimal seq uen ce
(ii,)mj"'(T21 . T31 , ... , T,m-l lJ) for j=l 2. algorilhm . orJobs 2(}-36 36-42 42--46 46--57 pa.Hing i.s not allo M·ed ·
36-52 52- 54 54-62 62-7 1
Stt p 1. Then check whe1her 52-65 65-68 68-7 5 75-83.
- l~timeinhoursl
ltam lil
NOTE5
(,) ""in (T11 )~mr(Tu) for i=2.3, .. .,m-l. or This 1able shows 1ha1 the 101al elapsed lime is 83 hrs.
1. Ir in addition to condltk>n given In the sttp 4,
the
S 15
Ty= T,.., andTGJ= THJ• forj = l, 2, ..• , n. f!,en n ! number of optlmal Example 2 77,ere are 4 jobs each of which has 10 go th rough
(ii) m}n<Tm1 )~m/x(T11 ) for i=2.3 .... ,m-l. sequencMwlllexist 10
rhe machines M ,, i=J,2, .... 6 ,n the order M,M 2··· M•.
2 Ill 16
St, p J . If inequali1ies of sttp 2 are nol satisfied, lhis melhod fails. This procedure for sequencing n jobs through m machines Is not a Processing times are given.
Otherwise, go to nexl slep. gene-ral procedure. This me-thod Is ilpplicable to only such seQuendng Machinc(i) IV I 11
protJ,e-ms In which minimum timt' o, cost of proc~lng the jobs M, M, M, [lhen,t M.Sc:- (Math.) 1996, 94)
Slrp ./. Conven lhe m-mnchine problem inlo 2-machine th
rough first and/or last machine Is greate, than or eQua l to tht' time or 20 10
problem considering two ficlitious machines G and H Solution ln this pmblem. min . A, = 12 and ma., . 8 1 = 5 and
:::~:oc:essin~ the jobs through m~iocre- machine. There are many . 19
so 1ha1 • Job(j) B max . C , = 10. Sin.:e, min. A,~ ma., . C, . given problem can be
operations where themachines are set i.n such order that 10
doesnotobeythisruie_ 13 wntten as
TG, = T,, + T2J + .. + T,m-11 ; D 22 Item m
and IV
TIv = T, 1 + T31 + .. + T"1/.
~:;sn;;/;::,: ;quence
Oifihese four jobs which minimizes tlu• Iota /
(Agra 1998; Rohllkhand 1991 (Type))
M:K"h1nc G
Machmcl/
24
Solution In 1his example,
(n~in T, 1 = 13, mjn To, = 14) where G , = A, + B, + C, and H , = B, + C, + D, ..
 MM =
opti~~c,:qll~;ncc:n~;~i;;:h~~ :.t~:i:fn A417:'24~~::~i::~e~•. s~,:~
D,•rem1i11e a uq11e11cr nf jobs A. IJ. C
rornl elapsed r,me.
{l/li:~..::,~;r(~;~~~~
.)
SEQUENCJNo

,·.,rt,, 1998)
SEQUENCING

~ · iww. lia a.c• J

one giving an opti mal SC(lucncc : So lu t ion In this problem. min . 111 =11 and mi11 .. I•; =12; ~•chin• Proeeulng T'~e On hra .J
~ .{I~ A,l• .,J ~~
r-11--.m-.1v. 1-. 11- 1v, 111. 1-. 111 - 1v ...... 11.
1- ,v - n - 111 . ... ctc
max. or, ,, , ,, andri, nre8, 9.6and
2 31 1
rcspcctii vely. SinceW Job M, M1. Ma
the conditions : min. 111 2: max . fy ond m111 . r,,1 2: max . l u, for
Each or these optimal sequences will give us 1he same Iota!
elapsed lime. Thus. we ha ve (j = I, 2, 3. 4, 5) arc satisfied, the given problem can be expressed

~ !I
I II Ill I\/ Job 12
h
MochinrG Jl 46 36 ]9 r - v t ~- C-..) 1-J
I)
A{~I 0
15
ll
27
27
4)
4)
c,o
Machincll ll 40 JI 7. Solv<,tl>ef~ ~ c r . . - . -
l 6 {MNru1 M.Sc . (Mith .) 19119)
/J{~, ll
20
27 4) 60
6)
whcreG, =1: 11 ,1 and H, =I ~1 f;J. IAn1. A -+ B -+ C -+ D, A -+ B - D - 1 C, etc (.C l such aequence1 ).
minimum total elapsed Ume a 61hrs.)
29 46
c/:;., 211
24
29
)9
46
ll 67
6) Now. by optimal sequence algorith m, we obtain the following
sequence :
6 . Find l~e opllmal sequence for processing 4 jobs A 8 , C and Don four
machines A, A, . A, and A. In Jhe order A,A,A,A. . processing limes for
which are given as undor :
0{~u1 24 )9 l6 67
)9 ll 1,1 [ill The total elapsed time is calcu lated as given in the fo llowing
table:
:. Total elapsed lime= 84hours, and 4!(= 24)sequences.
Opumul Mnchloc i---•..SC..(ltalh. ) 2007]
Example 4 We hav<' 4 jobs cacl, of whicl, hw· to go rl,,011gh rlw s.q..,,~. ~ - - -- - , -- --,.-- , - - ~ ~ -----l
;;:.~~~:,:,x%~~{;;, !;,.0 -~·;;~~,:;1e;:~:, .order M I M 2 M J M 4 M )M 6 • ofJobt M,
S I IEDULIN G T II E MMNTENANCli CllEWS
M,
0-11 11 -16 16-24 24-2? 21J,J6 36-l l
~c
M, M, M, M, M, In a l'uclory the problem or schedul ing u joh can be extended
h

~
11 -29 l?-37 )7-44 44-46 46-56 l(,-81 rurt.hcr for schc<luling the crews or factory maintenance in such a _:..:...__,_____:__---=-._ _11_,....J;
M1 \I •
~ _':..:.
" c...
' _
M ~ bJOC
A IN munncr so Ihut their i<llc time is minimized. Suppose a factory has ---t-- --1
K 7 2 JO 25
n 17 29-46 4(>-52 52-61 61 -67 67-75 Kl-100 Cn=w C 1 8 b 10
I, 'I a group or different mnchines in its plant which require the
C II l K
6
l
K
7
l'I
15 46-66 6fs70 70-73 73-77 77-Hl 100-112 prcvcn1i vc maintenance. In fact, the crew stuff is divided inlo two :· Cn:wc , I 5
D 2U 4 sets A nnd /J. In the beginn ing , crew A Jakes the machine and
J 4 K 12 In ,.-hu1 ord,·, s/wuld tlu- ma.hmr, ~ J,.:;r.J!,d ~ rrn. C I and C,
From this Jobie, the minimum elapsed lime = 11 2 hrs. replaces its pans ncconding Ju the requirement. Aflcr that. crcwB
rc •arrnngcs the machine and sets it ugni n into the operation . In cn..'\C so 1hnr thr total tim rlak.t'rt i.r mirumi:.ed ~
the service limes or both the groups A and 8 working on different Sol ution Con:.ick.ring the n1Xhux.,. as i ,terns ~ crews a.s
Examination PROBLEMS
~~-=
m:u:hincs arc known, the optimal scc1ucncc cun be dctcm1incd so
that the idle time or the crews is minimum. the service foci Iii)'. the opumaJ '°luc:nc.-.:, an be, dctcnn mcd »
=:t:::,:~~~~~s.not allowod, aolvo tho fol/owing problems (Jiving en Now the procedure of sol ving sequencing problems given
earlier mny be restated as fo llows :
~' T M, ·"~ ~ - .11 , ~
Sr,•p I. First, select Jl1c sm,dlesJof nil values appearing in two rows. Tlle 101al clar,sed tune: C11kuJ31«J os foUo v. s .
M, M,
Machine
"-...__,__ ·'"" A B C D £ Step 2. I( Jl1c value lies in Jl1c li r.;J row, then Ilic mochinc according
,s

M, M1~ ~ to thut value will be given Jl1c priority for scrvia:.

M1 Ill 12 H
S/t'/J J. I( ii comes in the second row, then that mac hine wi ll be
Jul> n 15 16
M, J
given the priority for service. _
2 4 I l Srep ./. Jn case ll1crc is a tic wi thin Ilic same row. then c11hcr of
M, l 6 4 7 .1 the machines involved in the opcmtion will be selected
10 M,
l 4 H. 14 7 and assigned the first or the seco,rd place according 10 the
ll K 10
!Ano. A - c - n - D, min. lime • 67hourw.J IMNrut 2002 (Type)) tic lying in the first or 1he s,•co11J row.
4 IAno. C- A - f - D - 8: mln lo!Jllllme . 76h,. J Step 5. When th is assig ~ment has been mnde, cross-out the Thus, the 10101 elap.«,J lime Jo handle the machi nes is 66
l. Mad1inc
· ~~ !:!~~~~~t=:'ng P,ob4em gjylng an opl1mal sequence machine involved ,n the opcra11on.
Step 6. Finally, we repeal 1hc steps I Jo 5 so long as all the
hours. The ,._,rkinit and the iJk time ti n hrs.) or C I and C , arc
given in the followin~ fiRu~ . •
assignmcnb arc done.
ProcHling Tlme On hrs.)

lO , - M,
~ + __:_:
M>:'...._...j..____:_M
.::_:•~
Rlustrative Exam le CJ Idle lime

2l Exam le 1 The mai11tenar1ct crtw of" com11~11y is dfridnl in

fAn■. n -A- n -c; mln tJ~ 12ShraJ 12 P C Jc 1vhich car<'S for tht• maut1t•mmct of thr
18 lwo groups I t~ ·.r ;~spmJJibl<'for replaet'"'""' of ports which
l . ' ~~~~CNtting prot>,em giving an optlm•I sofuUon when ?tilling
17
10 ,,~,c::
~ ~ :~ ';,~::~,if)
; rew C 2 oils tm<~ rrst'IJ tht' ,rwchi,u•s back for
28 ar . , e1imts (in
1 0
1 hrs.) rC'quire,J by crt•w.,· mu/Cl ori
CI

{Ano. 4 - , _ 2 - 3 minim [ModrH (MBA) 1996)

Jif/;:::~:,!~;,ines
which need working o,1 ,Jinn art· asfollm,·s : 10 20 30
Hours
◄O 50 60 70
. um total e!Jlpse<j ~me = 97 h,._J
 SEQUENCINQ
SEQ/11 SEQUENCING J
&amination PROBLEMS Review QUESTIONS
ulres a ~ of wor1<men with completely diHerent
1. A company has B la,ve machines which receive preventJve ••_ch sta9"wo"::: on stage e can start only when stage A has been
maintenance. The maintenance team is divtded Into two crews Aand
8 . Crew A takes the maintenance 'Power' and replaces parts
skills.le~;. A plant has to be closed for the entire pe_riod of its
::~auling. The present schedule of the overhaul of the six plants is
~~:':i~s:~~
1. Glve Johnson:s procedure for determining an opllmaJ sequence for
;,~~~r~n two machines Gr, e 1ustificatlon r-' the nJe
J J Y...0

(• , ~ , : , ~
.-va ~
.res
according to a given machine schedule. The second crew resets the
machine and puts It back Into operation. At all times. the no passing
asfollOWS :
Tirn<RcquircdbyCrcw (indays)
2. Whal isGantt chart ? lllustratewtthanexample
3. Explain brieny the solution procedure of proc..ssmg of two JOOS
:: :::;::-..::::.~-=al•~
rule Is considered to be in effect. The servicing times ror each
machine are given below :
Plan! Pi P, P, :~~~uph~~~~~~:t~n;;h:he:n,~h;:::~~:~~~~~:,
follow.1ng rule : ·1r machine A precedes mach,ne 8 f0< Job 1 and
~=: : (el 8y USW19 _,..~
~ )w--. <r<O .-;f .
r,0!2!JCT -
,-..e
~ lor :ne lcilowng

mach~ne B precedes ~~chine A for Job 2, then no programme that <, I~ ,er tir.e -;t • pc
Crew A
Cl"t'wA. 5 21 16 15 II contains both the deos1ons : (a) job 2 befOfe job 1. and (b J job 1 c,,, 1 1,1ear - r e
CrtwB 10
4 before job 2 on machine B, is technologically feasible.- (lv ) !Aear - -es&
CrcwB 6 10 12

-
(a) Oetemiine the optimal sequence. 4. (a) A job consists of N_steps. Step I takes time f, , If these Jobs are 5. Howdoes lrWO se:uer:cn; ~ - . e c : t'e ~
grouped somehow into station systems, then twice as many unrts
Determine the opUmal sequence of scheduling the factory (b) If downtime of any of the six plants costs Rs. 800 per day for , . Wnte sr,ott r,c:;,es on ~ ~ ~ l o r n ,oos on !WO
can be produced each day. Also two set-ups in paranel can also
maintenance crews to minimize their idle lime and represent ii on a a plant. idle time for crew A costs Rs. 250 per day, and idle double the production rate . critically examine the adva ntages of
chart. time for crew B costs Rs. 430 per day. Which of the two these two approaches
(An1.h --tb --+B --t e --tC --t d--+ f --t g-, min. time= 90hrs.J schedules the present one and the one detemnined in (a} , (b) What do you understand by the following terms in the context of
2. A refrigeration company has 6 plants located in different parts of a will be more economical? What are their respective costs? sequence of jobs :
city. Every year tt Is necessary for each (plant) to be completely !Ans. (a) P, -+ P0 -+ P, -+ P, -+ P, -+ P2 . (b) Present schedule
overhauled. The overhauling is carried out In two stages A and B. and ccst= Rs. 6,4,630 and opUmum schedule cost= Rs. 60,310.) Review PROBLEMS
COMPLEX SEQ UENCING PROBLEMS 1. A ready-made gannent manufacturer has to process seven items
through two stages of production , viz . cutting and sewing. The time
So far we have discussed only simple problems of (vii/ Machine Brea kdown : unfortunately, machine may taken for each of these items at the different stages are given be~
sequencing. But in our real life, some more complicated problems breakdown, operator may be absent or may be injured during work inappropriate units.
S 10 9 13
may arise. Such problems may involve the following situations : period. I 2 J 4 9 15 JI
6
(i ) O,wlapping : Sometimes, when the producer is Moreover, some alternative ways for the jobs on different ProccssingTimcCuning : 5 1 3 4 6 7 12 'Theentriesg,vetrte tr.ie r. ho.ncn :,,,e ~
producing a number of products of the same type, the machines may be allowed, if more than one machine of the Proccssing Timc Scwing : 2 [Al'IS-4 ~ 1 - 3 - 5- 2 ~ 7 - 8 - 6 mn. tirne= 81tn.J
6 7 5 9 5 8.
overlapping may occur. In the situation when some items are same type exists. Funher, machine times and/or costs may be 4. Find the sequence tr\ill
(a) Find an order in which these items are to be processed through
ITWWT'1l2leS the tDCal lime required n
processed first in one operation may be processed for second uncertain, i.e. may change suddenly . In such complex these stages so as to minimize the total processing time perfomung the -...JOCS on - r,ac:w,es on the order ABC
operation before the remaining items of the same type could go situations, the problem is tackled individually and a trial !Ans. (a/ 3 -+ 4 -+ 5-+ 7-+ 2 ..... 6 -+ tmln. time= 46 hrs, idle time Job
for the first operation. on cutting = 2 hrs Idle time on sewing = 4 hrs.J
solution is made .
(ii/ Re" orkin~ : When one of the operations in sequence
(b) Suppose the third stage of production is added, viz. pressing and
Also to deal with such complex situations there may be two packing, with processing time for these items is as follows I
is an inspection operation, rework is needed to be done. The approaches : 10
/rem No. I 2 J 4 5 6
defective products are lo be returned back to previous operation 5. A company has jobs ..tw:I, rn,s: go lhrougn machines X . Y and Z ,n
. • (a/ First ~pproach is to split the problem into sub-problems of Proces.sing limc 10 12 II 13 12 10 11.
for reworking. This causes either a delay or we have to split the (Pressing&Packing / the order >NZ The processr,g - .... .
jobs into two parts. ~mple natur_e which can_easily be solved by available technique . k,I,
owever, this approach 1s open lo all the weaknesses to treating a Find an order In which these seven Items ar:9 to be processed so as to
(iii/ Tim,• of Trnn,portiun : A considerable amount of
sy st em in path using sub-optimization. This may lead 10 lower
time may be taken to ITansporting the items from one facility to
another. The facilities may be provided in other plants. value of overall systems efficiency. In case, sub-optimization is
minimize the time taken to process all the rtems through all the three
stages. [l.A.S. (Main) 1991]
M adune iI
X
!O
so
1::0
JOO
50
90
20
50

( i i') Pr oc .. ,,in~ Time hring Varia ble : The time that is ~e::;;~!~~; account of inadequacy of available procedures, the
[Hint When third stage _Is added, lhi_s becomes
problem. Required cond1ti0n ,s also sahsfied.J
~machine 2-job
. . 5.
,0 60
(•l A boolo. bonder has one pnnbng pn,ss, one binding machine and
50 120.

needed to perfonn any operation may vary from one shift lo the
other, . since this usually happends during multi-s1age
rs mu st look mto the whole system carefully .
th
com~~:x Se~:~1~~ e other approach for dealing with such
~~~~~ 42 ;r;o~ : ; ; r.r:~.;;,~:7~~ ~;:;,;:~:!l=ng"'i
the manuscnpls ol a number of diffen,nt bool<s. The times
required to pe<fonn the pnnting and binding operation for each
boolo. ""' known Detennine the order in which !he bool<s should
opcra11oos. 2. The follotng d~b~a:~::hea:;~s;~~ ~~:~ni'.:'ih:] be pnx:essed ., Mier to minimize the total time required to
technique in whic: ts Monte-~arl~ Technique. This is the
11·/ Shortugr, of ~lutcriul : The raw material needed for
th
of the system is u.~ e probabiluy dmribution of characteris~cs ;;dch::: o~nhmeda~h inwhe
process1ngsc 1
ue
~ ~t~/~:n,~~;•p~:!7n~ ,:;::~~hi: pt<X:eSS au the books. Fmd also the total bme required (clearty
state any aJgonlhm you m,ght use).
manufacturing the item in particular operation may run out. time on each machi~· Such charactmstJcs may be (i) Process mg P'ro-."'eSSmgTimcinMinutes
time also.
/i·i) E,1Mlith1~ : If there is an urgent demand of an item, than one machine of· ~~Availab,Jnyo_fthe m~chinesJiii/ More 2 J 4 5 6 7 ~ 9 JO 8,-,1; I J 4 S
/t~m No.
13 10 5 6 2 15 to 7 f'rinll ng Um< -IQ 90 80 60 SQ
:~nd~!:~.ular Job may have to be done violating the sequence skillsoftheoperatorsind' same type, (i v) Vanations m workmg MachincA :
t2 . 11 to 13 7 5 11. B,n.!ini: time, 50 60 20 30 40.
being availabl ~ d . ifferent shifts, (v) Alternative procedures M.achincO : 8 5
[JNTU (B . Tach) 2002 (Type)] (b) Suppose that an additional operation is added to the process
e or mng the Jobs, etc. descnbed ,n (a). 1.e. finishing . The time required for this operation
areg,venbelow
Finishing Time in MinUles
Book I 2 J
Fan1shrng 80 100
►
•
What ls the orde< In which tne booil..s shoukf be processed Find also
the m inimal lotat elapsed time
(An ■ . (8) 1 -. 2 - 5 - • .f - 3,min time= 5 hrs
on pnnllng machine ,. 20 min , on binding mad'une
,o
mmutes Idle l ime
SEQU ENCING
SEQUENCING

N
uow~h•I;;
,\
T-,.-~.", I~
'3e"~ •.-~ ___ ,..~.,,_.-, v:=;
,.. .-: .-f•• ·- -
- • :.c-"'-• ,#!Jaf ..
~

! . ..t .,.. • .;
'"' 110m1nutes
(b)5 - 1 - 4 - 2 - 3.m•n Ume = 8hrs 30mmules ldlehmeon
pnn11ng machine . tOOm1n . on bind ing n1act,1ne - JIOmlnules .
IJ
C
I 8
411
J ~~=-:;:,,;;..:;~ ~~~=::~ £.s~l!Xl'ZJ
and 90 m inute ■ oo nn1sh1ng mach ine I
_l_ () ~
(liJII
IJ
7. A mach ine operalo, haa to perlorm threie operahons

to perform rtwtse operabons (in minutes) for each JOb 1s known

fum ing,
threading and knurhng (lcnoblng) on d1tferenI Jobs The lime required

Determine lhe order In which lhe Jobs sh ould be processed in order 10

minimized the lotal rime required 10 work out all lhe Jobs Also find the
D,·,l
l.;unp
Tn~k
Applying John son 's algonl~
Hence, B would be done first and O last
_ __ _ _ _ _ _ _ _ _ __ _ _ _ _ _ _-ar.r
_,,._..__
, ~ rrun,mum ,s a to, 8 ard o ::.-:xt,

,._. - - - - - - - - - - - - - - -
§~~~~~;~~?:§§.
C1lffcc l:1~lc
min imum elapsed llme
(i) Determine an optimal sequence . Model ObjecliDe QUESTIONS
(ii) What Is the total elapsed time for an opl1mal sequence.

(iii) What is the total idle time at stages 1, 2 a[~~~U (B. Tech .) 2003) 1. TherearetwomachinesM 1 andM 2 wtuchproc.eujOtls~ B C c £ fa ) p c s - - ~ ~ • +-,fT"-'l::: ~ ~
and F. The following sequence for these Jobs 1s M tollowec: by AJ :he"";,r~,ec:::,,-c-.:-e ~-=-:r
1 2
Consider lhe following data In this regard
[JNTU (B . Tech .) 2003]
(bJ X l t i l d ~ ~ - ~ - r « : >, "-e ; o , " 1 7 ~ - ~ ~
Processing time required 1n minutes fsr's:1Qt c-,e- ,ot3,;c,es i: ~ - . , , , . - : 7":e~_,....-~as elC'
C,Ol"'"'les.c:e-acr- es-3
Jobs A (C ) a,11pca ~ ~ ~ lrf!.., ~ '0'" ~
Short Answer Tfbe QUESTIONS Machines (d) ;dal"-"
12 I 7. -rte ~ ~ ~ • -a ::::r.: r ~ • ~
1. A company is producing a batch of five parts A 0 , E. N and L using ~!IT~
three machines X, W. M. All these parts are lo be produced in lhe
technological order X M, W machines . The sum of the processing
(.al a ~ c . - ~ ~
~ ~ o.y ~ ccs, ~ ',,,:r- ::r'!!'
-r.- :.ne cc.• J :;,,-,er :DIN -::f ~
The processing sequence of Jobs that would mmimize the make (b ) ~ ~ e
andset-upl1mes lnmlnutesfortheseparts lneachoflhesemachines anome,- ,s ~
spanIs ·
is given below ·
(c l i!'te ~ ! : l ' " " " e s ~ . . . . , = ~ ~ ~ -:;t =--e
Tlme of Machines (Minutes) (a)C --+ A--+F - E --+ D --+ B (b)C --+ A --+ 8 ---, O ---;, E-F
oroer .-. wrx:n~ ,:;c:s ~ ~ :::r ~ -
(c) C--+A--+D -> B ---t F --+ E (d) E ---+ F --+ D -... B ---.A-C (d ) a fCD onc:I!' ~ or • ~ -=a.a: :,e ~ IC cne :x::.-::
[IES (Mech .) 1997] a/ c o m ~ ~
2. Man~facturing a product requires processing on four machines A. a,

~-"'
I . Asec:ueru::nc;Cf":IOier'" ~ = c . e e . - . : . ) ~ ~ ~
· C. D m the order A --+ B --+ C--+ D . The capacities of four ~nes
are . A= 100. B = 100, C= 120and O= 130 units persMl tfthe
Part 0 (il ) (S-S ' -5 ') ~ , ~: ~ ~
i - - - - - - - + - - - - - + - - -- eJCpected output is 90% of the system capacity, then what is the
---; expected output? (c )t S • C -.. Sl ~
(a) 90 units (b) 99 unils. (c) 108 units. (d) 117 units.
ill] 3. Which of the following is not correct
9. ln 7T JOCSanQt'M0 ~ s a . - . a a r c : 5 ' ~ ~ 11'\
? Wruct'l~c,-._er- :;1 ~ 3 , - ' 3 .
(i) Find the sequence In which parls are to be produced lo minimize Idle time for mach in e : X = 38 - 30 = 8 minutes. (a) In case of two jobs requireing processing on some machines m (;a) J O O ~ ~ ~ J" ~ .1. .:s :r:,c:es.sec ... :net.as;..
lot.al make span M=1+3+5+3+4+4=20minutes varyingorder, lheproblemmaybesolvedgraphica lly
(b ):ot,r-.a'n"!IQ~~::r ~ ..nte : '3 ~ ' 1 - s : : .
(ii) Ale there allemative sequences W=8minutes. (b) Maintenance crew scheduling problems can also be conSldered
(C)J'OO ~ - i n g ~ ~ . : r ~ , 5 5 ~ w-, c-,eta5:
(11/J Repre~nl your schedule m the f?rm of a Ga:itt char! with starling % utlllzatlonfor : as sequencing problems.
and ending Umes. Negled machine lo machine shifting lime
(d) JOOhavng ~ :::rn.? :,r, ~ ~ £ I S ~ a, O"'e ~
(c) Theere is no general solution proce-dure ava ilab~ for sotvu,g
X = ¥a x 100=78.9%:
(N) What are the machine utllizatlon percentages for each machine if sequencing problems Involving processing ofn ]Obs through thn!'e 10. F~ pts are :c O l e ~ ::r ~ ~ 4. .3 ~ : : r ~
no olher job , is taken !ill the complellon of this balch. machines OfOef4.SC Thet.ninc;s ci ~ .OC's~~'------i:.,:,e (.JD 4.) 70 \.
[IES(Moch.) 1998) ,.; _=~x 100 = 47.36%; (d) Solution to a sequencing problem 1s found in such a manner that \SO, 5,Q 90). (iJ 10 SO \5:i X', S: re: ~ JO 100 , 7hie OC:JITUTl
Solullon. Time on Machines (minutes) noneofthemach inesisidleatanyt,me. se,q~ wo.mc OI!'
W=~ x 100 = 78.9%. 4. In the sequencing algorithm (il )-11 - J ., - J: - J-, - ~ [~ L a - J.. - -~ - J~ -J,
38 (a)alltheservtcefacllitiesare not of different type. (c) J, -J, - J! - J-::. - J:, fdl - ,. - J. - ~ - -1: - J s
2. Consider the following jobs and their processing Umes at (b) all the jobs must be processed on a first.come first-served basis. 11 . ~ ~ ~ = > ; o/ :WO pl:%S on .,,.
correspondingmachJnes (c) a service fadlity can process more than one Job at a time
(d) The selection of an appropriate order for a senes or jobs Is to be l•I can be sotwc ~
Duration Hours doneonafin lteservicefacilities (bl cannot be s.:,1\--.,a ~
Job Machine 11111 ) Machine 2 lt12 ) Ma ch ine 3 ft 13 ) 5. In sequencing problems
(a} Gantt chart provides a very effect:ive technique for SONtng large
(cl =~"°",,... r-r ~ c,i two ,ot,s mus, be ., ~
13 5 9 sized sequencing problems. (d) ~ o l -se
Conver11ng 1t lo machines Land H , where lime on a ficlilious
machme = l ime on X + Ume on w 5 (b) Gantt chart can be used to deterrmne optimum sequence tn
relatively small-sized problems
tf A . S. ~ C ~ Ifie ~ rrnes of , m ,ob on ttvee
I l'a r1 X +M M +W (c) First-come first-served basis of Job performance ts the ideal°'"'
"""-.._A . Sat>dC ~ i,,.,,,anl>-j()()l!Veernac:t>tneproblem
can be ~""'@010.-, n · J'X' a n d ~ problem Pf"O\'tded tna1
N sinceltlnvolvesasenseoffalrplay
II 8 (a)M,n A ~ lda>..S anaod,bn C , Ma., S
A (d)aun iqueoplimumsolut1onex1sts (bl Mitl A .::: t..4, S .-..:1..'tY ~tm C ~ MaA..S
8 10
6. In sequencing problems , (c) M m 4 ~ Lbu S ar,o,or M tl"I C ~ ~lax S '

I
0 IIJ
l ,, 10

12
(d) ~,., 4 , 14, S an..1..:>< M,n C ; Ma, S [IES (Mech.) 2006)

E 10 8 A NSWERS
l.(b) 2. (a) J. (d) 4. (d) ~.( h\ 6. \J I o. \ J I 10. 1,-1 11. \ a\ 1::.. (di.
 SEQUE NCING

'TRUE' OR 'FALSE' QUESTIONS

Mark I/re followi ng stalc111 e111s as Tru e (T ) or False ( F):
1 . Gantt chart provide s a very effective techniqu e for solving
sequen cing problem s.
2. In sequen cing problem s. the effective ness is a function of
which the given tasks are perform ed.
3. The optimal sequenc e of an n-job, 2-mach lne problem
the sequen ce of perform ance of jobs which would ensure
the
11 If
large-sized

implies that
their
b

order in
·
two-mac ine
obtained from
would be the same.
3-machlne sequencing problem Is solved as a
an n-hJ~ s. problem then the total elapsed time. T.
·
the 3 machine s or the two fi1ct111
·ous

12. Every sequencing problem must have a unique optimal solution

13. lfmln ,I\ 2'. ma,c8,, orC, 2'. max8 or both, then the problem
1
by an equivalent problem lnvolVlng n jobs and 2 fictitious
whether
machines, data

Is replaCed
machine s G
I
complet ion In the minimum lime as well as minimis ation and H, whereG , = A + 8, andH, = 8, + c,.
on the second machine. of idle time
14. There is no general solution available for solving_
sequenc ing
4. First-co me. first-solv ed basis of job perform ance Is the problems Involving processing of n jobs through 3 machine
Ideal one s.
since it involves a sense affair play. 15. In an n-job. 3 machine sequencing problem , if the minimum
of times
5. In sequen cing problem s involvin g n Jobs and 3 on the first and third machines are both equal to or greater
machine s. the than the
algorith m is based on the assump tion that each of the muimum time on the second machine then the problem
jobs requires can be
processing on three machin es in the same order. solved by a standard method.
6 . In a twerma chine sequen cing problem , if the lowest times 16. Maintenance crew scheduling problem s can also
are both on be program med as
the second machine and they are tied for jobs, say 2 and sequencing problems.
7, then the
job 2 should be done In the end while job 7 in the first place.
17. If some jobs are processed onKma chlnes in the order
7. Ten jobs required to be perform ed on three machine
A. 8 , C , ... ... K,
s A. 8 andC. in then a standar d method can be employe d when Min A
that order. can be perform ed in 3,628,8 00 ways. 2'., Max 8, ~
Max C, 2: •. . ... 2'. Max J1 and/or Min K 2'. Max 8 , 2'. Max
MaxJ,.
1 c, ~---... ~
8. The principle used for processing optimall y certain jobs
on two
machin es can be summar ised as follows · 18. A 45-degree line on a graph, where two j_obs are
shown on the two
Job/ precede s job/ + 1if Min(-", , 8 • ues, indicates simultaneous work on the Jobs.
1
,) < Min (A, , , 81 ) .
t . Total elapsed Ume Is determi ned by the point of time at which 19. Sequencing problem s involving processing of 2 jobs
the first on K machines
of the n jobs goes to machine A until the point on which can be solved graphically.
the last job
comes off machine s 8 . 20. In case of sequence problem Involving 2 job on K machine
s. it Is
10. Since the times that the differen t Jobs take on differen necessary that the processing of the two jobs must be
t machine s are in the same
known and constan t, it makes no differen ce as to In what order.
order are
they perform ed.

ANSWERS
I. F 2. T 3. T 4. F 5. T 6. F 7. T 8. T 9. T 10. F 11. F 12. F 13. T 14. T
16. T 17. T 18. 19. T IS. F
20. F.

SUMM ARY
In this chapter, we have discussed sequencing problem which
have most frequently been encountered in the context of
produclion industry.
In general, a constant objective of production company is lo
make more effective use of available faciliti es and therefore
greater output. In order to improve l11e uti I ization of avai table
facilities is by taking improving decision rules regarding the
scheduling or sequencing of work over these facilities. Hence in
sequencing we have 10 consider a situation where the effeclivcncss
measure is a function of the order or sequen ce in which a series of
jobs are performed .
Herc three kinds of sequencing prohlems arc conside red :
(I) n jobs, two machines, say A and 8 in the order AB.
(U) n jobs. three machines, say A.Band C, in the order
ABC.
(UI) Two jobs. any number of machines (say 111 ) .

BA.SIC POINTS TO REMEMBER

Srqur ndng. The assignment of the order in which the jobs
are precessed. (Ill) Each job once staned is to be performed upto
the
completion on the machine.
Srqutn ring prohll'm. A problem in which it is necessary to
determine the order., or sequences of jobs in which they should be (Iv) A job starts on the machine
machin
soon as the job and the
e both arc free, and the job is next 10 the machine and the
as
performed in order 10 minimi ze the total effectiveness or the sum
of the related costs. machine is also ncll.t to the job.
C.cncn il ,\..s umlion~. (I) The process ing limes on different (v) No machine may process more than one
simultaneously. job
m:ichines are independent of the order of jobs in which they arc 10
bcp ~d.. Thrl'r machin es probkm . It is convened 10 two machines
(ll} The time taken by the johs in going from one machin problem if min A, ?: max 8 1 and/or min C, ?: max. B,.
e lo Johson
anothc..--r is nc£!ligibk. ·s Procedure. It is used for n jobs, two machines
problem .