ASSIGNMENT MODEL

CHAPTER 15
Objectives

At the end of this chapter the student should be able to do the following:
 Know and understand when to use the assignment model
 Know how to set up the initial assignment model table
 Be able move to the next improved table.
 Know how to recognize the optimum solution
 Deal with origin and destination
 To maximize and minimize a given a problem

Introduction

The assignment model is a special case of the transportation model in which the number of
origin must equal the number of the destination that is the table is a square that is the number
of rows and columns must be equal.
At the destination the demand is equal to one at the origin that is the supply is equal to one.
The commonly used such structure to solve such problem is specially designed solution called
Hungarian Algorithm

Hungarian Algorithm
This is a method that provides us with an efficient means of finding optimal solution without
having to make a direct comparison of every option.
The algorithm has three stages which are:

Stage I
Set out the problem in table format.
For each row in the table find the smallest row element and subtract it from every element in
the row.
Repeat the same for column.
CHAPTER 15 Assignment model 414

Stage II
For a feasible solution there must be exactly one assignment to every row and every column.
Find rows with only one zero in it and make an assignment to this zero. If no such row exists
begin with any zero.
Close out all the zeros in the same column.
Repeat number (i) and (ii) until no further progress can be made.

Stage III
If the solution in stage II is not feasible go on to stage III and follow the following steps;
Draw the minimum number of straight line through the rows and columns so that all zeros in
the table are covered and make sure that there are no diagonals.
Find the smallest element without a line through it.
Subtract this number from every element without a line through it.
Add the chosen number to every element with two lines through it.
Leave alone all the elements with one line through them.

This procedure has created at least one new zero return to the stage II and repeat the
procedure until the optimum solution is reached.

Example 15.1

A ferries manufacturer has four distribution ports and four order to deliver to separate country.
Each port has one ship available which is large enough to carry one of these ferries. The distance
between each port and each country are given below.

Tableau 1

Distance from port to country

(in miles)
u v w x
Ports

i) 680 720 750 830

ii) 560 600 580 630
Iii) 380 420 350 450
iv) 470 450 400 450
Required
How should be the orders be assigned to ports in order to minimize the total distance travelled.
 CHAPTER 15 Assignment model 415

Solution

Identify the smallest element in each row to set up the initial as tableau 2

Tableau 2

Distance from port to country

(in miles)
Smallest element
u v w x In each row

i) 680 720 750 830 680

ii) 560 600 580 630 560
Iii) 380 420 350 450 Smallest
350
element
iv) 470 450 400 450 400
In
Smallest
each row
element
Subtract the smallest row element from the entire element in each corresponding
In
row as given
in the tableau 3 each row

Tableau 3

Distance from port to country

(in miles)

u v w x
i) 0 40 70 150
ii) 0 40 20 70
Iii) 30 70 0 100
iv) 70 50 0 50

Identify the smallest element in each column as in tableau 4

 CHAPTER 15 Assignment model 416

Tableau 4

Distance from port to country

(in miles)

u v w x
i) 0 40 70 150
ii) 0 40 20 70
Iii) 30 70 0 100
iv) 70 50 0 50
0 40 0 50
Smallest element in each column

Subtract the smallest element from the entire element in each corresponding column as given
below by the tableau 5

Tableau 5

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0

Assign to any of the row or column with one zero and to that zero that is column (x) as shown
below use square to show the assignment
 CHAPTER 15 Assignment model 418

Tableau 6

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0
Move to the next row or column with one zero if there is none move to the column of your
choice if it has more than one assign one and close the others in that column as shown by the
tableau 7

Tableau 7

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0

Lets move to the next column (v) and assign to one zero and close the other zero as shown in
the tableau 8

Tableau 8

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0
 CHAPTER 15 Assignment model 418

Finally we can assign the last column (u) which have two zeros, thus we need to assign to one
zero and close the other zero as given below

Tableau 9

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0

Looking at the tableau 9 we can that every row and every column has one assignment that
means that the solution is feasible and we can assign as follows
Pick the corresponding amount of mile which are in the first table tableau 2 to everywhere
there is assignment.
Assign port (i) to country (u) = 680
Assign port ii) to country (v) = 600
Assign port iii) to country (w) = 350
Assign port iv) to country (x) = 450
2080 miles

