New Proposed Method for Solving Assignment Problem and Comparitive Study with the Existing Methods

dc.contributor.author	Asst.Prof.K.S, Sreeja
dc.date.accessioned	2020-06-30T12:00:35Z
dc.date.available	2020-06-30T12:00:35Z
dc.date.issued	2019-11
dc.identifier.issn	2395-0056
dc.identifier.uri	http://202.88.229.59:8080/xmlui/handle/123456789/2537
dc.description.abstract	An assignment problem concerns as to what happens to the effectiveness function when we associate each of a number of origins with each of the same number of destinations. Each resources or facility is to be associated with one and only one job and associations are to be made in such a way so as to minimize the total effectiveness. The optimum allocation for balanced assignment problem is discussed here. In this paper, as a method to bring efficiency to solve assignment problems with new technique is formulated. One problem is illustrated using new method and result is compared to Hungarian method.	en_US
dc.language.iso	en	en_US
dc.publisher	IRJET	en_US
dc.subject	Assignment problem, optimum solution, Numerical comparison, Hungarian Method, zero assignment	en_US
dc.title	New Proposed Method for Solving Assignment Problem and Comparitive Study with the Existing Methods	en_US
dc.type	Article	en_US