|
Assignment Problem |
Transportation Problem |
| (i) Assignment means allocating various jobs to various people in the organization. Assignment should be done in such a way that the overall processing time is less, overall efficiency is high, overall productivity is high, etc. | (i) A transportation problem is concerned with transportation method or selecting routes in a product distribution network among the manufacture plant and distribution warehouse situated in different regions or local outlets. |
| (ii) We solve an assignment problem by using two methods.
(a) Completer enumeration (b) Hungarian method
|
(ii) We use three methods for solving a transportation problem i.e., to find IBFS :
(a) VAM (b) NWCR (c) LCM Thereafter we find the optimum solution by using the MODI method. |
| (iii) In an assignment problem only one allocation can be made in particular row or a column. | (iii) A transportation problem is not subject to any such restrictions. Such restriction are peculiar to assignment problems only. Many allocations can be done in a particular row or particular column. |
| (iv) In assignment problem management aims at assignment jobs to various people. | (iv) In transportation method, management is searching for a distribution route, which can lead to minimization of cost and maximization of profit. |
| (v) When no. of jobs no. of workers, it is a unbalanced problem. | (v) When the total demand is not equal to total supply it is unbalanced problem. |
Ads hindering the accessibility of content of page
Would you be interested to buy a premier membership for an ad free version of this site?