Alternative assignment

We need to assign column (u) need to assign to cell ii)u as the alternative assignment as shown
below by tableau 10
 CHAPTER 15 Assignment model 419

Tableau 10

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0

Assign the column (v) that is cell i)v as alternative assignment as shown below in the tableau 11

Tableau 11

Distance from port to country

(in miles)

u v w x
i) 0 0 70 100
ii) 0 0 20 20
Iii) 30 30 0 50
iv) 70 10 0 0
We have assigned every row and every column and the solution is feasible and we can make the
following assignments.

Assign port i) to country (u) = 560

Assign port ii) to country (v) = 720
Assign port iii) to country (w) = 350
Assign port iv) to country (u) = 450
2080 miles
 CHAPTER 15 Assignment model 420

Example 15.2

A company has six sales region and six sales ladies from pat experience it is known that sales
lady perform differently in different region. The company sales director has established sales for
each region. She has approached you for advice in who should take which region.

Tableau 12

Sales Nyanza Rift Nairobi Eastern Mt. Costal

lady Valley Kenya
A 68 72 75 83 75 69
B 56 60 58 63 61 59
C 35 38 40 45 25 27
D 40 42 47 45 53 36
E 62 70 68 66 69 70
F 65 63 69 70 72 68

Required
How should the sale director assign the sales ladies to the region to maximize total sales?

Solution

The problem which involves maximization require we multiply the whole table by negative as
given below by Tableau 13

Tableau 13

Sales Nyanza Rift Nairobi Eastern Mt. Costal

lady Valley Kenya
A -68 -72 -75 -83 -75 -69
B -56 -60 -58 -63 -61 -59
C -35 -38 -40 -45 -25 -27
D -40 -42 -47 -45 -53 -36
E -62 -70 -68 -66 -69 -70
F -65 -63 -69 -70 -72 -68
 CHAPTER 15 Assignment model 421

After multiplying every element by negative lets identify the smallest element in each row as
given by the tableau 14

Tableau 14

Sales Nyanza Rift Nairobi Eastern Mt. Costal

Smallest element
lady Valley Kenya
In each row
A -68 -72 -75 -83 -75 -69 -83
B -56 -60 -58 -63 -61 -59 -63
Smallest
element
C -35 -38 -40 -45 -25 -27 -45
Smallest
In
element
-53
D -40 -42 -47 -45 -53 -36 Smallest
each row
E -62 -70 -68 -66 -69 -70 -70In
element
Smallest
each
In row
element
Smallest
F -65 -63 -69 -70 -72 -68 -72
each row
In
element
Smallest
each
Inrow
Subtract the smallest element from the corresponding rows as given in the tableau element
15
each row
In
each row
Tableau 15

Sales Nyanza Rift Nairobi Eastern Mt. Costal

lady Valley Kenya
A 15 11 8 0 8 14
B 7 3 5 0 2 4
C 10 7 5 0 20 18
D 13 11 6 8 0 17
E 12 0 2 4 1 0
F 7 9 3 2 0 4

Identify the smallest element in each column as given below by the tableau 16
 CHAPTER 15 Assignment model 422

Tableau 16

Sales Nyanza Rift Nairobi Eastern Mt. Costal

lady Valley Kenya
A 15 11 8 0 8 14
B 7 3 5 0 2 4
C 10 7 5 0 20 18
D 13 11 6 8 0 17
E 12 0 2 4 1 0
F 7 9 3 2 0 4
7 0 2 0 0 0
Smallest element in each column

Subtract the identified smallest element in each corresponding column to obtain the table
below as given by the table 17

Tableau 17
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 11 6 0 8 14
B 0 3 3 0 2 4
C 3 7 3 0 20 18
D 6 11 4 8 0 17
E 5 0 0 4 1 0
F 0 9 1 2 0 4

From the above tableau 17 we can try to assign starting with the column with one zero and see
whether we can attain a feasible region. The tableau 18 below shows the assigned elements.
 CHAPTER 15 Assignment model 423

