Task allocation method and device, computer equipment and storage medium
By predicting the workload of the task execution queue and matching the adaptability of the tasks to be allocated, the target task execution queue is determined, which solves the problem of unbalanced task allocation and improves task execution efficiency.
Patent Information
- Application Number
- CN202411427585.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-12
- Publication Date
- 2025-02-11
AI Technical Summary
In the workflow link of the BPM platform, uneven task allocation leads to inefficient overall task execution. The existing methods only allocate based on the number of tasks, ignoring the difference in the time required for task execution.
By obtaining the on-the-go task information of the task execution queue corresponding to the current work item, predicting the workload of each task execution queue, and determining the target task execution queue for receiving the task to be allocated based on the adaptability of the information of the task to be allocated and the task execution queue, the target task execution queue for receiving the task to be allocated is determined based on the adaptability of the information of the task to be allocated and the task execution queue. .
It improves the rationality and balance of task allocation, ensures that tasks are assigned to the appropriate task execution queue, thereby improving the overall task execution efficiency.
Smart Images
Figure CN119417098A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of process monitoring, and in particular to a task allocation method, device, computer equipment and storage medium. Background Art
[0002] BPM (Business Process Management) platforms are widely used in finance, telecommunications, manufacturing, logistics and other fields. They can manage workflows, automate the flow of tasks, and ensure that tasks are completed in a certain order and according to certain rules. Through these functions, enterprises can better understand and control their internal and external processes, reduce errors in manual operations, and improve overall work efficiency and customer satisfaction. In a workflow link, there are usually multiple users responsible for execution. Some users may have a large number of existing tasks, but all of their tasks are close to completion; other users may have a small number of tasks, but they take more time to execute tasks. Therefore, allocating tasks based only on the number of tasks is likely to lead to unbalanced task allocation and reduce the overall efficiency of task execution. A more reasonable task allocation method is urgently needed. Summary of the invention
[0003] The main purpose of this application is to provide a task allocation method, device, equipment and computer storage medium, aiming to improve the rationality of task allocation.
[0004] In a first aspect, the present application provides a task allocation method, the task allocation method comprising the following steps:
[0005] Obtaining in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predicting the workload of each task execution queue according to the in-transit task information;
[0006] Obtaining a task assignment request for a task to be assigned, wherein the task assignment request at least includes information about the task to be assigned;
[0007] According to the information of the task to be assigned, the task is matched with each of the task execution queues to determine the degree of compatibility between the task to be assigned and each of the task execution queues;
[0008] A target task execution queue for receiving the task to be assigned is determined according to the workload of each task execution queue and the adaptability.
[0009] In a second aspect, the present application further provides a task allocation device, the task allocation device comprising:
[0010] A workload prediction module is used to obtain in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predict the workload of each task execution queue according to the in-transit task information;
[0011] A task acquisition module, used to acquire a task allocation request for a task to be allocated, wherein the task allocation request at least includes information about the task to be allocated;
[0012] A queue matching module, used for matching the to-be-assigned task information with each of the task execution queues to determine the degree of compatibility between the to-be-assigned task and each of the task execution queues;
[0013] The task allocation module is used to determine a target task execution queue to receive the task to be allocated according to the workload of each task execution queue and the adaptability.
[0014] In a third aspect, the present application also provides a computer device, comprising a processor, a memory, and a computer program stored in the memory and executable by the processor, wherein when the computer program is executed by the processor, the task allocation method as described above is implemented.
[0015] In a fourth aspect, the present application further provides a computer-readable storage medium, on which a computer program is stored, wherein when the computer program is executed by a processor, the task allocation method as described above is implemented.
[0016] The present application provides a task allocation method, device, equipment and computer storage medium. The present application obtains the in-transit task information of the in-transit tasks in each task execution queue corresponding to the current work item, and predicts the workload of each task execution queue according to the in-transit task information; obtains the task allocation request of the task to be allocated, and the task allocation request at least includes the task information to be allocated; matches the task information to be allocated with each task execution queue to determine the degree of fit between the task to be allocated and each task execution queue; and determines the target task execution queue that receives the task to be allocated according to the workload and the degree of fit of each task execution queue. Since the target task execution queue that receives the task to be allocated is determined according to the degree of fit between the task to be allocated and the task execution queue and the workload of each task execution queue, the rationality of task allocation is improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0018] Figure 1 A flowchart of a task allocation method provided in one embodiment of the present application;
[0019] Figure 2 A usage scenario diagram of a task allocation method provided in one embodiment of the present application;
[0020] Figure 3 A schematic block diagram of a task allocation device provided in one embodiment of the present application;
[0021] Figure 4 The present invention is a block diagram showing the structure of a computer device according to an embodiment of the present application. DETAILED DESCRIPTION
[0022] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0023] The flowcharts shown in the accompanying drawings are only examples and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may also be decomposed, combined or partially merged, so the actual execution order may change according to actual conditions.
[0024] Embodiments of the present application provide a task allocation method, apparatus, computer equipment, and computer-readable storage medium.
[0025] In conjunction with the accompanying drawings, some embodiments of the present application are described in detail below. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.
[0026] Please refer to Figure 1 , Figure 1 A flow chart of a task allocation method provided for an embodiment of the present application. The task allocation method can be used in a terminal or a server to determine a target task execution queue for a task to be assigned. The terminal can be an electronic device such as a mobile phone, a tablet computer, a laptop computer, a desktop computer, a personal digital assistant, and a wearable device; the server can be an independent server, or a server cluster, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDN), and big data and artificial intelligence platforms.
[0027] Please refer to Figure 2 , Figure 2 This is a usage scenario diagram provided by an embodiment of the present application. Figure 2 As shown, the tasks to be assigned are transferred in the workflow. Assuming that work item N is the current work column, corresponding to multiple task execution queues processed by multiple users, the task assignment method provided in the embodiment of the present solution is used to determine the target task queue receiving the tasks to be assigned according to the workload and fitness, thereby improving the rationality and balance of task assignment. The number of work items and task execution queues is not limited here.
[0028] like Figure 1 As shown, the task allocation method includes steps S101 to S104.
[0029] Step S101: Obtain in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predict the workload of each task execution queue according to the in-transit task information.
[0030] Exemplarily, this solution is applied to the workflow of the BPM platform. Workflow refers to the process of transferring documents, information or tasks between participants according to predefined rules and processes in a business environment. The BPM platform can define, create and manage the execution of workflows.
[0031] Exemplarily, in order to achieve reasonable distribution of tasks, the in-transit tasks of each task execution queue are quantified by workload, where in-transit tasks refer to unfinished tasks assigned to the task execution queue. Each task execution queue corresponds to a user, who is the executor of the in-transit tasks in the workflow. The user can view, process, and update the in-transit tasks in the task execution queue through a terminal device.
[0032] In some implementations, the obtaining of in-transit task information of each task execution queue corresponding to the current work item and predicting the workload of each task execution queue according to the in-transit task information includes:
[0033] Acquire in-transit task information of the task execution queue, wherein the in-transit task information includes a current task node and in-transit task attributes of the in-transit task;
[0034] Based on a preset workload prediction model, the workload of each of the task execution queues is predicted according to the current task node and the attributes of the in-transit tasks.
[0035] Exemplarily, each in-transit task corresponds to its own current task node, which is used to identify the current processing status of the in-transit task. Taking the vehicle claims task as an example, the current task node may include on-site inspection, liability determination, confirmation of vehicle status, loss assessment, repair quotation assessment, verification of relevant documents, compensation, etc. that the user needs to perform. The current task node where the in-transit task is located can be used to evaluate which nodes need to be transferred to complete the task. Therefore, the workload of the in-transit task can be determined based on the current task node.
[0036] For example, the attributes of in-transit tasks are also related to the workload of in-transit tasks. Some types of in-transit tasks themselves have a large workload. Taking vehicle claims tasks as an example, tasks with large amounts, serious damage, and remote locations require the processor to spend more time and energy than ordinary tasks, and therefore correspond to a greater workload.
[0037] In some implementations, the workload of each of the task execution queues is predicted based on the preset workload prediction model according to the current task node and the in-transit task attributes, including:
[0038] According to the current task node and the attributes of the in-transit tasks, predicting the nodes passed by each of the in-transit tasks;
[0039] The workload of the task execution queue is determined according to the node workload corresponding to each of the passing nodes.
[0040] Exemplarily, the passing nodes represent the nodes that need to be passed through to complete the in-transit task. Specifically, all preset task nodes corresponding to the in-transit task can be obtained first, and the preset task nodes can be traversed according to the historical task nodes that the in-transit task has passed through to obtain the passing nodes that the in-transit task needs to pass through.
[0041] Exemplarily, the node workload corresponding to each preset task node can be pre-set to quantify the difficulty of completing the node. The numerical value corresponding to each node workload can be determined according to actual needs and is not limited here.
[0042] It is understandable that tasks that are difficult to complete usually have certain commonalities, and the workload prediction model can also be obtained by training based on historical task information based on a machine learning model, and is used to quantify the node workload of the in-transit task according to the input in-transit task attributes. Specifically, the task duration taken from the start to the completion of a historical task can be quantified as the workload required to complete the historical task, and the workload can be predicted based on the historical task attributes of the historical task, thereby training the workload prediction model. Specifically, in order to improve the accuracy of the task duration, the task duration is calculated from the time when the node of the historical task changes, rather than from the time when the historical task is assigned to the task execution queue, to avoid calculating the time waiting for the user to start executing the historical task into the task duration.
[0043] Exemplarily, the workload of the in-transit tasks is determined according to the sum of the workloads of each node, and the workload of the task execution queue is determined according to the sum of the workloads of each in-transit task.
[0044] In some implementations, the obtaining of in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item further includes:
[0045] Calculating the task relevance between the task to be assigned and the historical tasks;
[0046] When the task relevance is greater than a preset relevance threshold, the target task execution queue of the task to be assigned is determined as the task execution queue corresponding to the historical task.
[0047] For example, in order to improve the service quality of completing the assigned tasks, related tasks need to be assigned to the same task execution queue for processing. For example, the claim applications submitted by the same applicant are assigned to the same person for processing, so as to avoid repeated communication, improve work efficiency, and reduce the potential possibility of insurance fraud.
[0048] Exemplarily, the task relevance between the task to be assigned and each historical task is calculated, wherein the task relevance can be determined by matching task applicants, the same task applicant or task applicants who may have a kinship relationship have a higher task relevance, and tasks with a larger task relevance are assigned to the same task execution queue.
[0049] Step S102: Obtain a task assignment request for a task to be assigned, wherein the task assignment request at least includes information about the task to be assigned.
[0050] For example, the task to be assigned may be a claim application submitted by a user, but it is not limited thereto and may also be other types of applications. The information of the task to be assigned includes information related to the task, such as the applicant's personal information, information related to the task situation, etc., which is used to evaluate the task to be assigned during the task assignment process and also used for the execution of the task.
[0051] Step S103: matching the to-be-assigned task information with each of the task execution queues to determine the degree of compatibility between the to-be-assigned task and each of the task execution queues.
[0052] Exemplarily, the degree of compatibility between the task to be assigned and each task execution queue can be determined according to the method based on which the task assignment is based in the relevant technology, which is not limited here. For example, if the task information to be assigned includes the task execution location, the degree of compatibility can be determined according to the distance between the location of the user corresponding to each task execution queue and the task execution location; or if the task information to be assigned includes the nature of the task, the degree of compatibility can be determined according to the task type of the user deletion processing corresponding to each task execution queue.
[0053] Step S104: determining a target task execution queue for receiving the task to be assigned according to the workload of each task execution queue and the adaptability.
[0054] Illustratively, the task allocation method provided in the embodiment of the present application considers the workload of each task execution queue on the basis of adaptability, and allocates the tasks to be allocated to the task execution queue with less workload as much as possible, thereby improving the rationality and balance of task allocation.
[0055] In some implementations, determining a target task execution queue for receiving the task to be assigned according to the workload of each task execution queue and the degree of adaptability includes:
[0056] Determining a queue score of each of the task execution queues according to the workload of each of the task execution queues and the degree of adaptability;
[0057] Determine a candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of tasks in transit;
[0058] In response to the selection operation of each of the candidate task queues for the task to be assigned, the target task execution queue is determined from the candidate task queues.
[0059] Exemplarily, the queue score may be a weighted sum of the workload and the fitness, wherein since the workload is negatively correlated with the queue score, a weight less than 0 may be set for the workload.
[0060] Exemplarily, in order to ensure task execution efficiency, when the number of in-transit tasks in a task execution queue is greater than a certain in-transit task number threshold, no tasks will be assigned to the task execution queue to avoid a large accumulation of in-transit tasks in the target task queue.
[0061] Exemplarily, at least one candidate task queue can be screened out, and the task to be assigned will be displayed to at least one candidate task queue. When the user chooses to receive the task to be assigned, the task execution queue corresponding to the user will be determined as the target task queue, so that the user has a certain degree of autonomy when receiving the task, and a two-way selection of the task to be assigned and the task execution queue is realized, thereby improving the rationality of task allocation.
[0062] In some implementations, determining a candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of in-transit tasks includes:
[0063] The task execution queue whose queue score is greater than the preset score and whose number of in-transit tasks is less than the in-transit task number threshold is determined as the candidate task queue.
[0064] Exemplarily, among the task execution queues whose queue scores are greater than a preset score, the task execution queues whose number of in-transit tasks is less than a threshold value of the number of in-transit tasks are filtered based on the number of in-transit tasks, thereby obtaining the task execution queues whose queue scores are greater than the preset score and whose number of in-transit tasks is less than the threshold value of the number of in-transit tasks as candidate task execution queues.
[0065] In some embodiments, the method further comprises:
[0066] Obtaining a preset process definition file, wherein the process definition file includes sequence flow information and work item information;
[0067] Deploy the workflow according to the sequence flow information and the work item information to obtain the current work item;
[0068] The task execution queue is established for at least one execution terminal corresponding to the current work item.
[0069] Exemplarily, the current work item is a process item in the workflow, that is, the users corresponding to the various task execution queues of the current work item process the tasks and determine the flow direction of the tasks in the workflow, such as whether they need to be submitted to the next work item for review or returned to the previous work item for review. The workflow is established based on the process definition file, which sets the work items and sequence flows in the workflow. The work item represents the process item that needs to be processed by the user, and the sequence flow is used to represent the possible flow direction of the task.
[0070] Exemplarily, a workflow is deployed based on sequence flow information and work item information. The workflow includes multiple work items, each work item corresponds to at least one task execution queue, and each task execution queue corresponds to a user who executes the task. Of course, it is not limited to this and is not limited here.
[0071] The task allocation method provided in the above embodiment obtains the in-transit task information of the in-transit tasks in each task execution queue corresponding to the current work item, and predicts the workload of each task execution queue according to the in-transit task information; obtains the task allocation request of the task to be allocated, and the task allocation request at least includes the task information to be allocated; matches the task information to be allocated with each task execution queue to determine the degree of fit between the task to be allocated and each task execution queue; and determines the target task execution queue to receive the task to be allocated according to the workload and the degree of fit between each task execution queue. The target task execution queue to receive the task to be allocated can be determined according to the degree of fit between the task to be allocated and the task execution queue and the workload of each task execution queue, thereby improving the rationality of task allocation.
[0072] See also Figure 3 , Figure 3 It is a schematic diagram of a task allocation device provided in an embodiment of the present application. The task allocation device can be configured in a server or a terminal to execute the aforementioned task allocation method.
[0073] like Figure 3 As shown, the task allocation device includes: a workload prediction module 110 , a task acquisition module 120 , a queue matching module 130 , and a task allocation module 140 .
[0074] The workload prediction module 110 is used to obtain in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predict the workload of each task execution queue according to the in-transit task information;
[0075] A task acquisition module 120, configured to acquire a task allocation request of a task to be allocated, wherein the task allocation request at least includes information of the task to be allocated;
[0076] The queue matching module 130 is used to match the task to be assigned with each of the task execution queues according to the task information to be assigned, and determine the degree of compatibility between the task to be assigned and each of the task execution queues;
[0077] The task allocation module 140 is used to determine a target task execution queue to receive the task to be allocated according to the workload of each task execution queue and the adaptability.
[0078] In some implementations, the workload prediction module 110, in the process of obtaining the in-transit task information of each task execution queue corresponding to the current work item and predicting the workload of each task execution queue according to the in-transit task information, is used to:
[0079] Acquire in-transit task information of the task execution queue, wherein the in-transit task information includes a current task node and in-transit task attributes of the in-transit task;
[0080] Based on a preset workload prediction model, the workload of each of the task execution queues is predicted according to the current task node and the attributes of the in-transit tasks.
[0081] In some implementations, the workload prediction module 110, in the process of predicting the workload of each of the task execution queues based on the preset workload prediction model and according to the current task node and the in-transit task attributes, is used to:
[0082] According to the current task node and the attributes of the in-transit tasks, predicting the nodes passed by each of the in-transit tasks;
[0083] The workload of the task execution queue is determined according to the node workload corresponding to each of the passing nodes.
[0084] In some implementations, the task assignment module 140, in the process of determining the target task execution queue for receiving the task to be assigned according to the workload of each task execution queue and the degree of adaptability, is configured to:
[0085] Determining a queue score of each of the task execution queues according to the workload of each of the task execution queues and the degree of adaptability;
[0086] Determine a candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of tasks in transit;
[0087] In response to the selection operation of each of the candidate task queues for the task to be assigned, the target task execution queue is determined from the candidate task queues.
[0088] In some implementations, the task assignment module 140, in the process of determining the candidate task queue from the task execution queue according to the queue score and the preset threshold of the number of in-transit tasks, is configured to:
[0089] The task execution queue whose queue score is greater than the preset score and whose number of in-transit tasks is less than the in-transit task number threshold is determined as the candidate task queue.
[0090] In some implementations, the workload prediction module 110, in the process of obtaining the in-transit task information of the in-transit tasks in each task execution queue corresponding to the current work item, is used to:
[0091] Calculating the task relevance between the task to be assigned and the historical tasks;
[0092] When the task relevance is greater than a preset relevance threshold, the target task execution queue of the task to be assigned is determined as the task execution queue corresponding to the historical task.
[0093] In some implementations, the task allocation device is further configured to:
[0094] Obtaining a preset process definition file, wherein the process definition file includes sequence flow information and work item information;
[0095] Deploy the workflow according to the sequence flow information and the work item information to obtain the current work item;
[0096] The task execution queue is established for at least one execution terminal corresponding to the current work item.
[0097] It should be noted that those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described devices and modules and units can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0098] The method and apparatus of the present application can be used in many general or special computing system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.
[0099] Exemplarily, the above method and apparatus may be implemented in the form of a computer program. The computer program may be implemented in Figure 4 Runs on the computer device shown.
[0100] See also Figure 4 , Figure 4 A schematic block diagram of the structure of a computer device provided in an embodiment of the present application. The computer device may be a server or a terminal.
[0101] like Figure 4 As shown, the computer device includes a processor, a memory, and a network interface connected via a system bus, wherein the memory may include a storage medium and an internal memory.
[0102] The storage medium can store an operating system and a computer program. The computer program includes program instructions, and when the program instructions are executed, the processor can execute any task allocation method.
[0103] The processor is used to provide computing and control capabilities and support the operation of the entire computer equipment.
[0104] The internal memory provides an environment for the operation of the computer program in the storage medium. When the computer program is executed by the processor, the processor can execute any task allocation method.
[0105] The network interface is used for network communication, such as sending assigned tasks, etc. Those skilled in the art will understand that Figure 4 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0106] It should be understood that the processor may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
[0107] In one embodiment, the processor is used to run a computer program stored in the memory to implement the following steps:
[0108] Obtaining in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predicting the workload of each task execution queue according to the in-transit task information;
[0109] Obtaining a task assignment request for a task to be assigned, wherein the task assignment request at least includes information about the task to be assigned;
[0110] According to the information of the task to be assigned, the task is matched with each of the task execution queues to determine the degree of compatibility between the task to be assigned and each of the task execution queues;
[0111] A target task execution queue for receiving the task to be assigned is determined according to the workload of each task execution queue and the adaptability.
[0112] In some implementations, the processor, in the process of obtaining in-transit task information of each task execution queue corresponding to the current work item and predicting the workload of each task execution queue according to the in-transit task information, is used to implement:
[0113] Acquire in-transit task information of the task execution queue, wherein the in-transit task information includes a current task node and in-transit task attributes of the in-transit task;
[0114] Based on a preset workload prediction model, the workload of each of the task execution queues is predicted according to the current task node and the attributes of the in-transit tasks.
[0115] In some implementations, the processor, in the process of implementing a preset workload prediction model and predicting the workload of each of the task execution queues according to the current task node and the in-transit task attributes, is used to implement:
[0116] According to the current task node and the attributes of the in-transit tasks, predicting the nodes passed by each of the in-transit tasks;
[0117] The workload of the task execution queue is determined according to the node workload corresponding to each of the passing nodes.
[0118] In some implementations, the processor, in the process of determining the target task execution queue for receiving the task to be assigned according to the workload of each task execution queue and the degree of adaptability, is configured to implement:
[0119] Determining a queue score of each of the task execution queues according to the workload of each of the task execution queues and the degree of adaptability;
[0120] Determine a candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of in-transit tasks;
[0121] In response to the selection operation of each of the candidate task queues for the task to be assigned, the target task execution queue is determined from the candidate task queues.
[0122] In some implementations, the processor, in the process of determining the candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of in-transit tasks, is configured to implement:
[0123] The task execution queue whose queue score is greater than the preset score and whose number of in-transit tasks is less than the in-transit task number threshold is determined as the candidate task queue.
[0124] In some implementations, the processor, in the process of obtaining the in-transit task information of the in-transit tasks in each task execution queue corresponding to the current work item, is used to implement:
[0125] Calculating the task relevance between the task to be assigned and the historical tasks;
[0126] When the task relevance is greater than a preset relevance threshold, the target task execution queue of the task to be assigned is determined as the task execution queue corresponding to the historical task.
[0127] In some implementations, the processor, in the process of implementing the task allocation method, is further configured to implement:
[0128] Obtaining a preset process definition file, wherein the process definition file includes sequence flow information and work item information;
[0129] Deploy the workflow according to the sequence flow information and the work item information to obtain the current work item;
[0130] The task execution queue is established for at least one execution terminal corresponding to the current work item.
[0131] It should be noted that those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the task allocation described above can refer to the corresponding process in the aforementioned task allocation control method embodiment, and will not be repeated here.
[0132] An embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored. The computer program includes program instructions. The method implemented when the program instructions are executed can refer to the various embodiments of the task allocation method of the present application.
[0133] The computer-readable storage medium may be an internal storage unit of the computer device described in the foregoing embodiment, such as a hard disk or memory of the computer device. The computer-readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a smart memory card (SmartMedia Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc., equipped on the computer device.
[0134] It should be understood that the terms used in this application specification are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in this application specification and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.
[0135] It should also be understood that the term "and / or" used in the specification of this application and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, including these combinations. It should be noted that, in this article, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "including a..." does not exclude the presence of other identical elements in the process, method, article or system including the element.
[0136] The serial numbers of the embodiments of the present application are for description only and do not represent the advantages and disadvantages of the embodiments. The above description is only a specific implementation mode of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed in the present application, and these modifications or replacements should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.
Claims
1. A task allocation method, characterized in that: The method comprises: Obtaining in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predicting the workload of each task execution queue according to the in-transit task information; Obtaining a task assignment request for a task to be assigned, wherein the task assignment request at least includes information about the task to be assigned; According to the information of the task to be assigned, the task is matched with each of the task execution queues to determine the degree of compatibility between the task to be assigned and each of the task execution queues; A target task execution queue for receiving the task to be assigned is determined according to the workload of each task execution queue and the adaptability.
2. The task allocation method according to claim 1, characterized in that: The obtaining of in-transit task information of each task execution queue corresponding to the current work item and predicting the workload of each task execution queue according to the in-transit task information includes: Acquire in-transit task information of the task execution queue, wherein the in-transit task information includes a current task node and in-transit task attributes of the in-transit task; Based on a preset workload prediction model, the workload of each of the task execution queues is predicted according to the current task node and the attributes of the in-transit tasks.
3. The task allocation method according to claim 2, characterized in that: The workload of each of the task execution queues is predicted based on the preset workload prediction model according to the current task node and the in-transit task attributes, including: According to the current task node and the attributes of the in-transit tasks, predicting the nodes passed by each of the in-transit tasks; The workload of the task execution queue is determined according to the node workload corresponding to each of the passing nodes.
4. The task allocation method according to claim 1, characterized in that: The step of determining a target task execution queue for receiving the task to be assigned according to the workload of each task execution queue and the degree of adaptability comprises: Determining a queue score of each of the task execution queues according to the workload of each of the task execution queues and the degree of adaptability; Determine a candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of in-transit tasks; In response to the selection operation of each of the candidate task queues for the task to be assigned, the target task execution queue is determined from the candidate task queues.
5. The task allocation method according to claim 4, characterized in that: Determining a candidate task queue from the task execution queue according to the queue score and a preset threshold value of the number of in-transit tasks includes: The task execution queue whose queue score is greater than the preset score and whose number of in-transit tasks is less than the in-transit task number threshold is determined as the candidate task queue.
6. The task allocation method according to claim 1, characterized in that: The step of obtaining in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item further includes: Calculating the task relevance between the task to be assigned and the historical tasks; When the task relevance is greater than a preset relevance threshold, the target task execution queue of the task to be assigned is determined as the task execution queue corresponding to the historical task.
7. The task allocation method according to any one of claims 1 to 6, characterized in that: The method further comprises: Obtaining a preset process definition file, wherein the process definition file includes sequence flow information and work item information; Deploy the workflow according to the sequence flow information and the work item information to obtain the current work item; The task execution queue is established for at least one execution terminal corresponding to the current work item.
8. A task allocation device, characterized in that: The task allocation device comprises: A workload prediction module is used to obtain in-transit task information of in-transit tasks in each task execution queue corresponding to the current work item, and predict the workload of each task execution queue according to the in-transit task information; A task acquisition module, used to acquire a task allocation request for a task to be allocated, wherein the task allocation request at least includes information about the task to be allocated; A queue matching module, used for matching the to-be-assigned task information with each of the task execution queues to determine the degree of compatibility between the to-be-assigned task and each of the task execution queues; The task allocation module is used to determine a target task execution queue to receive the task to be allocated according to the workload of each task execution queue and the adaptability.
9. A computer device, characterized in that: The computer device comprises a processor, a memory, and a computer program stored in the memory and executable by the processor, wherein when the computer program is executed by the processor, the steps of the task allocation method according to any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the steps of the task allocation method according to any one of claims 1 to 7 are implemented.