期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
期号：SASURIE
页码：197
出版社：S&S Publications
摘要：The assignment problem is a special type of linear programming problem in which our objectives is to aminimum cost (time). The mathematical formulation of the problem suggests that this is a programmingproblem and is highly degenerate. All the algorithms developed to find optimal solution of transportation problems areapplicable to assignment problem. However, due to its highly degeneracy nature, a specially designed algorithm widelyknown as Hungarian method proposed by khun is used for its solution. Examples of these types of problems areassigning men to offices, crew (drivers and conductors) to buses, trucks to delivery routes etc.