Tableau 18
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 11 6 0 8 14
B 0 3 3 0 2 4
C 3 7 3 0 20 18
D 6 11 4 8 0 17
E 5 0 0 4 1 0
F 0 9 1 2 0 4

In the above Tableau 18 we need to draw line passing through rows and columns that have
zeros and draw as minimal lines as possible as in the tableau 19

Tableau 19
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 11 6 0 8 14
B 0 3 3 0 2 4
C 3 7 3 0 20 18
D 6 11 4 8 0 17
E 5 0 0 4 1 0
F 0 9 1 2 0 4

Identify the smallest uncovered element which is 1; add 1 to every element covered by two
lines
That is where two are intersecting each other.
CHAPTER 20 Assignment model 424

Tableau 20
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 11 6 0 8 14
B 0 3 3 0 2 4
C 3 7 3 0 20 18
D 6 11 4 8 0 17
E 5+1 0 0 4+1 1+1 0
F 0 9 1 2 0 4

Subtract 1 to every element that is not covered and the other elements which lies in the line are
supposed to remain untouched as given by the tableau 21

Tableau 21
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 11-1 6-1 0 8 14-1
B 0 3-1 3-1 0 2 4-1
C 3 7-1 3-1 0 20 18-1
D 6 11-1 4-1 8 0 17-1
E 6 0 0 5 2 0
F 0 9-1 1-1 2 0 4-1

Remember that the elements that lie on the lines where there is no intersection are supposed
to remain untouched and the table on the next page shows the final table after performing the
three operations.

We try to assign and see whether we get an assignment on each row and each column as given
below by the tableau 22, starting with the row or column that has one zero.
 CHAPTER 15 Assignment model 425

Tableau 22
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 10 5 0 8 13
B 0 2 2 0 2 3
C 3 6 2 0 20 17
D 6 10 3 8 0 16
E 6 0 0 5 2 0
F 0 8 0 2 0 3

From the above allocation we can see that when we try to assign zeros in the rows and columns
the solution is no feasible because one row and one column are un assigned and thus we need
to repeat the process of drawing the lines as shown in the tableau 23

Tableau 23
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 10 5 0 8 13
B 0 2 2 0 2 3
C 3 6 2 0 20 17
D 6 10 3 8 0 16
E 6 0 0 5 2 0
F 0 8 0 2 0 3

By drawing the minimum lines possible identify the smallest element which is uncovered that is
2
Repeating the above procedure add 2 to every element in the intersections of the lines as
shown in the tableau 24
 CHAPTER 15 Assignment model 426

Tableau 24
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 10 5 0 8 13
B 0 2 2 0 2 3
C 3 6 2 0 20 17
D 6 10 3 8 0 16
E 6+2 0 0 5+2 2+2 0
F 0+2 8 0 2+2 0+2 3

Subtract 2 to every element that is not covered to obtain a table as the one given below in the
tableau 25

Tableau 25
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 10-2 5-2 0 8 13-2
B 0 2-2 2-2 0 2 3-2
C 3 6-2 2-2 0 20 17-2
D 6 10-2 3-2 8 0 16-2
E 8 0 0 7 4 0
F 2 8 0 4 2 3

Now after performing the three operations of adding 2, subtracting 2 and leaving untouched the
element in the lines, we can try to assign where there are zeros and see whether the solution is
feasible. Let examine the tableau 26
 CHAPTER 15 Assignment model 427

Start assigning the row or column with one zero and repeat the procedure until every row and
column are assigned.

Tableau 26
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 8 3 0 8 11
B 0 0 0 0 2 1
C 3 4 0 0 20 15
D 6 8 1 8 0 14
E 8 0 0 7 4 0
F 2 8 0 4 2 3

The above solution is not feasible and we need to redraw the lines again and make sure that the
lines are as minimal as possible that are covering all the zeros that are in the tableau 26. The
tableau 27 below shows the number of lines.

Tableau 27
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 8 3 0 8 11
B 0 0 0 0 2 1
C 3 4 0 0 20 15
D 6 8 1 8 0 14
E 8 0 0 7 4 0
F 2 8 0 4 2 3

