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 (ECARGO) 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.

 

ECARGO model, general multitask assignment, group role multitask assignment, general assignment problem, group role assignment problem

 ,