An Efficient Algorithm for Obtaining the Optimum Solution of a Generalized Assignment Problem

作     者：HUANG De\|cai College of Information Engineering, Zhejiang University of Technology, Hangzhou 310014, China 

出 版 物：《Systems Science and Systems Engineering》 (系统科学与系统工程学报（英文版）)

年 卷 期：1999年第9卷第3期

页      面：314-319页

核心收录：

学科分类：0711[理学-系统科学] 12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 08[工学] 0811[工学-控制科学与工程] 081103[工学-系统工程] 

主　　题：assignment problem business management linear programming 

摘      要：This paper considers a generalized assignment problem. After intensively analyzing and researching, the generalizsed assignment problem is ingeniously reduced to a traditional assignment problem of which the optimum solution can be easily obtained by a famous method:Hungary algorithm. Finally, an illustrating example is given.