Professional Documents
Culture Documents
Assignment Model Report ILAGAN and ORATE
Assignment Model Report ILAGAN and ORATE
Assignment Model
Presenters: ILAGAN, Maria Ana & ORATE, Jerome
Introduction
Today's Agenda
Objectives
Types
Methods
Example
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
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
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
tasks available.
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
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.
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
Maximize
Minimize
Application
In assigning machines to factory
orders.
sales territories.
systematic bid-evaluation.
of the clients.
Others
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
Balanced
Types of Assignment
Model Problems
Unbalanced
Methods
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
should be (3+3-1) = 5
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
Methods
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
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
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
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
Linear
Programming
Representation
An assignment problem is characterized by
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
point j
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
problem must be integers. Since the RHS of each constraint is equal to 1, each xij must be a nonnegative integer that is no
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
Example 1
Dr. Manolito has three children, Grace, Alan, and Emmalyn,
Let's
expenses during a school trip to the National Museum of the
Solve
children: mowing the lawn, painting the garage door, and
Together
competition, he asks them to submit (secret) bids for what
they feel is fair pay for each of the three chores. The
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
Paint the Garage Door Mow the Lawn Wash the Car
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
=P270
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
=(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
Example 2
Let's
Solve
Together
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
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
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
assignment.
Sub Step 1
Otherwise, go to step 3 to
assignment.
ASSIGNMENT MODEL DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY
determined by summing the p's, the q's, and the entry that
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?