Identify the smallest uncovered element which is 2 and add 2 to where our lines are intersecting
As in the tableau 28 below
 CHAPTER 15 Assignment model 428

Tableau 28
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8 8 3 0 8 11
B 0 0 0+2 0+2 2+2 1
C 3 4 0 0 20 15
D 6 8 1 8 0 14
E 8 0 0+2 7+2 4+2 0
F 2 8 0 4 2 3

Subtract 2 from the uncovered elements and elements that are covered except those that are in
the intersection will remain untouched see tableau 29

Tableau 29
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 8-2 8-2 3 0 8 11-2
B 0 0 2 2 4 1
C 3-2 4-2 0 0 20 15-2
D 6-2 8-2 1 8 0 14-2
E 8 0 2 9 6 0
F 2-2 8-2 0 4 2 3-2

A summary for the operation is as in the tableau 30 and let try to assign and see whether the
solution is feasible
 CHAPTER 15 Assignment model 429

Tableau 30
Sales Nyanza Rift Nairobi Eastern Mt. Costal
lady Valley Kenya
A 6 6 3 0 8 9
B 0 0 2 2 4 1
C 1 2 0 0 20 13
D 6 6 1 8 0 12
E 8 0 2 9 6 0
F 0 6 0 4 2 1

The solution is feasible since when you look at every column and row it is assigned and we need
to allocate as follows

Assign A to Eastern region 83

Assign B to Rift Valley region 60
Assign C to Nairobi region 40
Assign D to Mt Kenya region 53
Assign E to Coast region 70
Assign F to Nyanza region 65
371

Example 15.3
A wood working firm employs six joiners, each joiner has different ability and skills and takes a
different amount of time to do each job at present. There are five joiners to be allocated the
time as given below.

Tableau 31

Job 1 Job 2 Job 3 Job 4 Job 5

Joiner1 25 16 15 14 13
Joiner2 25 17 18 23 15
Joiner3 30 15 20 19 14
Joiner4 27 20 22 25 12
Joiner5 29 19 17 32 10
Joiner6 34 19 24 32 15
 CHAPTER 15 Assignment model 430

Required
The joiner has to be assigned one job. How this should be done in order to minimize the total
man time needed to finish all the jobs.

S
Solution

We must establish a dummy job and get the smallest element on each row as given below by
tableau 32

Tableau 32
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 25 16 15 14 13 0
Joiner2 25 17 18 23 15 0
Joiner3 30 15 20 19 14 0
Joiner4 27 20 22 25 12 0
Joiner5 29 19 17 32 10 0
Joiner6 34 19 24 32 15 0

The smallest values in each row are zero and that will not change our table very much .

We get the smallest value in each column by just picking from the column and write them below
the table as shown by tableau 33

Tableau 33
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 25 16 15 14 13 0
Joiner2 25 17 18 23 15 0
Joiner3 30 15 20 19 14 0
Joiner4 27 20 22 25 12 0
Joiner5 29 19 17 32 10 0
Joiner6 34 19 24 32 15 0
25 15 15 14 10 0
 CHAPTER 15 Assignment model 431

Get the differences from each element in the column by subtracting the difference with the
element corresponding with the columns as in tableau 34

Tableau 34
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 0 1 0 0 3 0
Joiner2 0 2 3 9 5 0
Joiner3 5 0 5 5 4 0
Joiner4 2 5 7 11 2 0
Joiner5 4 4 2 18 0 0
Joiner6 9 4 9 18 5 0

We can try to assign and see whether we can get a feasible solution as given in the tableau 35

Tableau 35
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 0 1 0 0 3 0
Joiner2 0 2 3 9 5 0
Joiner3 5 0 5 5 4 0
Joiner4 2 5 7 11 2 0
Joiner5 4 4 2 18 0 0
Joiner6 9 4 9 18 5 0

The solution above is not feasible because one row and column has not been assigned and we
need to introduce lines as given by tableau 36
 CHAPTER 15 Assignment model 432

