Scribd
Upload
12 views28 pages

Solutions of The Exercises of Module-4

Uploaded by

Iftejab Mondal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views28 pages

Solutions of The Exercises of Module-4

Uploaded by

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

Group-B

1
2
3 Suppose there are n persons and n jobs and the assignment of jobs has to be done on a one-to-one
basis. This assignment problem can be stated in the form of an n×n matrix of real numbers (known
as the cost matrix) as given in the following table:

where cij represents the amount of time taken by i-th person to complete the j th job. Let xij denote
the j-th job assigned to the i-th person. Then, mathematically, the assignment problem can be stated
as follows:
Let 𝑥𝑖𝑗 denote the assignment of i-th resource to j-th activity, such that
1 , 𝑖𝑓 𝑟𝑒𝑠𝑜𝑢𝑟𝑐𝑒 𝑖 𝑖𝑠 𝑎𝑠𝑠𝑖𝑔𝑛𝑒𝑑 𝑡𝑜 𝑎𝑐𝑡𝑖𝑣𝑖𝑡𝑦 𝑗
𝑥𝑖𝑗 = {
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Then, the model formulation of Assignment Problem is:
𝑛 𝑛

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗


𝑖=1 𝑗=1
Subject to the following constraints:
∑𝑛𝑗=1 𝑥𝑖𝑗 = 1 for all i (resource availability)
∑𝑛𝑖=1 𝑥𝑖𝑗 = 1 for all j (activity requirement)
𝑥𝑖𝑗 = 0 𝑎𝑛𝑑 1 (i=1, 2, …, n and j=1,2, …n)
And where 𝑐𝑖𝑗 is the cost associated with assigning i-th resource of j-th activity.

4
5 Different types of assignment problem
1.Maximization Problem:
The elements of cost matrix of the assignment problem represent profits instead of costs and the
corresponding cost matrix is called profit matrix. To solve this problem first, the largest element of
the profit matrix is selected. Then we subtract all elements from the largest element to get new cost
matrix which will provide the maximum profit of the original problem.
2. Unbalanced Assignment:
If the number of jobs is not equal to the number of workers or machines, then the problem is
unbalanced. In this case we add a fictitious job or machine with zero cost. Then we apply the
assignment algorithm to the resulting balanced problem.
3. Impossible Assignment:
If some job cannot be assigned by some particular worker, then we avoid this effectively by putting
a large cost in that cell.
4.Negative cost:
If the cost matrix contains some negative cost, then we add to each element a quantity to make all
elements non-negative.

Group-C
1
2
3
4
5
6
7
8

You might also like