基于能力匹配的异地敏捷开发任务分配方法  

Distributed Agile Development Task Allocation Based on Capability Matching

作　　者：叶上华 殷茗[2] 杨益 姜继娇[3] YE Shang-Hua;YIN Ming;YANG Yi;JIANG Ji-Jiao(Institute of Computer Science,Northwestern Polytechnical University,Xi’an 710072,China;Institute of Software,Northwestern Polytechnical University,Xi’an 710072,China;Management School,Northwestern Polytechnical University,Xi’an 710072,China)

机构地区：[1]西北工业大学计算机学院,西安710072 [2]西北工业大学软件学院,西安710072 [3]西北工业大学管理学院,西安710072

出　　处：《计算机系统应用》2020年第4期236-241,共6页Computer Systems & Applications

基　　金：航空科学基金(2016ZG53071);教育部人文与社会科学基金(16YJA630068,18YJA630043);陕西省自然科学基础研究计划(2018JM7008);陕西省社会科学基金(2018S28)。

摘　　要：为了能够快速准确地获得异地敏捷软件开发团队任务分配的全局最优解,提出了一种基于能力匹配的异地敏捷开发任务分配方法.该方法强调子任务能力需求和团队能力的匹配关系,构建了能力匹配的效用函数,对效用矩阵进行求解,全局效用值最大时获得最优分配方案.算例仿真结果表明,所提出的方法可以有效得到能力匹配较优的任务分配方案.In order to quickly and accurately obtain the global optimal solution for task allocation of distributed agile software development teams, the study proposes a method based on capability matching. This method builds the utility function of capability matching on the basis of the subtask capability demand degree vector and the team ability vector. We solve the utility matrix, and the optimal allocation scheme is obtained when the global utility value is the largest. The simulation results show that the method could effectively obtain a task allocation scheme with better capability matching.

关 键 词：异地敏捷开发 任务分配 效用 匈牙利算法 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]