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

Assignment Model

The assignment model is a type of linear programming problem that deals with allocating resources like workers or machines to various activities or jobs in a one-to-one manner to minimize costs. For example, assigning six workers to six jobs. The Hungarian method is used to identify the lowest-cost solution by creating a cost table and using row and column reductions to arrive at an optimal assignment where each job is assigned to exactly one resource. The steps involve developing the cost table, reducing rows and columns, determining if an optimal assignment is possible, and repeating the reduction process if needed until all rows and columns have a single assignment.

Uploaded by

ADEYANJU AKEEM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
135 views

Assignment Model

The assignment model is a type of linear programming problem that deals with allocating resources like workers or machines to various activities or jobs in a one-to-one manner to minimize costs. For example, assigning six workers to six jobs. The Hungarian method is used to identify the lowest-cost solution by creating a cost table and using row and column reductions to arrive at an optimal assignment where each job is assigned to exactly one resource. The steps involve developing the cost table, reducing rows and columns, determining if an optimal assignment is possible, and repeating the reduction process if needed until all rows and columns have a single assignment.

Uploaded by

ADEYANJU AKEEM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Model

Assignment model or problem is a special type of linear programming problem which deals with
the allocation of various resources to the various activities on one to one basis. Assignments are
done in such a way that the cost or time involved in the process is minimized and profit or sales
maximized.
Example; In a factory where a supervisor have six workers available and six jobs to undertake, he
will have to take decision regarding which job should be given to which worker. This is an
assignment problem.
Hungarian Method is what is used in assignment model and this method is used for assigning jobs
by a one-for-one matching to identify the lowest-cost solution. Each job must be assigned to only
one machine. It is assumed that every machine is capable of handling every job, and that the costs
or values associated with each assignment combination are known and fixed. The number of rows
and columns must be the same.

Steps to Solution Approach


1. Develop a cost table from a given balanced problem. If the problem is unbalanced, a dummy
row or column with zero cost is used to balance up.

2. Subtract the smallest number in each column of the new table from every number in the
column. This is called column reduction.

3. Subtract the smallest number in each row from every number in the row. This is called row
reduction.

4. Test whether an optimal assignment can be made. You do this by determining the minimum
number of lines to cover all zeros. If the number of lines equals the number of rows, an optimal
set of assignment is possible. Otherwise go on to step 5.

5. If the number of lines is less than the number of rows, modify the table in the following way

a. Subtract the smallest uncovered number from every uncovered number in the table

b. Add the smallest uncovered number to the numbers at intersections of covering lines

c. Numbers crossed out but not at the interactions of cross out lines should be carried over
unchanged to the next table.

6. Repeat step 4 and 5 until an optimal set of assignments is possible.

7. Make the assignments one at a time in positions that have zero elements. Begin with rows or
columns that have only one zero. Since each row and each column needs to receive exactly

1|Page
one assignment, cross out both the row and the column involved after each assignment is
made. Then move on to the rows and such row or column that are not yet crossed out to select
the next assignment, with preference again given to any such row or column that has only one
zero that is not crossed out. Continue until every row or column has exactly one assignment
and so has been crossed out.

2|Page

You might also like