Scribd
Upload
15 views

Optimization Part 2 36

Bbzhsjjw shhshshsbsbshbzbz bzhhzbz zhHhH szhhzhhs shjdjrjbwjjwjsj shiksha anushka anjana hahahah ajjajsjjs hahahah suhana suhana ajjajaj

Uploaded by

SANDEEP Singh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

Optimization Part 2 36

Bbzhsjjw shhshshsbsbshbzbz bzhhzbz zhHhH szhhzhhs shjdjrjbwjjwjsj shiksha anushka anjana hahahah ajjajsjjs hahahah suhana suhana ajjajaj

Uploaded by

SANDEEP Singh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

www.gradeup.

co

1 | Page
www.gradeup.co
Optimization Part-2

Content:

1. Assignment Problem

It arises in a variety of situations. Typical assignment problems are:

assigning jobs to machines

assigning sales personnel to sales territories

assigning contracts to bidders

assigning agents to tasks assigning taxis to customers

The distinguishing feature of assignment problems is that one agent is assigned


to one and only one task. For example, if we have three taxis, A, B and C,
and three customers, 1, 2 and 3, who want a taxi then A →3, B→ 1, C→ 2 is
a possible assignment. We will, initially, assume that

(number of agents) = (number of tasks)

Problems satisfying this condition are known as balanced problems. We will


consider how to deal with unbalanced problems later in the chapter.

In proving the assignment problem we are looking for a set of pairings, for
example agents to tasks, which optimizes a stated objective such as minimising
total cost or distance or time.

Assignment problem

2 | Page
www.gradeup.co
First check whether the number of rows is equal to the numbers of columns, if
it is so, the assignment problem is said to be balanced.

Step :1 Choose the least element in each row and subtract it from all the
elements of that row.

Step :2 Choose the least element in each column and subtract it from all the
elements of that column. Step 2 has to be performed from the table obtained
in step 1.

Step:3 Check whether there is at-least one zero in each row and each column
and make an assignment as follows.

(i) consider the rows successively until a row with exactly one zero is found.
Mark that zero by , that means an assignment is made there . Cross ( ×) all
other zeros in its column. Continue this until all the rows have been examined.

(ii) consider the columns successively until a columns with exactly one zero is
found. Mark that zero by , that means an assignment is made there . Cross (
× ) all other zeros in its row. Continue this until all the columns have been
examined

Step :4 If every row and every column contains exactly one assignment, then
the solution is optimal.

3 | Page
www.gradeup.co
Example: Solve the following assignment problem. Cell values represent cost of
assigning job A, B, C and D to the machines I, II, III and IV.

Solution: Here the number of rows and columns are equal.

∴ The given assignment problem is balanced. Now let us find the solution.

Step 1: Select a smallest element in each row and subtract this from all the
elements in its row.

Look for at-least one zero in each row and each column. Otherwise go to step
2.

4 | Page
www.gradeup.co
Step 2: Select the smallest element in each column and subtract this from all
the elements in its column.

Since each row and column contains atleast one zero, assignments can be
made.

Step 3 (Assignment):

consider the rows with exactly one zero. First three rows contain more than
one zero. Go to row D. There is exactly one zero. Mark that zero by (i.e) job
D is assigned to machine I. Mark other zeros in its column by x.

Step 4: Now consider the columns with exactly one zero. Already there is an
assignment in column I. Go to the column II. There is exactly one zero. Mark
that zero by . Mark other zeros in its row by ×.

5 | Page
www.gradeup.co

Column III holds more than one zero. Therefore proceed to Column IV, there is
exactly one zero. Mark that zero by . Mark other zeros in its row by × .

Step 5: Again examine the rows. Row B contains exactly one zero. Mark that

zero .

6 | Page
www.gradeup.co
Thus all the four assignments have been made. The optimal assignment schedule
and total cost is

The optimal assignment (minimum) cost

= ₹ 38

Example: Solve the following assignment problem.

Solution: Since the number of columns is less than the number of rows, given
assignment problem is unbalanced one. To balance it , introduce a dummy
column with all the entries zero. The revised assignment problem is

7 | Page
www.gradeup.co

Here only 3 tasks can be assigned to 3 men.

Step 1: is not necessary, since each row contains zero entry. Go to Step 2.

Step 2 :

8 | Page
www.gradeup.co
Step 3 (Assignment) :

Since every row and every column contains exactly one assignment, all the three
men have been assigned a task. But task S is not assigned to any Man. The
optimal assignment schedule and total cost is

The optimal assignment (minimum) cost = ₹ 35

9 | Page
www.gradeup.co

10 | P a g e

You might also like