首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于几种不平衡指派问题的修正匈牙利解法
引用本文:杜金玲,周杰.关于几种不平衡指派问题的修正匈牙利解法[J].价值工程,2010,29(13):120-122.
作者姓名:杜金玲  周杰
作者单位:1. 山东建筑大学管理工程学院,济南,250101
2. 济南铁道职业技术学院学生处,济南,250014
摘    要:本文利用实例验证了在用匈牙利算法求解指派问题时,不平衡的指派问题转化为平衡指派问题的必要性;总结对于几种不平衡的指派问题转化为平衡指派问题的方法,从理论上作出解释,并给出了相应的例题,特别对于任务数多于人数的指派问题,本文提出了新的更有针对性的转化方法,如"一人化成p人法"、"加边补小法"、"加边补零(M)法"等。

关 键 词:指派问题  匈牙利算法  一人化成p人法  加边补小法  加边补零(M)法

Fixed Hungaryalgorithm to Unbalanced Assignment Problems
Du Jinling,Zhou Jie.Fixed Hungaryalgorithm to Unbalanced Assignment Problems[J].Value Engineering,2010,29(13):120-122.
Authors:Du Jinling  Zhou Jie
Institution:Du Jinling; Zhou Jie(①School of Management and Engineering,Shandong Architectural University,Jinan 250101,China;②Jinan Railway Polytechnic College Student Office,Jinan 250014,China)
Abstract: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.
Keywords: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"
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号