Tableau 36
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 0 1 0 0 3 0
Joiner2 0 2 3 9 5 0
Joiner3 5 0 5 5 4 0
Joiner4 2 5 7 11 2 0
Joiner5 4 4 2 18 0 0
Joiner6 9 4 9 18 5 0

This has been accomplished by drawing 5 lines making sure that all the zeros are covered as
given in the tableau 36 above

Identify the smallest value which is not covered which in our case is 2, add 2 to where the lines
are intersecting and subtract 2 to the elements which are not covered and let the other
elements which are covered remain the way they are except the operation we have done in the
intersection. See a summary in tableau 37

Tableau 37
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 0 1 0 0 3 2
Joiner2 0 2 3 9 5 2
Joiner3 5 0 5 5 4 2
Joiner4 0 3 5 9 0 0
Joiner5 4 4 2 18 0 2
Joiner6 7 2 7 16 3 0

Let try assign and see whether we can achieve a feasible solution as given by the tableau 38
 CHAPTER 15 Assignment model 433

Tableau 38
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 0 1 0 0 3 2
Joiner2 0 2 3 9 5 2
Joiner3 5 0 5 5 4 2
Joiner4 0 3 5 9 0 0
Joiner5 4 4 2 18 0 2
Joiner6 7 2 7 16 3 0

The solution is not feasible and we need to repeat the same procedure of drawing as minimal as
possible number of lines as given in the tableau 39 below

Tableau 39
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 0 1 0 0 3 2
Joiner2 0 2 3 9 5 2
Joiner3 5 0 5 5 4 2
Joiner4 0 3 5 9 0 0
Joiner5 4 4 2 18 0 2
Joiner6 7 2 7 16 3 0

By identifying the smallest element value in our case we have 3 as the smallest element value
from the uncovered elements.
Let’s add 3 to where the lines are intersecting, subtract 3 to the elements that are uncovered
and the rest that lie along the lines remain untouched. See tableau 40
 CHAPTER 15 Assignment model 434

Tableau 40
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 3 4 0 0 3 5
Joiner2 0 2 1 6 2 2
Joiner3 5 0 2 2 1 2
Joiner4 3 6 5 9 0 3
Joiner5 7 7 2 18 0 5
Joiner6 7 2 4 13 0 0

Let’s try to assign and see whether we can get a feasible solution as shown in the tableau 41

Tableau 41
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 3 4 0 0 3 5
Joiner2 0 2 1 6 2 2
Joiner3 5 0 2 2 1 2
Joiner4 3 6 5 9 0 3
Joiner5 7 7 2 18 0 5
Joiner6 7 2 4 13 0 0

The allocation is not feasible and we required again repeating the same process until we can
achieve an optimal solution and we begin by drawing lines as minimal as possible as given by
the tableau 42
 CHAPTER 15 Assignment model 435

Tableau 42
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 3 4 0 0 3 5
Joiner2 0 2 1 6 2 2
Joiner3 5 0 2 2 1 2
Joiner4 3 6 5 9 0 3
Joiner5 7 7 2 18 0 5
Joiner6 7 2 4 13 0 0

Identify the smallest element value that is not covered that is 1, add 1 to where the lines are
intersecting and subtract 1 to the elements that are not covered and leave the rest that are
lying along the lines untouched.
See the tableau 43

Tableau43
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 4 5 0 0 4 5
Joiner2 0 2 0 5 2 1
Joiner3 5 0 1 1 1 1
Joiner4 3 6 4 8 0 2
Joiner5 7 7 1 17 0 4
Joiner6 8 3 4 13 1 0

Assign them to see whether the solution is feasible and remember to assign only one zero at
every column and row and when there are more than one zero in the column close the rest
remaining zeros to avoiding assign more than time in each column.
See tableau 44
 CHAPTER 15 Assignment model 436

Tableau 44
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 4 5 0 0 4 5
Joiner2 0 2 0 5 2 1
Joiner3 5 0 1 1 1 1
Joiner4 3 6 4 8 0 2
Joiner5 7 7 1 17 0 4
Joiner6 8 3 4 13 1 0

Again our allocation is no feasible and we need to identify the number of lines that covers our
zeros as shown in the tableau 45 below

