允许协助条件下的指派问题研究

就许多指派场合常常要求加强合作,提高工作效率,但经典指派问题并没有讨论任务完成者之间可以相互协助以及如何协助等情况,详细阐述了在允许协助条件下指派问题中的合作效率概念及其计算公式,并对帮助对象的选取提出了几条常用原则和对应算法。最后,基于帮助对象的选取原则和匈牙利算法,对该问题最优化算法进行了具体描述,计算实例表明该算法是有效的。

Research on assignment problem within the confines of permissive help

It is necessary to strengthen the cooperation for enhancing the work efficiency in many conditions. But the cooperation and the cooperative mode among the workers performing respective work are not mentioned in the classical assignment problem. A concept of cooperative efficiency within the confines of permissive help is elaborated, and some rules and their algorithms for selecting the helpful objects are proposed. Finally, based on the rules and Hungary algorithm, the optimization algorithm is described in detail, which is proven effective by the given example.