12- OR- Assignment model
12- OR- Assignment model
Transportation Model
Assignment Model
Assignment Model
Assignment Model
Assignment Model
If the number of origins and destinations are not equal,
the assignment problem is unbalanced. In order to
balance it, we can always add as many dummy origins or
dummy destinations as necessary. The assignment costs
of the dummy origins or dummy destinations are zero.
Assignment Model
The Hungarian algorithm
Assignment Model
The Hungarian algorithm
Assignment Model
The Hungarian algorithm
Assignment Model
Example:
Four building companies have presented their projects to a
competition called to build buildings A, B, C and D. Each builder must
be assigned the construction of a building. The following tableau
shows the time each building company needs to build each of the
buildings. The objective is to assign the construction of a building to
each building company so that the total building time is minimized.
Assignment Model
Solution :
* Step 1. The assignment problem is balanced.
• Step 2. For each row, we subtract the row minimum, that is, 54, 66,
95 and 52, from each element in the row, respectively.
Assignment Model
* Step 3. For each column, we subtract the column minimum, that is,
0, 2, 4 and 0, from each element in the column, respectively.
Assignment Model
Assignment Model
The tableau is now like this:
Assignment Model
Assignment Model
Assignment Model
Assignment Model
Assignment Model