HUANG De|cai College of Information Engineering,Zhejiang University of Technology,Hangzhou 310014,China
Abstract:
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.