Tableau 44
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 4 5 0 0 4 5
Joiner2 0 2 0 5 2 1
Joiner3 5 0 1 1 1 1
Joiner4 3 6 4 8 0 2
Joiner5 7 7 1 17 0 4
Joiner6 8 3 4 13 1 0

The smallest element value is 1 and where there is intersection we need to add 1 and subtract 1
where there are elements that are no covered and leave the rest an touched as we are familiar
with these procedure as summary is given below.
See tableau 45
 CHAPTER 15 Assignment model 437

Tableau 45
Job 1 Job 2 Job 3 Job 4 Job 5 Job 6

Joiner1 4 6 0 0 5 6
Joiner2 0 3 0 5 3 2
Joiner3 4 0 0 0 1 1
Joiner4 2 6 3 7 0 2
Joiner5 6 7 0 16 0 4
Joiner6 7 3 3 12 1 0

The solution above in tableau 45 is a feasible one because every row and column have been
assigned and thus we need make the assignment to joiners to see which job they are going to
take.

Assign as shown below

Assign to joiner 1 25
Assign to joiner 2 15
Assign to joiner 3 17
Assign to joiner 4 14
Assign to joiner 5 12
Assign to joiner 6 0
83

Practice Problem

1. A company has four distribution depots and four orders to be delivered to separate
customers. Each depot has one lorry available which is large enough to carry one of
these orders. The distance between each depot and each customer is given below.
CHAPTER 15 Assignment model 438

Distance in kilometers

Depot Customers

Alvin Faith Brain Jane

A 68 72 75 83

B 56 60 58 63

C 38 40 35 45

D 47 42 40 45

a) How should be the order assigned to the depot in order to minimize the total
distance traveled, use Hungarian algorithm.
b) Calculate the minimum distance to be covered.

2. An electricity company has four sub-stations that need to be conducted. Five

construction companies have quoted for the jobs. The quoted costs in millions of
shillings are in table below

Firms Sub-stations

A B C D

DTL 5 6 8 10

KDL 18 14 12 16

EXL 10 13 14 12

ZAP 13 10 10 16

MINT 14 11 11 10

a) What assignment should be made to minimize construction cost?

b) Determine the minimum cost of constructing the sub-stations
c) State the construction firm that won’t be assigned any job
 CHAPTER 15 Assignment model 439

3. Duport Ltd has 6 sales region and 6 sales representatives. From past experience it is
known that the sales representatives perform differently in the different areas. The
company’s. Sales Director has estimated from each sales person in each area. These are
given in the table below.

Sales Sales in KES ‘000’

Representatives I II III IV V VI
A 680 720 750 830 750 690
B 580 600 580 630 610 590
C 350 380 400 450 250 270
D 400 420 470 450 530 360
E 620 700 680 670 690 700
F 650 630 690 690 720 680

How should the Sales Director assign the salesmen to the areas to maximize total sales?

4. Explain the difference between transportation and assignment models.

5. The wood working firm, Crestwood Ltd, employs six joiners. Each man has different
abilities and skills and takes a different amount of time to do each job. At present,
there are five jobs to be allocated. The times are given below:

Time per job (hours)

Job 1 Job 2 Job3 Job 4 Job 5

Man 1 25 16 15 14 13

Man 2 25 17 18 23 15

Man 3 30 15 20 19 14

Man 4 27 20 22 25 12

Man 5 29 19 17 32 10

a) The jobs have to be assigned one job to one man. How should this be done in
order to minimize the total man-time needed to finish all of the jobs?

b) Calculate the total time that they will take.

CHAPTER 15 Assignment model 440

6. ANU Computer Information System (CIS) has five expert programmers. The CIS needs
five application programs to be developed. The head of the computer information
system, after studying the programs to be developed, estimates the computer time in
minutes by the experts for the application programs as follows.

Programmers

Abel Ben Calf Dave Evan

A 160 130 175 190 200

B 135 120 130 160 175

Programs C 140 110 155 170 185

D 50 50 80 80 150

E 55 35 70 80 105

How would you assign the programs to the programmers in order to attain minimum
total computer time?