PROBLEM 1

Five bids for five projects (1, 2,

3, 4, and 5) from five Projects
contractors A, B, C, D and E
have been received by an (1) (2) (3) (4) (5)
owner. The details of the bid
price (in million Rs.) of each Con A 75 28 61 48 59
contractor for each of the five tract
projects are shown in the or B 78 71 51 35 19
table. The owner has decided
to follow the policy of ‘one
C 73 61 40 49 68
contractor one project’. How
should the owner allocate the
D 55 50 52 48 63
projects to each of the
E 71 60 61 74 70
contractors in order to have
minimum total liability?
 Problem 2
Table 1
Trucks (used to transport concrete to placing
Frequ
locations) arrive at a batching plant from
Arrival time en
different sites in an area served by a common
interval cy
ready mixed concrete plant. The arrival time
(minutes)
intervals of the trucks are observed and are
produced in Table 1. 2 10
3 15
The times taken to load the trucks which are 4 30
either 3 or 6 cum capacity are fairly constant 5 25
at 3 and 5 minutes respectively, and both
6 20
types are equally represented at the depot.
If the batching plant loads each of the trucks
immediately it arrives, in the order that it
arrives, calculate the total time likely that the
batching plant and trucks will be waiting in any
one period of 30 minutes selected at random.
SEQUENCING
 Assumptions
• No machine can process more than one
operation at a time
• Each operation, once started, must be
performed till completion.
• A job is an entity even though it represents a lot
of individual parts; no lot may be processed by
more than one machine at a time.
• Each operation must be completed before any
other operation, which following it, can begin.
• Time intervals for processing are independent of
the order in which the operations are performed.
 Assumptions contd….
• There is only one of each type of
machines.
• A job is processed as soon as possible
subject to ordering requirements.
• All jobs are known and are ready to start
processing before the period under
consideration begins.
• The time required to transfer jobs between
machines is negligible.
 Steps for Johnson’s algorithm
• List the jobs along with their processing times in
a table.

• Examine the columns for processing time on

machine A and B, and find the smallest
processing time in each column, that is find out
min (t1j, t2j) for all j.
• If the smallest processing time is for machine A,
then place the corresponding job in the first
available position in the sequence. If it is for the
second machine, then place the corresponding
job in the last available position in the sequence.
 Steps for Johnson’s algorithm
• If there is a tie in selecting the minimum of all the
processing times, then there may be three situations.
• Minimum among all the processing times is same for the
machine. That is min (t1j, t2j)= t1k=t2r, then process the
kth job first and the rth job last.
• If the tie for the min occurs among processing times t1j
on machine A only then select the job corresponding to
the smallest job subscript first.
• If the tie for the min occurs among processing times t2j
on machine B only then select the job corresponding to
the largest job subscript last.
Johnson’s algorithm
Johnson’s algorithm
Johnson’s algorithm
Johnson’s algorithm
Johnson’s algorithm
Johnson’s algorithm
Johnson’s algorithm
 Processing n jobs through m
machines
n jobs on m machines M1, M2, M3,……..Mm in the order
M1,M2,M3….Mm

Working steps

Step 1
• Find (i) min(T1j)
• (ii) min Tmj
• (iii) max (T2j, T3j, T4j,...............Tm-1,j )
Step 2
• min ((T1j) ≥ max (Tij) for i= 2, 3, 4,.............,m-1 or
• min (Tmj) ≥ max ((Tij) for i= 2, 3, 4,.............,m-1
Step 3
• If inequations of step 2 are not satisfied, this method fails. If
it satisfies either or both the conditions go to step 4.
 Working steps contd…
Step 4
• Convert the m machines problem into a 2 machine problem
considering two imaginary machines G and H, so that
• TGj= T1j + T2j + T3j + ……………………..+Tm-1,j and
• THj =T2j + T3j + ……………………..+Tm,j

Step 5
• In addition to conditions given in step 4, If T2j + T3j +
……………………..+Tm-1,j =C, where C is a fixed positive
constant for all j= 1, 2, 3,………,n, then determine the optimal
sequence for n jobs and two machines M1 and Mm in order
M1,Mm by using Johnson’s algorithm.
Illustration of problems involving
n jobs and m machines
• There are four jobs Machine i

each of which has to Job j M1 M2 M3 M4 M5 M6

go through the
machines Mi, i= A 20 10 9 4 12 27

1,2,3,…..6 in to order B 19 8 11 8 10 21
M1,M2,M3,M4,M5,M6.
The processing times C 13 7 10 7 9 17
are as given below.
D 22 6 5 6 10 14
 Soln.
• Here Min T1j =13, Min T6j =14
• Max (maxT2j,maxT3j, maxT4j, maxT5j) = Max (10,
11, 8,12) =12
• Hence both the conditions are satisfied here.
That is Min T1j ≥ Max (maxT2j, maxT3j, maxT4j,
maxT5j) and also Min T6j ≥ Max (maxT2j, maxT3j,
maxT4j, maxT5j).
• Hence the problem can be converted to 4 jobs
and two fictitious machines G and H. The
processing time on G and H is derived as shown
in the following table.
Processing time on fictitious machines G and H

Jobs A B C D

G 20+10+9+4+12 19+8+11+8+10= 13+7+10+7+9= 22+6+5+6+10=

=55 56 46 49

H 10+9+4+12+27 8+11+8+10+21= 7+10+7+9+17= 6+5+6+10+14=

=62 58 50 41

Hence the sequence is C-A-B-D.

 Min elapsed time calculation
Machine Machine Machine Machine Machine Machine
1 2 3 4 5 6

Sequence in out in out in out in out in out in out

C 0 13 13 20 20 30 30 37 37 46 46 63

A 13 33 33 43 43 52 52 56 56 68 68 95

B 33 52 52 60 60 71 71 79 79 89 95 116

D 52 74 74 80 80 85 85 91 91 101 116 130

Hence minimum elapsed time = 130 hrs.

 Illustration 2
• Four jobs 1, 2, 3 and Jobs Machine Machine Machine Machine
4 are to be A B C D
processed on each
of the four machines 1 58 14 14 48
A, B, C, and D in the
order A-B-C-D. The 2 30 10 18 32
processing time in
minutes are given in
Table. Find for no 3 28 12 16 44
passing, the
minimum elapsed
time. 4 64 16 12 42
 Solution
• Here Min T1j =28, Min T4j =32
• Max (maxT2j,maxT3j) = Max (16, Job 1 Job 2 Job 3 Job 4
18) =18
• Hence both the conditions are
satisfied here. That is Min T1j ≥
Max (maxT2j, maxT3j) and also Min Machine 58 30 28 64
T4j ≥ Max (maxT2j, maxT3j). A
• Also we can notice that T2j +T3j =C
(14+14=10+18=12+16=16+12 =28), Machine 48 32 44 42
Hence given problem reduces to D
that of finding the optimal
sequence for four jobs and two
machines A and D in the order AD.
Machines B and C do not have
any effect on the optimality of the
sequence. The optimal job sequence is 3-2-1-4
• The processing time of A and D
are repeated again in the adjacent
table.
 Min elapsed time calculation
Machine A Machine B Machine C Machine D

Sequence in out in out in out in out

3 0 28 28 40 40 56 56 100

2 28 58 58 68 68 86 100 132

1 58 116 116 130 130 144 144 192

4 116 180 180 196 196 208 208 250

the minimum elapsed time is 250 minutes.