Tree-Structured Task Allocation Algorithm And Optimization Via Group Multirole Assignment

"Made in China 2025" plan puts forward that industrial production management should achieve horizontal cross-domain and vertical depth cooperation between enterprises to ensure the unity of production process and management,optimize industrial structure,improve resource utilization,and ensure product quality.However,the agents in coordination and cooperation often have constraints between each other due to various spatio-temporal conflicts,resulting in a decrease in execution power and even a failure in cooperation.Thus,solving the first-order logical conflict between agents and tasks is one of the difficult problems in collaboration.Moreover,division of labor is the core of collaboration as a fine division of labor make collaboration effective and efficient.Therefore,knowledge representation of various spatio-temporal constraints in assignment is the key to solving collaborative production management problems.The constraints of spatio-temporal constraints,such as priority and mutual exclusion relationships between tasks and agents in industrial production management,make conflicts in collaboration,which decreasing execution of collaborative systems.In order to solve the problem,this thesis studies the assignment algorithm with first-order logical spatio-temporal constraints called tree structure constraints.The thesis mainly:(1)formalizes the treestructured task allocation problem with group multirole assignment by using role-based collaboration and its E-CARGO model to take the relationships between tasks into consideration;(2)finds practical solutions to the tree-structured task allocation problem by use IBM ILOG CPLEX optimization package(CPLEX)based on knowledge representation of matrix and vectorization implemented on the tree conflict constraint;(3)Last but not least,analyzes proposed algorithm and improve it by proving necessary conditions,the necessary and sufficient condition,as well as sufficient ones for the tree-structured task allocation problem to have a feasible solution.The experimental results show that the proposed assignment algorithm called CPLEX algorithm is practical.By using the sufficient and necessary conditions,necessary conditions,as well as sufficient conditions to describe the solution space of the problem,the assignment algorithm is further optimized by improving time efficiency significantly.Moreover,there is an exciting result that the necessary conditions as well as sufficient conditions can not only improve the CPLEX solution but also help decision makers improve their original resource configuration to organize an effective and reliable collaborative team.