Solving the Tree-Structured Task Allocation Problem via Group Multirole Assignment
- 27 May 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 17 (1) , 41-55
Abstract
Task allocation is a critical phase of project management. Tree-type structures are frequently used constraints to obtain a pertinent task allocation. They can illustrate where one task may require numerous agents and when an agent can be assigned to different tasks (roles). The process of task allocation is made more complex when administrators need to satisfy sequential and fixed branch relationships between/among tasks (roles). This paper formalizes the tree-structured task allocation problem (TSTAP) with group multirole assignment (GMRA) and proves necessary conditions, the necessary and sufficient condition, as well as sufficient conditions, of TSTAP. The formalization makes it easy to find a solution with the IBM ILOG CPLEX optimization package (CPLEX). The necessary conditions improve the CPLEX solution by eliminating infeasible cases. The necessary and sufficient condition describes the solution space of TSTAP completely. Another exciting result is that the sufficient conditions can not only improve the CPLEX solution by describing a practical approximate solution space but also help decision-makers and human resource officers organize a team in order to successfully assign tasks. The proposed approach is verified by simulation experiments with respect to a real-world problem. The experimental results present the practicability of the proposed solutions in this paper. This paper was motivated by general cooperative projects whose tasks have tree-structured relationships. This can make the problem of successful multitask assignment extremely challenging. The traditional method of assignment such as the KM algorithm can no longer solve this problem. To solve the assignment problem with tree-structured relationships, an efficient many-to-many assignment with constraints is required. The proposed approach provides theoretical and technical foundations for efficient assignment of TSTA, which can not only provide a viable and effective assignment scheme for TSTA problems but also help human resource officers to formulate reasonable plans according to the relationships between/among tasks.Keywords
Funding Information
- National Natural Science Foundation of China (61402118)
- Natural Sciences and Engineering Research Council of Canada (RGPIN2018-04818)
- Science and Technology Planning Project of Guangdong Province (2016B010108007)
- S&T Project of Guangzhou (201604020145)
- Tianhe District S&T (201602YH029)
This publication has 41 references indexed in Scilit:
- Translation of statechart agents into a BDI framework for MAS engineeringEngineering Applications of Artificial Intelligence, 2015
- Multidomain Model Integration for Online Collaborative System Design and Detailed Design of Complex Mechatronic SystemsIEEE Transactions on Automation Science and Engineering, 2015
- A Hyperheuristic Approach for Intercell Scheduling With Single Processing Machines and Batch Processing MachinesIEEE Transactions on Systems, Man, and Cybernetics: Systems, 2014
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activitiesApplied Mathematical Modelling, 2014
- Using hybrid scheduling for the semi-autonomous formation of expert teamsFuture Generation Computer Systems, 2014
- A comprehensive taxonomy for multi-robot task allocationThe International Journal of Robotics Research, 2013
- ELDAMeth: An agent-oriented methodology for simulation-based prototyping of distributed agent systemsInformation and Software Technology, 2012
- An Exact Algorithm for the Quadratic Assignment Problem on a TreeOperations Research, 1989
- Algorithms for the Assignment and Transportation ProblemsJournal of the Society for Industrial and Applied Mathematics, 1957
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955