A workflow task allocation method, device, storage medium and program product
By dynamically assigning workflow task processing personnel, combining the information of users and user groups, using the processing capacity model and fitness analysis, the problem of low resource utilization caused by fixed task processing personnel in the existing technology is solved, and the workflow is improved Execution efficiency and flexibility.
Patent Information
- Application Number
- CN202411222947.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-03
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-09-03
AI Technical Summary
The existing workflow task handlers are fixed in the process design stage, which leads to lack of flexibility in process execution and cannot be dynamically adjusted, resulting in low resource utilization and difficulty in meeting rapidly changing business needs.
By obtaining the task node processor allocation rules in the process request, dynamically assigning task processors, and based on the user or user group's role, functions, departments and other information, combined with the processing ability model and fitness analysis, the most suitable processor is determined. Implement flexible allocation of task nodes.
It improves the execution efficiency and resource utilization of workflows, makes process allocation and processing more flexible, adapts to actual business needs, and optimizes human resource allocation.
Smart Images

Figure CN118822214B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to workflow processing technology, and in particular to a workflow task allocation method, device, storage medium and program product. Background Art
[0002] Workflow is a concept proposed for routine activities with fixed procedures in work. It aims to improve production organization and work efficiency by breaking down well-defined tasks, processes, roles and rules to execute and monitor work.
[0003] At present, the task handlers of workflows are usually determined at the process definition stage, which has certain limitations in practical applications. Since the assignment of task handlers is fixed at the beginning of process design, there is a lack of flexibility in the process execution and it is impossible to dynamically adjust according to actual business needs. When the business environment changes or special circumstances arise and task handlers need to be adjusted, the traditional process definition method is inefficient and difficult to meet rapidly changing business needs. In addition, pre-determining task handlers also limits the workflow system's optimal allocation of human resources, which may lead to waste or shortage of resources.
[0004] Therefore, how to improve the execution efficiency of workflows and optimize resource utilization is an urgent problem that needs to be solved. Summary of the invention
[0005] The present application provides a workflow task allocation method, device, storage medium and program product to solve the problems of low workflow execution efficiency and resource utilization.
[0006] In a first aspect, the present application provides a workflow task allocation method, comprising:
[0007] Obtaining a process request, wherein the process corresponding to the process request includes at least one task node, the process request includes a task node handler assignment rule, and the task node handler assignment rule includes post-assigning a task node handler;
[0008] If the task node processor assignment rule is the post-assignment task node processor, then according to the task node processor assignment rule included in the process request, determine the processor who processes the task node, the task node processor assignment rule includes assignment according to the user and assignment according to the user group, the user group includes a role group and / or a department group, and the roles included in the role group are related to the user's position, and / or the user's function, and / or the department to which the user belongs;
[0009] The task node is allocated to the terminal device of the processor for processing.
[0010] Optionally, if the task node processor allocation rule is allocation based on user groups, determining the processor for processing the task node based on the task node processor allocation rule included in the process request includes:
[0011] Acquire user group information corresponding to the task node from the process request, where the user group includes a role group and / or a department group;
[0012] According to the user group information, obtaining users included in the user group;
[0013] Determine the minimum permissions required to process the task node;
[0014] According to the minimum authority, a user corresponding to the minimum authority is determined from the users included in the user group as a processor who processes the task node.
[0015] Optionally, the method further includes:
[0016] If the role is related to the department to which the user belongs, and there is no user corresponding to the role in the department, query the first target user corresponding to the role in the user group corresponding to the superior department of the department;
[0017] If there is a first target user corresponding to the role in the user group corresponding to the superior department of the department, the first target user is determined as a processor for processing the task node;
[0018] If there is no first target user corresponding to the role in the user groups corresponding to the superior departments of the department, the first administrator user is determined as the person who handles the task node; or, the second target user indicated by the first administrator user is determined as the person who handles the task node.
[0019] Optionally, the determining, according to the minimum permission, from the users included in the user group, a user corresponding to the minimum permission as a processor for processing the task node, includes:
[0020] Parsing the process request, extracting a business requirement sequence of each task node in the process request, wherein the business requirement sequence includes importance requirement, complexity requirement, processing time requirement, and skill requirement of the task node;
[0021] Determine the capability sequence of users included in the user group through a trained handler capability model, wherein the capability sequence includes the user's skill capability, efficiency capability, historical task completion capability, and load capability, and the handler capability model is obtained through training based on the user's historical data;
[0022] Calculating the correlation between the business requirement sequence and the capability sequence of users included in the user group through correlation analysis, and determining candidate handlers whose correlation with the business requirement sequence is higher than a preset correlation threshold;
[0023] A processor who processes the task node is determined from the candidate processors.
[0024] Optionally, determining a processor to process the task node from the candidate processors includes:
[0025] Acquire a to-be-processed task node including the task node, and an initial allocation set, wherein the to-be-processed task node is a task node to be allocated to the candidate processor for processing, and each element in the initial allocation set represents each allocation strategy for allocating the task node to the candidate processor;
[0026] Determining fitness characteristics of each candidate processor for processing each task node, wherein the fitness characteristics include a predicted processing time, a predicted processing quality, and a current workload of each candidate processor for processing each task node;
[0027] According to each of the fitness features, a fitness value of the initial allocation set is calculated by a fitness function, wherein the fitness value represents the pros and cons of the allocation strategy corresponding to the initial allocation set;
[0028] The initial allocation set is updated according to a preset rule, and a fitness value corresponding to the updated initial allocation set is iteratively calculated until the fitness value reaches a preset fitness threshold;
[0029] According to the allocation strategy in the target allocation set whose fitness value reaches a preset fitness threshold, a processor who processes the task node is determined from the candidate processors.
[0030] Optionally, determining the fitness characteristics of each candidate processor for processing each task node includes:
[0031] Acquire the historical processing data of the task node and the historical processing data of the candidate handler; the historical processing data of the task node includes the capability sequence of the handler who has historically processed the task node and the historical processing time sequence of the task node; the historical processing data of the candidate handler includes the business requirement sequence of the candidate handler's historical processing of the task node and the historical processing time sequence of the candidate handler's historical processing of the task node;
[0032] Training a decision tree model by using the historical processing data of the task node and the historical processing data of the candidate processor to generate a trained decision tree model;
[0033] Inputting the business requirement sequence of the task node and the capability sequence of the candidate processors into the trained decision tree model to generate a predicted processing time for the candidate processors to process the task node;
[0034] Obtaining a historical processing quality sequence of the candidate processor;
[0035] Training a support vector machine model by using the historical processing quality sequence to generate a trained support vector machine model;
[0036] Inputting the business requirement sequence of the task node and the historical processing quality sequence of the candidate processor into the trained support vector machine model to generate the predicted processing quality of the task node processed by the candidate processor;
[0037] Determining the fitness characteristics of each of the candidate processors for processing each of the task nodes according to the predicted processing time and predicted processing quality of each of the candidate processors for processing each of the task nodes, and the current workload of the candidate processor;
[0038] The step of determining the fitness characteristics of each candidate processor for processing each task node according to the predicted processing time and predicted processing quality of each candidate processor for processing each task node and the current workload of the candidate processor includes:
[0039] Obtaining a first weight corresponding to the predicted processing time and a second weight corresponding to the predicted processing quality, wherein the first weight is related to the time sensitivity of each of the task nodes, and the second weight is related to the quality requirement of each of the task nodes;
[0040] A first scoring indicator is generated by fusion calculation according to the predicted processing time, the predicted processing quality, the first weight, and the second weight, where the first scoring indicator is used to characterize a first processing capability of each of the candidate processors to process each of the task nodes;
[0041] Acquire workload information of each candidate processor, wherein the workload information includes at least one of the number of assigned task nodes, task node priority, and estimated completion time;
[0042] Generating a load adjustment coefficient corresponding to each of the candidate processors according to the workload information, wherein the load adjustment coefficient is used to characterize the adaptability of each of the candidate processors to the new task node under the current load;
[0043] The first scoring index corresponding to each of the candidate processors is adjusted by the load adjustment coefficient corresponding to each of the candidate processors to generate a second scoring index, where the second scoring index is used to characterize the second processing capability of each of the candidate processors in processing each of the task nodes under the current load;
[0044] Generate a fitness matrix according to the second scoring indicator, each of the task nodes, and each of the candidate handlers, wherein the fitness matrix represents the comprehensive ability of each of the candidate handlers to handle each of the task nodes, the rows of the fitness matrix are each of the candidate handlers, the columns of the fitness matrix are each of the task nodes, the values in the fitness matrix are fitness characteristic values corresponding to each of the candidate handlers and each of the task nodes, and the fitness characteristic values are related to the standardized result of the second scoring indicator;
[0045] Extracting the fitness characteristics of each candidate processor for processing each task node through the fitness matrix;
[0046] The step of extracting the fitness characteristics of each candidate processor for processing each task node through the fitness matrix includes:
[0047] Extracting the overall fitness characteristics, task node specific fitness characteristics, and relative fitness characteristics of each candidate handler from the fitness matrix, wherein the overall fitness characteristics represent the overall adaptability of each candidate handler to all task nodes, and the overall fitness characteristics are the average value of all fitness characteristic values of each candidate handler; the task node specific fitness characteristics represent the adaptability of each candidate handler under each task node; and the relative fitness characteristics represent the fitness ranking of each candidate handler under each task node;
[0048] Based on the overall fitness characteristics, the task node specific fitness characteristics, and the relative fitness characteristics, a comprehensive analysis is performed to determine the fitness characteristics of each candidate processor for processing each task node.
[0049] Optionally, the method further includes:
[0050] After the processor completes processing the task node, obtaining processing time information and processing quality information of the processor processing the task node;
[0051] According to the processing time information and the processing quality information, the historical processing data of the processor is updated, and the future capability trend of the processor is predicted through time series analysis;
[0052] The processing time information, the processing quality information, and the future capability trend of the processor are updated into the processor capability model to update and optimize the processor capability model.
[0053] In a second aspect, the present application provides an electronic device, comprising: a processor, a communication interface and a memory, wherein the processor is communicatively connected to the communication interface and the memory respectively;
[0054] The memory stores computer-executable instructions;
[0055] The communication interface communicates and interacts with external devices;
[0056] The processor executes the computer-executable instructions stored in the memory to implement the method as described in any one of the first aspects.
[0057] In a third aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the method as described in any one of the first aspects.
[0058] In a fourth aspect, the present application provides a computer program product, comprising a computer program, which implements any one of the methods in the first aspect when executed by a processor.
[0059] The task allocation method, device, storage medium and program product of the workflow provided by the present application obtain a process request. If the task node processor allocation rule is the post-assignment task node processor, the processor who processes the task node is determined according to the task node processor allocation rule included in the process request, and the task node is allocated to the terminal device of the processor for processing. This allows each task node in the workflow to dynamically allocate the processor who processes the task node according to actual needs, thereby improving the flexibility of process allocation and process processing, making it more adaptable to actual business needs, and thus improving the efficiency of the workflow. BRIEF DESCRIPTION OF THE DRAWINGS
[0060] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0061] Figure 1 A flowchart of a workflow task allocation method provided in an embodiment of the present application;
[0062] Figure 2 A flowchart of another workflow task allocation method provided in an embodiment of the present application;
[0063] Figure 3A flowchart of another workflow task allocation method provided in an embodiment of the present application;
[0064] Figure 4 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application.
[0065] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION
[0066] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.
[0067] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below in conjunction with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.
[0068] Figure 1 The following is a flowchart of a workflow task allocation method provided in an embodiment of the present application. Figure 1 As shown, the method may include:
[0069] S101, obtaining a process request.
[0070] The process corresponding to the process request includes at least one task node, the process request includes a task node handler assignment rule, and the task node handler assignment rule includes a post-assignment task node handler. The process request can be, for example, a request for an approval process, or a process corresponding to other workflows such as a project management process, and this application does not limit this.
[0071] The post-assignment of task node handlers means that the task node handlers are not fixed at the beginning of process design, but are dynamically assigned handlers according to the actual needs of the task node during process execution, so that the server can assign the most appropriate handler to each task node based on real-time business needs and personnel conditions. When designing the process, you can select the handler assignment rules for each task node under the process through the process design interface.
[0072] The process corresponding to the process request may include a task node whose handler assignment rule is to post-assign a task node handler, and may also include a task node whose task node handler is fixedly assigned according to the handler assignment rule.
[0073] S102: If the task node processor allocation rule is the post-assignment task node processor, determine the processor who processes the task node according to the task node processor allocation rule included in the process request.
[0074] Among them, the task node processor allocation rules include allocation based on users and allocation based on user groups. The user groups include role groups and / or department groups. The roles included in the role groups are related to the user's position, and / or the user's function, and / or the department to which the user belongs.
[0075] The server parses the task node handler assignment rule in the process request. If the task node handler assignment rule is based on user assignment, the server will find the specified user and ensure that the user has the authority and ability to process the task node.
[0076] If the rule is assigned based on user groups, the server determines the member list of the user group. This user group may be role-based, such as the "Purchasing Manager" role group, or department-based, such as the "Finance Department" department group.
[0077] After determining the user or user group, the server can further match the most suitable processor according to the specific needs of the task node and the user's ability model. For example, if a task node requires a person with financial management experience to handle it, the server will select users with relevant experience and skills from the "Finance Department" user group.
[0078] Optionally, the server will also consider the user's workload to avoid assigning new tasks to users who already have too much work.
[0079] S103: Allocate the task node to the terminal device of the processor for processing.
[0080] The server sends detailed information of the task node to the processor through the task system or email. The processor's terminal device (such as a computer, mobile phone, etc.) will receive this notification and display the specific content and requirements of the task. The processor can directly access the task node through the terminal device and start processing. During the processing, the server can track the status of the task in real time to ensure the smooth progress of the process.
[0081] For example, the server can assign the task node to the electronic device of user A corresponding to the task node processor assignment rule through the task system. After user A's electronic device receives the "approval" task, user A can log in to the task system through his electronic device, view the detailed information of the task, and perform the approval operation. After the approval is completed, the system will feedback the result to the server, and the process will continue to move forward to the next node.
[0082] The method provided by the embodiment of the present application obtains a process request, and if the task node processor allocation rule is the post-assignment task node processor, then according to the task node processor allocation rule included in the process request, the processor who processes the task node is determined, and the task node is allocated to the terminal device of the processor for processing. This allows each task node in the workflow to dynamically allocate a processor to process the task node according to actual needs, thereby improving the flexibility of process allocation and process processing, making it more adaptable to actual business needs, and thus improving the efficiency of the workflow.
[0083] In a possible implementation, if the task node processor allocation rule is allocation based on user groups, then in the aforementioned step S102, determining the processor for processing the task node according to the task node processor allocation rule included in the process request may include:
[0084] S1021. Obtain user group information corresponding to the task node from the process request.
[0085] The user group includes a role group and / or a department group.
[0086] After receiving the process request, the server matches the specific field in the data segment related to the task node according to the preset rules or patterns, indicating which user group the task node should be assigned to for processing. This field may directly contain the name, ID or other unique identifier of the user group.
[0087] The user group can be role-based, such as "Management Group" or "Sales Group", which are usually divided according to the functions or positions of the members. Or the user group can be department-based, such as "Finance Department" or "Human Resources Department", which are determined according to the organizational structure to which the members belong.
[0088] Specifically, the server may use a query language such as regular expression, JSONPath or XPath to locate and extract user group information.
[0089] For example, suppose there is a purchase approval process, and a member of the Finance Department needs to review a certain task node. The process request may contain a clear field, such as "Finance Department". After receiving this request, the server can use the built-in parsing tool to find this field and identify that "Finance Department" is the user group that needs to process this task node.
[0090] S1022: Acquire users included in the user group according to the user group information.
[0091] The server can use the name, ID or other identifier of the user group to construct a query request. This request can be sent to a user management system (UMS) to obtain a list of users in the user group. The UMS usually maintains a database that stores the association between user groups and users.
[0092] After receiving the query request, UMS will retrieve all associated users based on the provided user group information. This user information may include but is not limited to the user's ID, name, email address, position and department. After the retrieval is completed, UMS will return the user list to the server.
[0093] After the server receives the user list, it stores it in memory or writes it to a temporary database for use in subsequent steps.
[0094] S1023. Determine the minimum authority required to process the task node.
[0095] When processing enterprise processes, different task nodes often require different levels of permissions to complete. In order to ensure data security and process standardization, the server needs to accurately determine the minimum permissions required for each task node.
[0096] In this step, the server can consult the permission profile or database related to the process. These profiles or databases record in detail the permission levels required for each process and each task node. These permission levels may be defined by the role-based access control (RBAC) model, or attribute-based access control (ABAC) or other models.
[0097] The server queries these configuration files or databases to find the permission requirements corresponding to the current task node. These requirements may include the ability to read, edit or delete specific types of data, the ability to initiate, approve or reject certain types of requests, etc.
[0098] For example, suppose that in the purchase approval process, a task node needs to approve a high-value purchase order. In order to complete this task, the processor not only needs to be able to view the order details, but also needs to have the authority to modify the order status or approve the purchase. After consulting the permission configuration file, the server determines that the minimum permission required to process this task node is "purchase order approval authority". Only users with this permission can be assigned to process this task node.
[0099] S1024. According to the minimum permission, determine, from the users included in the user group, a user corresponding to the minimum permission as a processor who processes the task node.
[0100] The server can query the permission configuration of the users in the user list one by one according to the user list in the user group obtained in step S1022 to determine which users have the required minimum permissions. Only when the permissions of the users fully meet or exceed the minimum permissions will they be considered as potential processors.
[0101] Specifically, this step can be implemented through the following sub-steps:
[0102] S10241. Parse the process request and extract the business requirement sequence of each task node in the process request.
[0103] The business requirement sequence includes the importance requirement, complexity requirement, processing time requirement, and skill requirement of the task node.
[0104] After receiving the process request, the server can use the built-in parsing tool to break down the request in detail. During this process, the server can pay special attention to the fields or data segments that define the business requirements of the task node. These business requirements usually include the importance and complexity of the task, the processing time requirements, and the skills required.
[0105] Among them, the importance requirement indicates the impact of the task on the entire process or project, which may be divided into high, medium, and low levels. The complexity requirement reflects the difficulty of the task itself, which helps to evaluate the professional knowledge and experience level required by the handler. The processing time requirement stipulates the urgency or completion time of the task. The skill requirement clarifies the professional skills or qualifications required to handle the task, which is the key basis for selecting qualified handlers.
[0106] The server accurately extracts this information and constructs a corresponding business demand sequence, providing a data basis for subsequent processor selection and task allocation.
[0107] S10242: Determine the capability sequence of users included in the user group through the trained processor capability model.
[0108] Among them, the capability sequence includes the user's skill capability, efficiency capability, historical task completion capability, and load capacity, and the handler capability model is obtained by training based on the user's historical data.
[0109] The server evaluates the ability of each user in the user group through the trained handler ability model to find the most suitable handler. The handler ability model can be trained based on user historical data (historical data such as user skill ability, efficiency ability, historical task completion ability, load capacity, etc.). The users included in the user group are input into the handler ability model, and the handler ability model outputs the ability score of each user included in the user group, and generates the ability sequence of the users included in the user group according to the ability score.
[0110] Exemplarily, the server can use the processing person capability model to evaluate the members of the "Software Engineer" user group. For example, user A has a deep skill reserve and rich practical experience in performance optimization, has high quality of historical task completion, and has a moderate current workload. Although user B also has relevant skills, his recent task completion efficiency is not high, and his current workload is heavy. Therefore, in the capability sequence, user A may be rated higher than user B. User A has a higher priority than user B in the capability sequence.
[0111] S10243. Calculate the correlation between the business requirement sequence and the capability sequence of users included in the user group through correlation analysis, and determine candidate processors whose correlation with the business requirement sequence is higher than a preset correlation threshold.
[0112] The server can use correlation algorithms such as cosine similarity and Pearson correlation coefficient to calculate the correlation between each user's capability sequence and business requirement sequence. This calculation process takes into account all relevant dimensions, such as skill matching, efficiency expectations, similarity between historical performance and current tasks, and the user's current workload.
[0113] After the calculation is completed, the server uses a pre-set relevance threshold to select users whose relevance to the business demand sequence is higher than the relevance threshold as candidate processors, to ensure that the selected processors not only have the skills required to complete the task, but also meet the expected standards in terms of efficiency and quality.
[0114] For example, the server finds through correlation analysis that the correlation score between the capability sequence of user A and the business requirement sequence is higher than the preset correlation threshold. User A not only has professional skills in performance optimization, but also has high historical task completion efficiency and moderate current load, so he is selected as a candidate processor.
[0115] S10244. Determine a processor who processes the task node from among the candidate processors.
[0116] Among them, the candidate processors may include multiple users, and the server can randomly select a processor to process the task node from the candidate processors, or select based on the load balancing of the processors, or sort according to the users' comprehensive scores or proficiency in specific skills, giving priority to users with high scores or more matching skills, or the server can also select a processor to process the task node based on the fitness characteristics of each candidate processor in processing each task node.
[0117] Specifically, taking the selection of a processor for processing the task node by the fitness features of each candidate processor for processing each task node as an example, this step can be implemented by the following sub-steps:
[0118] S1. Obtaining the to-be-processed task nodes including the task node and an initial allocation set, wherein the to-be-processed task nodes are task nodes to be allocated to the candidate processor for processing.
[0119] Each element in the initial allocation set represents each allocation strategy for allocating the task node to the candidate handler.
[0120] The server can retrieve currently unassigned task nodes from the task management system. These nodes may be newly added tasks, or tasks that were previously assigned and need to be reallocated for various reasons. At the same time, the server will also load a preset set of initial allocation strategies, which may be based on different optimization goals, such as load balancing, skill matching, and shortest processing time.
[0121] S2. Determine the fitness characteristics of each candidate processor for processing each task node.
[0122] The fitness characteristics include the predicted processing time, predicted processing quality, and current workload of each candidate processor for processing each task node.
[0123] The server can evaluate the fitness characteristics of each candidate handler for each task node. These characteristics include predicted processing time, predicted processing quality, and the candidate handler's current workload. The predicted processing time is estimated by analyzing the candidate handler's past work efficiency and task complexity. The predicted processing quality is based on the candidate handler's historical performance in similar tasks. The current workload takes into account the number and urgency of the candidate handler's existing tasks.
[0124] The server can use machine learning models or statistical analysis tools to make these predictions and assessments, ensuring the accuracy and objectivity of the data.
[0125] For example, the server can analyze the historical coding speed and code quality of each candidate to predict the time and quality they will need to complete the task. At the same time, the server can also check the current workload of each candidate to ensure that they have enough time and resources to handle the new task.
[0126] S3. Calculate the fitness value of the initial allocation set through a fitness function according to each of the fitness features.
[0127] The fitness value represents the quality of the allocation strategy corresponding to the initial allocation set.
[0128] The server can use a fitness function to calculate the fitness value of each strategy in the initial allocation set. The fitness function can comprehensively consider fitness characteristics such as predicted processing time, predicted processing quality, and the current workload of the candidate processor to give a comprehensive score.
[0129] The fitness function may be linear or nonlinear, depending on the optimization goal and business requirements. The server will evaluate each allocation strategy based on the fitness function to find the strategies that can achieve the best balance in multiple dimensions.
[0130] For example, the fitness function may give higher scores to shorter prediction processing time and higher prediction processing quality. At the same time, if the candidate processor has a lighter current workload, it will also get extra points. The server calculates the fitness value of each allocation strategy through this function to find the optimal allocation solution.
[0131] S4. Update the initial allocation set according to a preset rule, and iteratively calculate the fitness value corresponding to the updated initial allocation set until the fitness value reaches a preset fitness threshold.
[0132] The server can update the initial allocation set according to the rules corresponding to the optimization algorithm such as random mutation and crossover combination to explore more possible allocation strategies to find the global optimal solution. After each allocation set update, the server will recalculate the fitness value to evaluate the performance of the new strategy. This process will be iterated until a certain stopping condition is met, such as reaching a preset number of iterations or the improvement of the fitness value is less than a certain threshold.
[0133] For example, the server may try to reallocate certain tasks to other candidate handlers, or adjust the order of task allocation to form a new allocation strategy. The server then recalculates the fitness values of these new strategies, determines whether the fitness values of the new strategies reach the preset fitness threshold, and iterates the process until the fitness values of the new strategies reach the preset fitness threshold.
[0134] S5. Determine a processor for processing the task node from among the candidate processors according to the allocation strategy in the target allocation set whose fitness value reaches a preset fitness threshold.
[0135] When the fitness value of a certain allocation strategy reaches or exceeds the preset fitness threshold, the strategy will be regarded as the target allocation strategy. The server will select a suitable processor from the candidate processors to process each task node according to the instructions in this target allocation strategy.
[0136] The method provided in the embodiment of the present application obtains the user group information corresponding to the task node from the process request, obtains the users included in the user group according to the user group information, determines the minimum authority required to process the task node, and determines the user corresponding to the minimum authority from the users included in the user group as the processor of the task node according to the minimum authority, thereby further improving the security of the method. In addition, in the method, the server can intelligently assign the task node to the most suitable candidate processor, and by comprehensively considering the fitness characteristics of the candidate processor such as the predicted processing time, predicted processing quality and current workload, it realizes efficient and reasonable allocation of tasks, optimizes the use of human resources, and improves the efficiency and quality of task processing.
[0137] Optionally, the above method may further include:
[0138] S1025: If the role is related to the department to which the user belongs, and there is no user corresponding to the role in the department, query a first target user corresponding to the role in a user group corresponding to a superior department of the department.
[0139] The server can first check whether the role is associated with the department to which the user belongs. If the role is associated with the department, and no user corresponding to the role is found in the department, the server will start traversing the parent departments of the department. During the traversal process, the server will query the user group corresponding to each parent department to find a user matching the specified role. This query process will continue until a target user corresponding to the role is found, or all parent departments have been traversed.
[0140] S1026: If there is a first target user corresponding to the role in the user group corresponding to the superior department of the department, the first target user is determined as a processor who processes the task node.
[0141] If the first target user corresponding to the role is found in the user group of a superior department, the server will immediately stop traversing and determine the first target user as the processor of the task node. This means that the server has found a suitable user who meets the role requirements to handle the task.
[0142] S1027: If the first target user corresponding to the role does not exist in the user group corresponding to the superior department of the department, the first administrator user is determined as the processor of the task node. Alternatively, the second target user indicated by the first administrator user is determined as the processor of the task node.
[0143] If the server still cannot find the first target user corresponding to the role after traversing all the user groups corresponding to the superior departments, the server can take alternative solutions. The first alternative solution is to directly determine the first administrator user as the processor of the task node. This is because administrators usually have higher authority and a wider scope of responsibility, so they can serve as a suitable substitute. The second alternative solution is that the server will seek instructions from the first administrator user to determine a second target user as the processor. This may be because the administrator believes that there are other users who are more suitable to handle the task, or for load balancing, expertise allocation, etc., they want to assign the task to a specific user. In both cases, the server will determine the final processor based on the administrator's decision.
[0144] The method provided in the embodiment of the present application is that if the role is related to the department to which the user belongs, and there is no user corresponding to the role in the department, then by querying the first target user corresponding to the role in the user group corresponding to the superior department of the department, if the first target user corresponding to the role exists in the user group corresponding to the superior department of the department, the first target user is determined as the person who handles the task node. If the first target user corresponding to the role does not exist in any of the user groups corresponding to the superior departments of the department, the first administrator user is determined as the person who handles the task node. Alternatively, the second target user indicated by the first administrator user is determined as the person who handles the task node, thereby reducing the situation where errors occur in the allocation of the task node when the department cannot match the specified user, and improving the stability of the allocation of the task node.
[0145] In a possible implementation, how to determine the fitness characteristics of each candidate processor for processing each task node in the aforementioned step S2 can be implemented through the following steps. Figure 2 A flowchart of another workflow task allocation method provided in an embodiment of the present application. Figure 2 As shown, the aforementioned step S2 may include:
[0146] S201. Acquire historical processing data of the task node and historical processing data of the candidate processor.
[0147] The historical processing data of the task node includes the capability sequence of the processor who has historically processed the task node and the historical processing time sequence of the task node. The historical processing data of the candidate processor includes the business requirement sequence of the candidate processor's historical processing task nodes and the historical processing time sequence of the candidate processor's historical processing task nodes.
[0148] The server can be connected to the data center or database of the enterprise and use a preset query statement or API interface to extract the historical processing data of the task node and the historical processing data of the candidate processor.
[0149] S202: Train a decision tree model using the historical processing data of the task node and the historical processing data of the candidate processors to generate a trained decision tree model.
[0150] The server can take the business requirements of the task node, the ability level of the processor, and the historical processing time as input, and the actual processing time as the target variable. By continuously dividing the data set and selecting the optimal division attribute, the decision tree model can learn the relationship between the input features and the target variable.
[0151] Optionally, in order to improve the generalization ability of the model, the server can use cross-validation, pruning and other techniques to optimize the model structure.
[0152] S203: Input the business requirement sequence of the task node and the capability sequence of the candidate processors into the trained decision tree model to generate a predicted processing time for the candidate processors to process the task node.
[0153] The server can input the business requirement sequence of the task node and the capability sequence of the candidate handlers as input data into the trained decision tree model. The decision tree model makes judgments on each node of the decision tree based on these input data and finally gives a predicted processing time.
[0154] Optionally, the server can also visualize the prediction results to help managers more intuitively understand the estimated time for each candidate to handle each task node.
[0155] S204: Obtain the historical processing quality sequence of the candidate processor.
[0156] The server generates a historical processing quality sequence of each candidate processor according to the historical processing quality of the candidate processor.
[0157] S205: Train a support vector machine model using the historical processing quality sequence to generate a trained support vector machine model.
[0158] The server can use the candidate processor's historical processing quality data as input features and the actual quality level as the target variable. By continuously adjusting the model parameters and optimizing the algorithm, the support vector machine model can learn the relationship between the input features and the target variable.
[0159] S206: Input the business requirement sequence of the task node and the historical processing quality sequence of the candidate processor into the trained support vector machine model to generate a predicted processing quality of the candidate processor in processing the task node.
[0160] The server inputs the business requirement sequence of the task node and the historical processing quality sequence of the candidate processor as input data into the trained support vector machine model. The support vector machine model finds an optimal hyperplane in the feature space based on these input data to divide different quality levels and gives a predicted processing quality result. This result will be saved in the server's memory or written to the database for use in subsequent steps.
[0161] S207: Determine the fitness characteristics of each candidate processor for processing each task node according to the predicted processing time and predicted processing quality of each candidate processor for processing each task node, and the current workload of the candidate processor.
[0162] The server can quantify the three factors of predicted processing time, predicted processing quality and current workload and assign different weights by using weighted average, hierarchical analysis method, etc. Then, the fitness score or ranking result of each candidate processor for each task node is calculated based on these weights and quantified values.
[0163] Specifically, this step may include:
[0164] S2071. Obtain a first weight corresponding to the predicted processing time and a second weight corresponding to the predicted processing quality.
[0165] The first weight is related to the time sensitivity of each of the task nodes, and the second weight is related to the quality requirement of each of the task nodes.
[0166] The server reads the weight values corresponding to the predicted processing time and predicted processing quality from the configuration file. These weight values are preset according to the time sensitivity and quality requirements of each task node. For example, for time-sensitive task nodes, such as emergency task processing, the first weight will be relatively high. For tasks with high quality requirements, the second weight will be larger. The server ensures that these weight values match the characteristics of the task nodes in order to accurately evaluate the fitness of candidate processors.
[0167] S2072. Generate a first scoring index by fusing and calculating the prediction processing time, the prediction processing quality, the first weight, and the second weight.
[0168] The first scoring indicator is used to characterize the first processing capability of each candidate processor in processing each task node.
[0169] The server can use the weighted average method to integrate the predicted processing time and the predicted processing quality according to their corresponding weights. For example, for a candidate processor, the predicted processing time is 8 hours and the predicted processing quality is 90% (assuming that the quality is expressed in percentage). If the time weight is 0.6 and the quality weight is 0.4, the first scoring indicator can be calculated as follows: First scoring indicator = (8 * 0.6) + (90 * 0.4) = 4.8 + 36 = 40.8. This first scoring indicator combines the processing time and processing quality to preliminarily evaluate the processing capabilities of the candidate processor.
[0170] S2073. Obtain workload information of each candidate processor.
[0171] The workload information includes at least one of the number of assigned task nodes, task node priority, and estimated completion time.
[0172] The server can retrieve the workload information of each candidate processor from the task management system. This information includes the number of assigned task nodes, the priority of the task nodes, and the expected completion time. For example, candidate processor A currently has 3 medium-priority tasks, which are expected to be completed in 2 days, 3 days, and 4 days respectively. Candidate processor B has 2 high-priority and 1 low-priority tasks, which are expected to be completed in 1 day, 2 days, and 5 days respectively.
[0173] S2074. Generate a load adjustment coefficient corresponding to each of the candidate processors according to the workload information.
[0174] The load adjustment coefficient is used to characterize the adaptability of each candidate processor to the new task node under the current load.
[0175] The server can calculate a load adjustment factor for each candidate processor based on the workload. This factor reflects the adaptability of the candidate processor to the new task node under the current load. For example, if the workload of candidate processor A is relatively light, its load adjustment factor may be close to 1. However, since candidate processor B has a high-priority task, its load adjustment factor may be slightly lower, such as 0.8, indicating that it may be affected to a certain extent when processing new tasks.
[0176] S2075. Adjust the first scoring index corresponding to each of the candidate processors by using the load adjustment coefficient corresponding to each of the candidate processors to generate a second scoring index.
[0177] The second scoring indicator is used to characterize the second processing capability of each of the candidate processors in processing each of the task nodes under the current load.
[0178] The server uses the load adjustment factor to modify the first score indicator to reflect the actual processing capacity of the candidate under the current workload. For example, if the first score indicator of candidate A is 40 and the load adjustment factor is 1, then its second score indicator remains 40. If the first score indicator of candidate B is 45, but the load adjustment factor is 0.8, then its second score indicator is adjusted to 45 * 0.8 = 36.
[0179] S2076: Generate a fitness matrix according to the second scoring indicator, each of the task nodes, and each of the candidate processors.
[0180] Among them, the fitness matrix represents the comprehensive ability of each candidate handler to handle each task node, the rows of the fitness matrix are each candidate handler, the columns of the fitness matrix are each task node, the values in the fitness matrix are the fitness characteristic values corresponding to each candidate handler and each task node, and the fitness characteristic values are related to the standardized results of the second scoring indicator.
[0181] S2077. Extract the fitness characteristics of each candidate processor for processing each task node through the fitness matrix.
[0182] The server extracts the fitness features of each candidate handler for each task node from the fitness matrix. These features can be used in the task allocation algorithm to help the server decide which task to assign to which candidate handler. For example, for a specific task node, the server can check the value of the corresponding column in the fitness matrix and select the candidate handler with the highest fitness feature value to undertake the task.
[0183] Specifically, step S2077 may include:
[0184] The overall fitness characteristics, task node specific fitness characteristics, and relative fitness characteristics of each candidate handler are extracted from the fitness matrix. The overall fitness characteristics represent the overall adaptability of each candidate handler to all task nodes, and the overall fitness characteristics are the average of all fitness characteristic values of each candidate handler. The task node specific fitness characteristics represent the adaptability of each candidate handler under each task node. The relative fitness characteristics represent the fitness ranking of each candidate handler under each task node.
[0185] The server can calculate the average of all fitness feature values of each candidate in the fitness matrix to obtain their overall fitness feature. This feature reflects the overall adaptability of the candidate to all task nodes. For example, suppose there are 5 task nodes and 3 candidate processors in the fitness matrix. The server will calculate the average of the fitness feature values of each candidate on the 5 task nodes. For example, the fitness feature values of candidate A are 80, 85, 90, 75, and 70, respectively, then A's overall fitness feature is the average of these values, which is 80.
[0186] The server extracts the fitness feature values of each candidate handler under each task node from the fitness matrix. These values are the task node-specific fitness features, which characterize the adaptability of each candidate handler on a specific task node. For example, for task node 1, the fitness feature values of candidate handlers A, B, and C may be 80, 75, and 78, respectively. These values are their specific fitness features on task node 1. The server performs this extraction operation for each task node.
[0187] The server ranks the candidate handlers under each task node according to the fitness characteristic value, and this ranking is their relative fitness characteristic. For example, on task node 2, if the fitness characteristic value of candidate handler A is the highest, B is the second, and C is the lowest, then their relative fitness characteristics are A>B>C. The server will generate such a ranking for each task node.
[0188] After the server extracts the overall fitness characteristics, task node specific fitness characteristics, and relative fitness characteristics of each candidate processor from the fitness matrix, the server comprehensively analyzes and determines the fitness characteristics of each candidate processor for processing each task node based on the overall fitness characteristics, the task node specific fitness characteristics, and the relative fitness characteristics.
[0189] For example, candidate handler A performs well overall and has good adaptability on multiple task nodes, especially performing best on task node 2. Candidate handler B performs well on certain specific task nodes, but his overall performance is slightly worse than A. Although candidate handler C performs generally well overall, he has advantages over other candidate handlers on certain task nodes. The server can determine the fitness characteristics of each candidate handler for handling each task node based on the above situation and actual needs, and allocate each task node based on the fitness characteristics.
[0190] The method provided in the embodiment of the present application, the server can comprehensively and accurately evaluate the adaptability of each candidate handler to different task nodes. First, by calculating the overall fitness characteristics, the server can quickly identify those candidate handlers who have strong adaptability to all task nodes, which helps to give priority to these comprehensive and efficient executors when assigning tasks. Secondly, the extraction of task node specific fitness characteristics enables the server to match the most suitable candidate handler for the characteristics and requirements of each specific task node, thereby improving the accuracy and efficiency of task execution. Furthermore, the analysis of relative fitness characteristics not only reveals the relative advantages of each candidate handler on the same task node, but also provides a basis for selection when facing multiple suitable candidates for the server, further optimizing resource allocation.
[0191] In a possible implementation manner, the method may further include the following content. Figure 3 A flowchart of another workflow task allocation method provided in an embodiment of the present application is shown below. Figure 3 As shown, the method may also include:
[0192] S301. After the processor completes processing the task node, obtain the processing time information and processing quality information of the processor processing the task node.
[0193] After the task node is completed, the server will automatically collect the processing time information and processing quality information of the task node processed by the processor of the task node.
[0194] For example, when a design review task node is completed by Engineer A, the server will record the time Engineer A took to complete the task (for example, 3 days) and the processing quality (for example, the score obtained through professional review is 90 points).
[0195] S302: Update the historical processing data of the processor according to the processing time information and the processing quality information, and predict the future capability trend of the processor through time series analysis.
[0196] After obtaining the processing time information and processing quality information, the server will add these data to the historical processing data of engineer A. The historical processing data may include the time and quality records of engineer A's past processing of similar tasks.
[0197] The server then uses time series analysis techniques, such as the ARIMA model, to predict the performance trends that Engineer A may demonstrate when handling similar tasks in the future. For example, based on historical data, the server predicts that the time required for Engineer A to handle design review tasks in the future may gradually decrease, while the processing quality may remain stable or slightly improve.
[0198] S303: Update the processing time information, the processing quality information, and the future capability trend of the processor into the processor capability model to update and optimize the processor capability model.
[0199] The server integrates the newly collected processing time information, processing quality information, and predicted future capacity trend data into the previously trained processor capacity model, and retrains the model to optimize the model's prediction accuracy so that it better reflects the processor's current and future capacity status. For example, after being updated and optimized, the model may more accurately predict Engineer A's performance on the design review task, thereby providing a more reliable basis for subsequent task allocation.
[0200] The method provided in the embodiment of the present application obtains the processing time information and processing quality information of the processing person for processing the task node after the processing person completes the processing of the task node, updates the historical processing data of the processing person according to the processing time information and the processing quality information, and predicts the future capability trend of the processing person through time series analysis, and updates the processing time information, the processing quality information, and the future capability trend of the processing person into the processing person capability model to update and optimize the processing person capability model. Thus, the processing person capability model is continuously updated, and the accuracy of the processing person capability model in evaluating the actual work efficiency of the processing person and the quality of task completion is improved.
[0201] Figure 4 The structure diagram of an electronic device provided in an embodiment of the present application is shown in FIG. The electronic device is used to execute the aforementioned workflow task allocation method, and may be, for example, the aforementioned server. Figure 4 As shown, the electronic device 400 may include: at least one processor 401 , a memory 402 , and a communication interface 403 .
[0202] The memory 402 is used to store programs. Specifically, the programs may include program codes, and the program codes include computer operation instructions.
[0203] The memory 402 may include a high-speed RAM memory, and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory.
[0204] The processor 401 is used to execute the computer-executable instructions stored in the memory 402 to implement the method described in the above method embodiment. The processor 401 may be a CPU, or an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application.
[0205] The processor 401 can communicate and interact with an external device through the communication interface 403. The external device can be, for example, the electronic device of the processor mentioned above. In a specific implementation, if the communication interface 403, the memory 402 and the processor 401 are implemented independently, the communication interface 403, the memory 402 and the processor 401 can be connected to each other through a bus and communicate with each other. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc., but it does not mean that there is only one bus or one type of bus.
[0206] Optionally, in a specific implementation, if the communication interface 403, the memory 402 and the processor 401 are integrated on a chip, the communication interface 403, the memory 402 and the processor 401 can communicate through an internal interface.
[0207] The present application also provides a computer-readable storage medium, which may include: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, and other media that can store program codes. Specifically, the computer-readable storage medium stores program instructions, and the program instructions are used for the methods in the above embodiments.
[0208] The present application also provides a program product, which includes an execution instruction stored in a readable storage medium. At least one processor of a computing device can read the execution instruction from the readable storage medium, and at least one processor executes the execution instruction so that the computing device implements the above-mentioned workflow task allocation method.
[0209] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the above embodiments, a person of ordinary skill in the art should understand that the technical solutions described in the above embodiments can still be modified, or some or all of the technical features can be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.
Claims
1. A workflow task allocation method, characterized in that: The method comprises: Obtaining a process request, wherein the process corresponding to the process request includes at least one task node, the process request includes a task node handler assignment rule, and the task node handler assignment rule includes post-assigning a task node handler; If the task node processor assignment rule is the post-assignment task node processor, then according to the task node processor assignment rule included in the process request, determine the processor who processes the task node, the task node processor assignment rule includes assignment according to the user and assignment according to the user group, the user group includes a role group and / or a department group, and the roles included in the role group are related to the user's position, and / or the user's function, and / or the department to which the user belongs; If the task node processor allocation rule is allocation based on user groups, determining the processor for processing the task node based on the task node processor allocation rule included in the process request includes: Acquire user group information corresponding to the task node from the process request, where the user group includes a role group and / or a department group; According to the user group information, obtaining users included in the user group; Determine the minimum permissions required to process the task node; Parsing the process request, extracting a business requirement sequence of each task node in the process request, wherein the business requirement sequence includes importance requirement, complexity requirement, processing time requirement, and skill requirement of the task node; Determine the capability sequence of users included in the user group through a trained handler capability model, wherein the capability sequence includes the user's skill capability, efficiency capability, historical task completion capability, and load capability, and the handler capability model is obtained through training based on the user's historical data; Calculating the correlation between the business requirement sequence and the capability sequence of users included in the user group through correlation analysis, and determining candidate handlers whose correlation with the business requirement sequence is higher than a preset correlation threshold; Acquire a to-be-processed task node including the task node, and an initial allocation set, wherein the to-be-processed task node is a task node to be allocated to the candidate processor for processing, and each element in the initial allocation set represents each allocation strategy for allocating the task node to the candidate processor; Acquire the historical processing data of the task node and the historical processing data of the candidate handler; the historical processing data of the task node includes the capability sequence of the handler who has historically processed the task node and the historical processing time sequence of the task node; the historical processing data of the candidate handler includes the business requirement sequence of the candidate handler's historical processing of the task node and the historical processing time sequence of the candidate handler's historical processing of the task node; Training a decision tree model by using the historical processing data of the task node and the historical processing data of the candidate processor to generate a trained decision tree model; Inputting the business requirement sequence of the task node and the capability sequence of the candidate processors into the trained decision tree model to generate a predicted processing time for the candidate processors to process the task node; Obtaining a historical processing quality sequence of the candidate processor; Training a support vector machine model by using the historical processing quality sequence to generate a trained support vector machine model; Inputting the business requirement sequence of the task node and the historical processing quality sequence of the candidate processor into the trained support vector machine model to generate the predicted processing quality of the task node processed by the candidate processor; Determine the fitness characteristics of each candidate processor for processing each task node according to the predicted processing time and predicted processing quality of each candidate processor for processing each task node, and the current workload of the candidate processor; the fitness characteristics include the predicted processing time and predicted processing quality of each candidate processor for processing each task node, and the current workload of the candidate processor; According to each of the fitness features, a fitness value of the initial allocation set is calculated by a fitness function, wherein the fitness value represents the pros and cons of the allocation strategy corresponding to the initial allocation set; The initial allocation set is updated according to a preset rule, and a fitness value corresponding to the updated initial allocation set is iteratively calculated until the fitness value reaches a preset fitness threshold; Determining a processor for processing the task node from among the candidate processors according to an allocation strategy in a target allocation set whose fitness value reaches a preset fitness threshold; Allocating the task node to the terminal device of the processor for processing; The step of determining the fitness characteristics of each candidate processor for processing each task node according to the predicted processing time and predicted processing quality of each candidate processor for processing each task node and the current workload of the candidate processor includes: Obtaining a first weight corresponding to the predicted processing time and a second weight corresponding to the predicted processing quality, wherein the first weight is related to the time sensitivity of each of the task nodes, and the second weight is related to the quality requirement of each of the task nodes; A first scoring indicator is generated by fusion calculation according to the predicted processing time, the predicted processing quality, the first weight, and the second weight, where the first scoring indicator is used to characterize a first processing capability of each of the candidate processors to process each of the task nodes; Acquire workload information of each candidate processor, wherein the workload information includes at least one of the number of assigned task nodes, task node priority, and estimated completion time; Generating a load adjustment coefficient corresponding to each of the candidate processors according to the workload information, wherein the load adjustment coefficient is used to characterize the adaptability of each of the candidate processors to the new task node under the current load; The first scoring index corresponding to each of the candidate processors is adjusted by the load adjustment coefficient corresponding to each of the candidate processors to generate a second scoring index, where the second scoring index is used to characterize the second processing capability of each of the candidate processors in processing each of the task nodes under the current load; Generate a fitness matrix according to the second scoring indicator, each of the task nodes, and each of the candidate handlers, wherein the fitness matrix represents the comprehensive ability of each of the candidate handlers to handle each of the task nodes, the rows of the fitness matrix are each of the candidate handlers, the columns of the fitness matrix are each of the task nodes, the values in the fitness matrix are fitness characteristic values corresponding to each of the candidate handlers and each of the task nodes, and the fitness characteristic values are related to the standardized result of the second scoring indicator; Extracting fitness features of each candidate processor for processing each task node through the fitness matrix; The step of extracting the fitness characteristics of each candidate processor for processing each task node through the fitness matrix includes: Extracting the overall fitness characteristics, task node specific fitness characteristics, and relative fitness characteristics of each candidate handler from the fitness matrix, wherein the overall fitness characteristics represent the overall adaptability of each candidate handler to all task nodes, and the overall fitness characteristics are the average value of all fitness characteristic values of each candidate handler; the task node specific fitness characteristics represent the adaptability of each candidate handler under each task node; and the relative fitness characteristics represent the fitness ranking of each candidate handler under each task node; Based on the overall fitness characteristics, the task node specific fitness characteristics, and the relative fitness characteristics, a comprehensive analysis is performed to determine the fitness characteristics of each candidate processor for processing each task node.
2. The method according to claim 1, characterized in that: The method further comprises: If the role is related to the department to which the user belongs, and there is no user corresponding to the role in the department, query the first target user corresponding to the role in the user group corresponding to the superior department of the department; If there is a first target user corresponding to the role in the user group corresponding to the superior department of the department, the first target user is determined as a processor for processing the task node; If there is no first target user corresponding to the role in the user groups corresponding to the superior departments of the department, the first administrator user is determined as the person who handles the task node; or, the second target user indicated by the first administrator user is determined as the person who handles the task node.
3. The method according to claim 1 or 2, characterized in that: The method further comprises: After the processor completes processing the task node, obtaining processing time information and processing quality information of the processor processing the task node; According to the processing time information and the processing quality information, the historical processing data of the processor is updated, and the future capability trend of the processor is predicted through time series analysis; The processing time information, the processing quality information, and the future capability trend of the processor are updated into the processor capability model to update and optimize the processor capability model.
4. An electronic device, characterized in that: include: A processor, a communication interface and a memory, wherein the processor is communicatively connected to the communication interface and the memory respectively; The memory stores computer-executable instructions; The communication interface communicates and interacts with external devices; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 3.
5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 3 when executed by a processor.
6. A computer program product, characterized in that The invention comprises a computer program, which implements the method according to any one of claims 1 to 3 when being executed by a processor.
Citation Information
Patent Citations
Free node transfer processing method for intelligent power grid dispatching
CN103700026A
Work flow creating method and system, and business system
CN106897806A
Task distribution method and device
CN107767007A
Workflow implementation method, device and system
CN115048103A
Task allocation method and device, storage medium and electronic equipment
CN116307575A
