TEM/DDA 305: Quantitative Analysis in Management

Assignment Model
Presenters: ILAGAN, Maria Ana & ORATE, Jerome

Professor: Dr. Manolito F. Dela Cruz

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Introduction
Today's Agenda

What is an Assignment Model

Objectives

Types

Methods

Linear Programming Representation

The Hungarian Method

Example
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The Assignment Model

The Special Form of Transportation Model
(one and distinct assignment of each and the demands and supplies are equal to one)

The assignment model is a special case of It is a special form of a linear programming model

transportation problems where each supply that is similar to the transportation model. There

point should be assigned to a demand point and are differences; however, in the assignment model,

each demand should be met. the supply at each source and the demand at each

destination are each limited to one unit.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The Assignment Model

Other things to know about it...

It consists of assigning a specific (person or worker It means assigning of jobs to factors (men or

to a specific (task or job) assuming that there are machine) to get most optimum output or get least

the numbers of persons equal to the number of cost.

tasks available.
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The Assignment Model

Other things to know about it...

A technique to find out lowest possible allowable Hungarian method is the mostly used method of

cost of the project by assigning the best possible solving assignment problems.

least costs to the jobs and workers.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Objectives/Criteria

1 2 3 4

No worker is more than one No job is allotted to more Total time taken to The work done is cost

job. than one worker. complete a job is minimum. effective.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Maximize

Profit, Sales, Output, Quantity, Quality, Efficiency

Minimize

Cost, Time, Distance

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Application
In assigning machines to factory

orders.

In assigning sales/marketing people to

sales territories.

In assigning contracts to bidders by

systematic bid-evaluation.

In assigning teachers to classes.

In assigning accountants to accounts

of the clients.

In assigning coaches to team

Others
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Balanced

An assignment is called balanced assignment

problem if the number of persons (factors) is same

as the number of jobs.

Types of Assignment
Model Problems
Unbalanced

An assignment is called unbalanced assignment

problem if the number of persons (factors) is not

same as the number of jobs.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Methods

Integer Programming Method Transportation Method

In assignment problem, either allocation is done to the cell or As assignment problem is a special case of transportation

not. So this can be formulated using 0 or 1 integer. While using problem, it can also be solved using transportation

this method, we will have n x n decision variables, and n+n methods. In transportation methods (NWCM, LCM & VAM),

equalities. So even for 4 x 4 matrix problem, it will have 16 the total number of allocations will be (m+n-1) and the

decision variables and 8 equalities. So this method becomes solution is known as non-degenerated. (For eg: for 3 x 3

very lengthy and difficult to solve. matrix, there will be 3+3-1 = 5 allocations) But, here in

assignment problems, the matrix is a square matrix (m=n).

So total allocations should be (n+n-1), i.e. for 3 x 3 matrix, it

should be (3+3-1) = 5
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Methods

Enumeration Method Hungarian Method

It is a simple trial and error type method. Consider a 3 x 3 It was developed by two mathematicians of Hungary. So, it

assignment problem. Here the assignments are done randomly is known as Hungarian Method. It is also known as Reduced

and the total cost is found out. For 3 x 3 matrix, the total matrix method or Flood's technique. There are two main

possible trails are 3! So total 3! = 3 x 2 x 1 = 6 trails are conditions for applying Hungarian Method (1) Square Matrix

possible. The assignments which gives minimum cost is (n x n) and (2) Problem should be of minimization type

selected as optimal solution. But, such trial and error becomes

very difficult and lengthy.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

1.Construct the tabular representation of the problem.

2. Check that the number of rows and columns are equal , if they are equal then

the solution can be started, if not a dummy row or column must be introduced with

zero costs.

3. The solution is started by taking a residual matrix from the original matrix. Produce
a residual matrix by choosing either the rows or columns to start; then determine

from each row or column the lowest value and subtract it from the specific row or

column with this process you come up with a residual matrix.

4. After that check on either rows or columns that do not have zeros and mark

General
them; then select the lowest value from the row/column. Subtract it again from the

specific row/column. From this there will be another residual matrix.

5. Check on the matrix now, and locate the rows/columns with several zeros and

Procedure cross them out. The lines crossing out zeros are either vertical lines or horizontal lines

only.

6. After crossing out the zeros, count the number of lines; if the number of lines

crossing out the zeros are equal to the number of rows or columns, then we can have

an optimal assignment; otherwise mark the uncrossed values and select the lowest

value; subtract it from the uncrossed values in the matrix if there are values crossed

by vertical and horizontal lines add the value to the intersection; after that cross out

zeros again and if the lines are already equal to the number of rows or columns stop

and identify the assignment; otherwise repeat.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Linear
Programming
Representation
An assignment problem is characterized by

knowledge of the cost of assigning each supply

point to each demand point: cij

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

On the other hand, a 0-1 integer

variable xij is defined as follows
xij In this case subject to
is equal to 1 if supply point i is The general LP representation of

assigned to meet the demands of an assignment problem is Σj xij = 1 (i=1,2, ..., m) Supply constraints
demand point j min Σi Σj cij xij Σi xij = 1 (j=1,2, ..., n) Demand constraints
xij = 0 or xij = 1

is equal to 0 if supply point i is not

assigned to meet the demands of

point j
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The Hungarian Method

Since all the supplies and demands for any assignment problem are integers, all variables in optimal solution of the

problem must be integers. Since the RHS of each constraint is equal to 1, each xij must be a nonnegative integer that is no

larger than 1, so each xij must equal 0 or 1.

Step 1 Step 2 Step 3

For the original cost matrix, identify For the matrix resulting from step 1, Identify the optimal solution as the

each row's minimum, and subtract it identify each column's minimum, and feasible assignment associated with

from all the entries of the row subtract it from all the entries of the the zero elements of the matrix

column. obtained in step 2.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Example 1
Dr. Manolito has three children, Grace, Alan, and Emmalyn,

who want to earn some money to take care of personal

Let's
expenses during a school trip to the National Museum of the

Philippines. Dr. Manolito has chosen three chores for his

Solve
children: mowing the lawn, painting the garage door, and

washing the family cars. To avoid anticipated sibling

Together
competition, he asks them to submit (secret) bids for what

they feel is fair pay for each of the three chores. The

understanding is that all three children will abide by their

father's decision as to who gets which chore.

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The Official Bids

Let's
Solve
Together
Step 1.1
Step 1.2
Step 1.2
Step 2.1
Step 2.2
Step 2.2
Step 3
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The cells with underscored zero

entries provide the optimum
solution

Grace Alan Emmalyn

Paint the Garage Door Mow the Lawn Wash the Car
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Dr. Manolito's Total Cost

= P90 + P100 + P80

=P270
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Dr. Manolito's Total Cost

=(P1 + P2 + P3) + (Q1 + Q2 + Q3)

=(90 + 90 + 80) + (0 + 10 + 0)

= 260 + 10

= P270
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Example 2
There are 4 workers and there are 4 machines; worker 1 can

finish the job in 1 hr on machine 1; 4 hrs on machine 2; 6 hrs

on machine 3 and 3 hrs on machine 4; worker 2 finishes the

task for 9 hrs on machine 1; 7 hrs on machine 2; 10 hrs on

Let's machine 3 and 9 hrs on machine 4; worker 3 finishes the job

in 4 hrs on machine 1; 5 hrs on machine 2; 11 hrs on machine

Solve 3; and 7 hrs on machine 4; worker 4 finishes the job for 8

hrs on machine1; 7 hrs on machine 2; 8 hrs on machine 3

Together and 5 hrs on machine 4

ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Example 2

Let's
Solve
Together
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The locations of the zero entries do not allow

assigning unique chores to all the Workers,

here, if we assign Worker 1 to Machine 1, then

column 1 will be eliminated, and Worker 3 will

not have a zero entry in the remaining three

columns. This obstacle can be accounted for

by adding the following step to the

procedure outlined.
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Step 2a
If no feasible assignment (with all zero entries) can be secured from steps 1 and 2

Sub Step 1 Sub Step 2 Sub Step 3

Draw the minimum number of Select the smallest uncovered If no feasible assignment can

horizontal and vertical lines in entry, subtract it from every be found among the resulting

the last reduced matrix that uncovered entry, then add it zero entries, repeat step 2a.

will cover all the zero entries. to every entry at the Otherwise, go to step 3 to

intersection of two lines. determine the optimal

assignment.
 Sub Step 1

Draw the minimum number of

horizontal and vertical lines in

the last reduced matrix that

will cover all the zero entries.

 Sub Step 2

Select the smallest uncovered

entry, subtract it from every

uncovered entry, then add it

to every entry at the

intersection of two lines.

 Sub Step 2

Select the smallest uncovered

entry, subtract it from every

uncovered entry, then add it

to every entry at the

intersection of two lines.

 Sub Step 3

If no feasible assignment can

be found among the resulting

zero entries, repeat step 2a.

Otherwise, go to step 3 to

determine the optimal

assignment.
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

The optimum solution calls for assigning Worker 1 to Machine

1, Worker 2 to Machine 3, Worker 3 to Machine 2, and Worker

4 to Machine 4. The associated optimal time to finish the

job is 1 + 10 + 5 + 5 = 21 hours. The same time is also

determined by summing the p's, the q's, and the entry that

was subtracted after the shaded cells were determined-that

is, (1 + 7 + 4 + 5) +(0 + 0 + 3 + 0) + (1) = 21 hours.

MATHEMATICS CLASS EAST CORDALE SCHOOL

References
https://www.slideshare.net/Dragonfrend/assignm

ent-model-57676442

https://www.slideshare.net/niralisolanki1/operatio

nal-research-on-assignment-ppt

https://www.educationlessons.co.in/notes/assign

ment-model-introduction/

https://www.pearsonhighered.com/assets/prefac

e/0/1/3/4/0134730666.pdf
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Is everything clear?