摘要
本文利用实例验证了在用匈牙利算法求解指派问题时,不平衡的指派问题转化为平衡指派问题的必要性;总结对于几种不平衡的指派问题转化为平衡指派问题的方法,从理论上作出解释,并给出了相应的例题,特别对于任务数多于人数的指派问题,本文提出了新的更有针对性的转化方法,如"一人化成p人法"、"加边补小法"、"加边补零(M)法"等。
In this paper,the necessity of the transformation of the unbalanced assignment problem to the balanced assignment problem is tested with examples.The methods of transformation are summarized and explained from theory;and gived an example of the problem,especially,the methods of the transformation are brought up.For example,the method of ＂one to p persons＂,the method of ＂the adding rows with zero or M＂,the method of ＂the adding rows with min＂ and so on.
出处
《价值工程》
2010年第13期120-122,共3页
Value Engineering
关键词
指派问题
匈牙利算法
一人化成p人法
加边补小法
加边补零(M)法
assignment problem
the Hungaryalgorithm
the method of ＂one to p persons＂
the method of ＂the adding rows with min＂
the method of ＂the adding rows with zero or M＂
