节点文献
基于E-CARGO模型的多任务分配算法
Multi-task assignment algorithms based on the E-CARGO model
【摘要】 多任务分配是管理和协同工作中的重要问题。采用E-CARGO建模来解决常规多任务分配问题(GMTAP)与组角色多任务分配问题(GRMTAP)。提出了两种算法:(1)通过把GMTAP质量评估矩阵转置转化为组角色分配问题(GRAP),再利用GRAP算法来完成多任务分配;(2)将GRMTAP分配问题转化为常规分配问题(GAP),利用K-M(亦称匈牙利)算法来实现多任务分配。最后,通过实验验证了GMTAP与GRMTAP算法的有效性,即,算法很好地满足了多任务分配问题的需要,也有效地扩展了GRAP算法与K-M算法的应用范围。
【Abstract】 Multi-task assignments are a critical problem in management and collaboration.At first,we formalize the general multi-task assignment problem(GMTAP)and the group role multi-task assignment problem(GRMTAP)with the Environments-Classes,Agents,Roles,Groups and Objects(ECARGO)model.Then we propose two algorithms:(1)converting the GMTAP into a group role assignment problem(GRAP)by matrix transposing and using the GRAP algorithm to realize the task assignment;and(2)converting the GRMTAP into a GAP that is solved by the Kuhn-Munkres(K-M,also called Hungarian)algorithm.Finally,we conduct numerical experiments and analyze the solutions’ performance.Results show that the proposed algorithms are effective,can meet the requirement of practical multi-task assignments and extend the application scope of the GRAP algorithm and the K-M algorithm.
【Key words】 E-CARGO model; general multi-task assignment; group role multi-task assignment; gen eral assignment problem; group role assignment problem;
- 【文献出处】 计算机工程与科学 ,Computer Engineering & Science , 编辑部邮箱 ,2016年12期
- 【分类号】TP301.6
- 【被引频次】4
- 【下载频次】219