Scribd
Upload
6 views1 page

Assignment Model

The Assignment Model focuses on pairing two sets of items to minimize or maximize costs/profits, typically involving jobs and resources. The Hungarian method is a key algorithm used to find optimal solutions by minimizing opportunity losses. Assignments can be classified as balanced, with equal numbers of jobs and factors, or unbalanced, where the numbers differ.

Uploaded by

pakinganangelkris
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views1 page

Assignment Model

The Assignment Model focuses on pairing two sets of items to minimize or maximize costs/profits, typically involving jobs and resources. The Hungarian method is a key algorithm used to find optimal solutions by minimizing opportunity losses. Assignments can be classified as balanced, with equal numbers of jobs and factors, or unbalanced, where the numbers differ.

Uploaded by

pakinganangelkris
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

An Assignment Model is a problem that requires pairing two sets of items given a set paid

costs/profits in such a way that the total cost/profit of the pairings is minimized or maximized. It
is the allocation of jobs to factors (humaOne of the important characteristics of the assignment
problem is that only one job for a worker) is assigned to one machine (or project). Hence, the
number of sources are equal to the number of destinations and each requirement and capacity
value is exactly one unit.n capital or machinery) to get the most optimum output, maximize profit
or to minimize cost. It is a special application of Linear Programming Problem.
The Hungarian method yields optimal solutions to the assignment model. The method is based
on a mathematically proven algorithm for determining the optimal solution. It is based on the
concept of opportunity losses. This is related to the opportunity losses in the Vogels'
Approximation Method of the transportation problem. In the assignment model, the optimal
solution gives zero opportunity losses. Any other solution with a higher cost gives an opportunity
loss that is equivalent to its increase in cost over the minimum cost resulting in the optimal
solution. The basic idea in this method is to avoid opportunity losses.
The assignment problem is a special case of transportation problem in which the objective is to
assign a number of origins to the equal number of destinations at the minimum cost for
maximum profit). It involves assignment of people to projects, jobs to machines and workers to
jobs while minimizing the total assignment costs (or maximizing the total assignment profit).
Balanced - An assignment is called a balanced assignment problem if the number of factors is the
same as the number of jobs. It consists of a square matrix (n x n), in which the number of rows is
equal to the number of columns.
Unbalanced - An assignment is called an unbalanced assignment problem if the number of
factors is not the same as the number of jobs. It consists of a Non-square matrix, and the number
of rows is not equivalent to the number of columns.

You might also like