Resource Management Techniques

Assignment Model

1.What is assignment problem. Give 2 applications.
The problem of assigning the no. of jobs is equal to the no of facilities. [ machines or persons ] at a minimum cost or maximum profit is called an assignment problem.
Applications:
i. if n jobs have to b assigned to n workers or machines with unit cost or unit time of
performing the job we can use assignment model to get minimum cost
ii. Travelling salesman problem that means a salesman has to visit a no. of cities not
visiting the same city twice and return to the starting place.
2. What do you mean by an unbalanced assignment problem.
If the no. of rows is not equal to the no. of columns in the cost of the assignment problem or if the cost matrix of the given assignment problem is not a square matrix. Then the given assignment problem is said to be unbalanced.
3. How do you convert the maximization of assignment problem into a minimization one.
The maximization assignment problem can be converted into a minimization assignment problem by subtracting all the elements n the given profit matrix from the highest element in that matrix.
4. What is the name of the method used in getting the optimum assignment.
Hungarion method
5. When is an assignment problem said to be unbalanced. How do you make it a balanced one.
If the cost matrix or profit matrix is not a square matrix, then the problem is said to be unbalanced. To make it balanced we add a row or column accordingly with all the entries zero.
6. Write down the restriction on assignment problem
I. No. of jobs is equal to no. of machines or persons.
II. Each man or machine is loaded with one and only one job.
III. Each man or machine is independently capable of handling any of the job being presented.
IV. Loading criteria must be clearly stated such as “minimizing operating time" or “maximizing profit" or “minimizing production cost" etc.
7. Distinguish between transportation model and assignment mode.
The only difference between a standard assignment and a transportation model is that. Here assignment model always no. of origins is equal to the no. of destinations and at each origin always 1 unit is available and always 1unit is required at each of the destination. Here ( assignment model )the cost matrix is always square. Thus each task can be assigned 10 only one facility.
8. State the methods for solving assignment problem
I. Enumeration method
II. Transportation method
III. Simplex method
IV. Hungarion method