Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
12 views

Assignment Model

Uploaded by

Duke Amenya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Assignment Model

Uploaded by

Duke Amenya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

ASSIGNMENT MODEL

 Given n facilities, n jobs and the effectiveness of each facility to each job, here the
problem is to assign each facility to one and only one job so that the measure of
effectiveness is optimized. Here, optimization means Maximization or Minimization.
 For example, the head of the department may have 6 people available for assignment
and 6 jobs to fill. Here the head may like to know which job should be assigned to
which person so that all tasks can be accomplished in the shortest time possible.
 Assignment model is out to minimize time or cost.
 We use Hungarian method to solve assignment model questions.
Characteristics of linear programming assignment problems:
 The matrix of the problem must be a square matrix.
 The rows and columns must have one to one allocation. Because of this property,
the matrix must be a square matrix.
 It not a square matrix, balance the problem, by opening a dummy row or dummy
column with its cost or time coefficients as zero.
 The basic feasible solution is obtained by Hungarian method
 The optimum solution for the problem is such that there can be one and only one
assignment in a given row or column of the given payoff matrix.

Hungarian Method / Flood's technique / Assignment algorithm: (opportunity cost


method)
Problem 1:
There are 3 jobs A, B, and C and three machines X, Y, and Z. All the jobs can be
processed on all machines. The time required for processing job on a machine is given
below in the form of matrix. Make allocation to minimize the total processing time.
Machines (time in hours)
Jobs X Y Z
A 11 16 21
B 20 13 17
C 13 15 12
Procedure:
Step 1. Deduct the smallest element in each row from the other elements of the row. The
matrix thus got is known as Row opportunity cost matrix (ROCM). The logic here
is if we assign the job to any machine having higher cost or time, then we have to
bear the penalty. If we subtract smallest element in the row or from all other
element of the row, there will be at least one cell having zero, i.e. zero
opportunity cost or zero penalty. Hence that cell is more competent one for
assignment.
Step 2. Using the ROCM table, deduct the smallest element in each column from other
elements of the column. The matrix thus got is known as Total Opportunity Cost
Matrix (TOCM).
The property of total opportunity cost matrix is that it will have at least one zero in
every row and column. All the cells, which have zero as the opportunity cost, are
eligible for assignment.
Step 3. Once we get the total opportunity cost matrix, cover all the zeros by MINIMUM
NUMBER OF HORIZONTAL AND VERTICAL LINES. (First cover row or
column, which is having maximum number of zeros and then next row or column
having next highest number of zeros and so on until all zeros are covered.
Remember, only horizontal and vertical lines are to be drawn.
Step 4. If the lines thus drawn are equal to the number of rows or columns (because of
square matrix), we can make assignment. If lines drawn are not equal to the
number of rows or columns go to step 6.
Step 5. To make assignment: Search for a single zero either row wise or column wise. If
you start row wise, proceed row by row in search of single zero. Once you find a
single zero; assign that cell by enclosing the element of the cell by a square. Once
all the rows are over, then start column wise and once you find single zero assign
that cell and enclose the element of the one cell in a square. Once the assignment
is made, then all the zeros in the row and column corresponding to the assigned
cell should be cancelled. Continue this procedure until all assignments are made.
Sometimes we may not find single zero and find more than one zero in a row or
column. It indicates, that the problem has an alternate solution. We can write
alternate solutions. (The situation is known as a TIE in assignment problem).
Step 6. If the lines drawn are less than the number of rows or columns, then we cannot
make assignment. Hence the following procedure is to be followed:
The cells covered by the lines are known as Covered cells. The cells, which are
not covered by lines, are known as uncovered cells. The cells at the intersection of
horizontal line and vertical lines are known as Crossed cells.
(a) Identify the smallest element in the uncovered cells.
(i) Subtract this element from the elements of all other uncovered cells.
(ii) Add this element to the elements of the crossed cells.
(iii) Do not alter the elements of covered cells.
(b) Once again cover all the zeros by minimum number of horizontal and vertical lines.
(c) Once the lines drawn are equal to the number of rows or columns, assignment can be
made.
Point to note:
For maximization same procedure is adopted, once we convert the maximization problem
into minimization problem by multiplying the matrix by (-1) or by subtracting all the
elements of the matrix from highest element in the matrix. Once we do this, the entries in
the matrix gives us relative costs, hence the problem becomes minimization problem.
Once we get the optimal assignment, the total value of the original pay off measure can be
found by adding the individual original entries for those cells to which assignment have
been made.

Problem:
There are 5 jobs namely, A, B, C, D, and E. These are to be assigned to 5 machines P, Q,
R, S and T to minimize the cost of production. The cost matrix is given below. Assign the
jobs to machine on one to one basis.
Solution:
Step1: To find ROCM

Step 2: To find TOCM (do column operation in ROCM)

There are five lines and hence we can make assignment.

Assignment: P to C, Q to B, R to A, and S to D and T to E. Total cost = 4 + 5 + 6 + 3 + 5


= 23/-
Problem 2:
Five jobs are to be assigned to 5 machines to minimize the total time required to process
the jobs on machines. The times in hours for processing each job on each machine are
given in the matrix below. By using assignment algorithm make the assignment for
minimizing the time of processing.

Solution:

COCM

The COCM has at least one zero in every column and row, this itself can be considered as
TOCM, because as the zero is the lowest number in each column, the matrix remains
unchanged. If we cover all the zeros by drawing horizontal and vertical lines, we get only
four lines. Applying step 7 we get the following matrix.
As there are five lines that cover all zeros, we can make assignment.

Alternate solution:

First Solution: A to X, B to W, C to Z, D to Y and E to V Cost is: 3 + 4 + 4 + 7 + 2 = 20


hours.
Second Solution: A to Y, B to W, C to V, D to Z and E to X. Cost is: 5 + 4 + 2 + 4 + 5 =
20 Hours.
When there is a tie, make assignment arbitrarily first to one of the zeros and then proceed,
we will get the assignment.
When there is a tie, there exists an alternate solution.

You might also like