Task assignment method and device, equipment and storage medium

By building a task tree collection and processing queue, the target processing personnel are determined based on the scoring information and saturation, the problem of high randomness in the acquisition of pending tasks in the existing technology is solved, timely dispatching and efficient processing of pending tasks is achieved, and the User experience.

CN119090161APending Publication Date: 2024-12-06BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310666487.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-06-06
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

In the prior art, processors have high randomness when obtaining pending tasks from the database based on the processing terminal, and are unable to obtain pending tasks with high timeliness requirements in time, resulting in poor user experience.

Method used

By building a task tree collection, sorting pending tasks from large to small according to the scoring information, and building a processing queue based on the saturation of the processor, determining the target processor, and sending the pending tasks with the highest priority to the terminal of the optimal processor to the optimal processor .

Benefits of technology

It realizes the timely dispatch and processing of pending tasks, improves processing efficiency, reduces database access frequency, and improves user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090161A_ABST
    Figure CN119090161A_ABST
Patent Text Reader

Abstract

The embodiment of the invention discloses a task assignment method and device, equipment and a storage medium, and relates to the technical field of computers.The method comprises the steps that a task tree set is constructed according to basic data of to-be-processed tasks cached to a database; determining a current to-be-processed task in the task tree set, and determining type information of the current to-be-processed task; according to the type information, determining a target processing person from a processing queue in which identification information of the processing person is stored, the processing queue being constructed according to saturation of the processing person; and sending the current to-be-processed task to a target terminal corresponding to the target processing personnel. According to the technical scheme, the to-be-processed task with the highest priority can be sent to the target terminal corresponding to the optimal processing personnel corresponding to the to-be-processed task with the highest priority, so that the to-be-processed task is dispatched in time.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of computer technology, and in particular to a task dispatching method, apparatus, device and storage medium. Background Art

[0002] With the rapid development of the logistics industry, the logistics system manages millions of logistics tasks at the same time. Failure to handle logistics task anomalies in a timely manner may result in the goods not being delivered to users in a timely manner, affecting user experience. Failure to provide timely feedback on logistics information inquiries may result in users not being able to obtain logistics information in a timely manner, also affecting user experience. Therefore, both logistics task anomalies and logistics information inquiries can be assigned as pending tasks to the processing terminals corresponding to the processing personnel, so that the processing personnel can handle the pending tasks in a timely manner based on the processing terminals.

[0003] In the prior art, when an exception occurs in a logistics task or a logistics information query is received, the logistics task exception and the logistics information query can be cached in the database as tasks to be processed. The processing personnel access the database based on the processing terminal, obtain the target tasks to be processed in the database, and then process the target tasks to be processed based on the processing terminal.

[0004] In the process of implementing the present invention, the inventors found that there are at least the following technical problems in the prior art:

[0005] When processing personnel obtain target pending tasks from the database based on the processing terminal, the randomness is high and they are unable to obtain pending tasks with high timeliness requirements in a timely manner. Summary of the invention

[0006] The present invention provides a task dispatching method, device, equipment and storage medium to achieve timely dispatch of tasks to be processed, and further achieve timely processing of tasks to be processed.

[0007] In a first aspect, an embodiment of the present invention provides a task dispatching method, comprising:

[0008] Constructing a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information;

[0009] Determine a current task to be processed in the task tree set, and determine type information of the current task to be processed;

[0010] Determining a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel;

[0011] The current task to be processed is sent to the target terminal corresponding to the target processing person.

[0012] In a second aspect, an embodiment of the present invention further provides a task dispatching device, comprising:

[0013] A task tree set construction module is used to construct a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information;

[0014] A task determination module, used to determine the current pending task in the task tree set, and determine the type information of the current pending task;

[0015] A personnel determination module, used for determining a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel;

[0016] The execution module is used to send the current task to be processed to the target terminal corresponding to the target processing personnel.

[0017] In a third aspect, an embodiment of the present invention further provides a computer device, including:

[0018] one or more processors;

[0019] a storage device for storing one or more programs,

[0020] When the one or more programs are executed by the one or more processors, the one or more processors implement the task dispatching method as described in any one of the first aspects.

[0021] In a fourth aspect, an embodiment of the present invention further provides a storage medium comprising computer executable instructions, wherein the computer executable instructions, when executed by a computer processor, are used to execute the task dispatching method as described in any one of the first aspects.

[0022] The embodiments of the above invention have the following advantages or beneficial effects:

[0023] An embodiment of the present invention provides a task dispatching method, comprising: constructing a task tree set based on basic data of pending tasks cached in a database, wherein the task tree set stores pending tasks sorted from large to small according to scoring information; determining a current pending task in the task tree set, and determining type information of the current pending task; determining a target processing personnel from a processing queue storing identification information of the processing personnel based on the type information, wherein the processing queue is constructed based on the saturation of the processing personnel; and sending the current pending task to a target terminal corresponding to the target processing personnel. The above technical scheme can firstly construct a task tree set corresponding to the pending tasks cached in the database according to the basic data of the pending tasks cached in the database, and the task tree set stores the pending tasks sorted from large to small according to the scoring information, so as to realize the sorting and storage of the pending tasks according to the scoring information, and secondly, the pending task with the highest score in the task tree set can be determined as the current pending task, and the type information of the current pending task can be determined, and the target processing personnel can be determined from the processing queue of the identification information of the processing personnel stored in sequence from small to large according to the saturation constructed according to the saturation of the processing personnel, and specifically, the processing personnel whose processable type matches the type information of the current pending task and whose saturation is the smallest can be determined as the target processing personnel, and the current pending task is the pending task with the highest score, that is, the current pending task is the pending task with the highest priority, so as to realize the determination of the target processing personnel corresponding to the pending task with the highest priority, and then the current pending task can be sent to the target terminal corresponding to the target processing personnel, so as to realize the sending of the pending task with the highest priority to the target terminal corresponding to the optimal processing personnel corresponding to the pending task with the highest priority, and realize the timely dispatch of the pending task with the highest priority. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 A flowchart of a task dispatching method provided by an embodiment of the present invention;

[0025] Figure 2 A flowchart of another task dispatching method provided by an embodiment of the present invention;

[0026] Figure 3 A flowchart of step 220 in another task assignment method provided by an embodiment of the present invention;

[0027] Figure 4 A structural schematic diagram of a task dispatching device provided by an embodiment of the present invention;

[0028] Figure 5 A schematic diagram of the structure of a computer device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0029] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0030] It should be mentioned before discussing exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe various operations (or steps) as sequential processes, many operations therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of various operations can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to methods, functions, procedures, subroutines, subprograms, etc. In addition, the embodiments in the present invention and the features in the embodiments can be combined with each other without conflict.

[0031] The logistics transportation process includes multiple links. Any abnormality in any link may cause the logistics task to be abnormal. At this time, the logistics system generates pending tasks corresponding to the logistics task abnormality. When the user queries the logistics information, the logistics system generates pending tasks corresponding to the logistics information query.

[0032] In the prior art, the pending tasks can be cached in a database, and the processing personnel access the database that caches the pending tasks based on the processing terminal, and randomly obtain the target pending tasks from the database to process the target pending tasks based on the processing terminal. The randomness of the processing personnel obtaining the target pending tasks from the database based on the processing terminal is high, and the efficiency of the processing personnel obtaining the target pending tasks from the database based on the processing terminal determines the processing efficiency of the pending tasks. On the one hand, when the processing personnel obtain the pending tasks that they cannot process, they need to return the pending tasks to the database to facilitate other processing personnel to obtain the pending tasks, resulting in low efficiency in dispatching the pending tasks; on the other hand, different pending tasks have different requirements for timeliness, and the prior art cannot give priority to dispatching high-timeliness pending tasks, resulting in the processing personnel being unable to give priority to processing high-timeliness pending tasks, and the user experience is poor. In addition, when the processing personnel obtain the target pending tasks from the database based on the processing terminal, they need to frequently access the database, resulting in the database performance running continuously at a high level.

[0033] Therefore, the present application proposes a task dispatching method to timely dispatch tasks to be processed and improve the processing efficiency of the tasks to be processed.

[0034] The task assignment method proposed in this application will be described in detail below with reference to diagrams and embodiments.

[0035] Figure 1 The flowchart of a task dispatching method provided by an embodiment of the present invention is applicable to situations where abnormal tasks in the system need to be processed in a timely manner. The method can be executed by a task dispatching device, which can be implemented by software and / or hardware. Figure 1 The method specifically comprises the following steps:

[0036] Step 110: construct a task tree set according to the basic data of the tasks to be processed cached in the database.

[0037] The task tree set stores tasks to be processed sorted from large to small according to the scoring information.

[0038] The tasks to be processed may include logistics abnormality tasks and logistics query tasks. For example, logistics abnormality tasks can be understood as feedback from transportation personnel during logistics transportation, such as failure to arrange drivers within the specified time, vehicle dispatch not matching the actual situation, bad weather, traffic jams, overweight, traffic accidents, abnormal unloading addresses, and lost receipts, etc.; logistics query tasks can be understood as users’ queries for logistics information.

[0039] Specifically, the basic data may include at least one of the time of entry, the type of external submission, the number of times of entry, and the number of tags. The time of entry can be understood as the time when the pending task is cached in the database, and the basic data of all pending tasks include the time of entry; if the user does not receive timely feedback after querying the logistics information, he may complain based on at least one channel. Therefore, if the pending task is a query task and the user complains about the query task, the type of external submission of the pending task can be determined; if the pending task is cached in the database multiple times, the number of times the pending task is entered can be determined; if the pending task corresponds to a user, the number of tags of the pending task can be determined based on the user ID. For example, when the pending task is a query for logistics information triggered by the user, the number of tags of the pending task can be determined based on the number of user IDs.

[0040] The task tree set can be understood as an ordered tree set that stores pending tasks from large to small according to the scoring information. In order to determine the task tree set corresponding to the pending tasks cached in the database, it is necessary to sort the pending tasks from large to small according to the scoring information. The scoring information can be determined based on the current scoring configuration and the basic data of the pending tasks. The current scoring configuration may include the current incoming time scoring configuration, the current external investment type scoring configuration, the current incoming number scoring configuration, and the current number of tags scoring configuration. Specifically, the score of the online time in the basic data of the task to be processed can be determined based on the current online time scoring configuration in the current scoring configuration; if the basic data of the task to be processed includes the external investment type, the score of the external investment type in the basic data of the task to be processed is determined based on the current external investment type scoring configuration in the current scoring configuration; if the basic data of the task to be processed includes the number of online calls, the score of the number of online calls in the basic data of the task to be processed is determined based on the current number of online calls scoring configuration in the current scoring configuration; if the basic data of the task to be processed includes the number of labels, the score of the number of labels in the basic data of the task to be processed is determined based on the current number of labels scoring configuration in the current scoring configuration; finally, the scoring information of the task to be processed can be determined based on the score of the online time, the score of the external investment type, the score of the number of online calls and the score of the number of labels in the basic data of the task to be processed.

[0041] After determining the scoring information of each pending task cached in the database, the pending tasks cached in the database can be sorted based on the scoring information of each pending task, and the pending tasks sorted from large to small according to the scoring information can be stored based on an ordered tree set to obtain a task tree set corresponding to the pending tasks cached in the database.

[0042] In an embodiment of the present invention, a task tree set corresponding to the pending tasks cached in the database is determined, and the task tree set stores the pending tasks sorted from large to small according to the scoring information. The higher the scoring information, the higher the priority of the pending tasks. Therefore, the pending tasks at the front of the task tree set have the highest priority and can be dispatched first, providing a data basis for the dispatch of tasks.

[0043] Step 120: Determine the current task to be processed in the task tree set, and determine the type information of the current task to be processed.

[0044] Specifically, since the task tree set stores business data of pending tasks sorted from large to small according to scoring information, and the pending tasks with larger scoring information have higher priority, the pending tasks with the highest priority, that is, the pending tasks at the front of the task tree set, can be determined as the current pending tasks.

[0045] Next, it is necessary to determine the processing personnel corresponding to the current pending task. The processing personnel can be the customer service who handles the pending task. The business capabilities and processing efficiency of the processing personnel are different. In order to assign the current pending task with the highest priority to the optimal processing personnel. On the one hand, the business capabilities of the processing personnel need to match the type information of the current pending task. On the other hand, the processing efficiency of the processing personnel needs to meet the preset requirements. Therefore, after determining the current pending task, it is necessary to determine the type information of the current pending task. The type information of the current pending task can be used to determine the target processing personnel corresponding to the current pending task.

[0046] In an embodiment of the present invention, the pending task with the highest priority in the task tree set can be determined as the current pending task. The current pending task is the task that currently needs to be assigned. In order to assign the current pending task to a processing personnel who can handle the task, it is necessary to determine the type information of the current pending task so as to assign the current pending task to a processing personnel who matches the type information.

[0047] Step 130: Determine the target processing personnel from the processing queue storing the identification information of the processing personnel according to the type information.

[0048] The processing queue is constructed according to the saturation of processing personnel.

[0049] The saturation of the processing personnel can be understood as the interval saturation of the processing personnel in the current time period or the daily saturation of the day. Determine the interval saturation of each processing personnel in the current time period, and sort the processing personnel from small to large based on the interval saturation of each processing personnel in the current time period. If the interval saturation of multiple processing personnel is consistent, the daily saturation of the processing personnel with consistent interval saturation on the day can be determined, and the processing personnel with consistent interval saturation can be sorted from small to large based on the daily saturation of the processing personnel with consistent interval saturation, so as to achieve the sorting of processing personnel with consistent interval saturation, and further achieve the sorting of all processing personnel. Furthermore, the identification information of the processing personnel sorted from small to large according to the saturation can be stored in the processing queue.

[0050] Specifically, based on the identification information of the processing personnel stored in the processing queue and sorted from small to large according to the saturation, the processing personnel can be traversed in sequence to determine the processable type of each processing personnel. Based on the first-in-first-out principle of the queue, the saturation of the processing personnel traversed earlier is lower, so the processing personnel whose processable type traversed first matches the type information of the current task to be processed can be determined as the target processing personnel.

[0051] In an embodiment of the present invention, after determining the current task to be processed, the target processing personnel can be determined in a processing queue that stores identification information of processing personnel sorted from small to large according to saturation, so as to determine the processing personnel whose processable type matches the type information of the current task to be processed and whose saturation is the lowest as the target processing personnel, thereby determining the optimal processing personnel corresponding to the current processing task.

[0052] Step 140: Send the current task to be processed to the target terminal corresponding to the target processing personnel.

[0053] Specifically, after determining the target processing personnel corresponding to the current task to be processed, the target terminal corresponding to the target processing personnel can be determined, and then the current task to be processed can be sent to the target terminal to achieve the dispatch of the current task to be processed.

[0054] In the embodiment of the present invention, the to-be-processed tasks with the highest priority are sent to the target terminal corresponding to the optimal processing personnel corresponding thereto, so as to achieve timely dispatch of the to-be-processed tasks.

[0055] The task dispatching method provided by an embodiment of the present invention includes: constructing a task tree set based on basic data of pending tasks cached in a database, wherein the task tree set stores pending tasks sorted from large to small according to scoring information; determining a current pending task in the task tree set, and determining type information of the current pending task; determining a target processing personnel from a processing queue storing identification information of the processing personnel based on the type information, wherein the processing queue is constructed based on the saturation of the processing personnel; and sending the current pending task to a target terminal corresponding to the target processing personnel. The above technical scheme can firstly construct a task tree set corresponding to the pending tasks cached in the database according to the basic data of the pending tasks cached in the database, and the task tree set stores the pending tasks sorted from large to small according to the scoring information, so as to realize the sorting and storage of the pending tasks according to the scoring information. Secondly, the pending task with the highest score in the task tree set can be determined as the current pending task, and the type information of the current pending task can be determined. The target processing personnel can be determined from the processing queue of the identification information of the processing personnel stored in order from small to large according to the saturation of the processing personnel. Specifically, the processable type can be matched with the type information of the current pending task and the saturation can be determined. The processing personnel with the smallest sum is determined as the target processing personnel, and the current pending task is the pending task with the highest score, that is, the current pending task is the pending task with the highest priority, so as to determine the target processing personnel corresponding to the pending task with the highest priority, and then the current pending task can be sent to the target terminal corresponding to the target processing personnel, so as to send the pending task with the highest priority to the target terminal corresponding to the optimal processing personnel corresponding to the pending task with the highest priority, so as to realize the timely dispatch of the pending task with the highest priority, and of course, the target processing personnel can timely process the pending task with the highest priority based on the target terminal, so as to realize the timely processing of the pending task.

[0056] Figure 2 A flowchart of another task dispatching method provided by an embodiment of the present invention, the embodiment of the present invention can be applied to situations where abnormal tasks in the system need to be processed in a timely manner. Based on the above embodiment, before constructing a task tree set based on the basic data of the tasks to be processed cached in the database, "determine the basic data of the tasks to be processed based on at least one of the incoming line time, external submission type, number of incoming lines and number of tags of the tasks to be processed cached in the database.", and before determining the target processing personnel from the processing queue storing the identification information of the processing personnel based on the type information, "construct the processing queue based on the saturation of the processing personnel.", the explanations of the terms that are the same or corresponding to the above embodiments are not repeated here. See. Figure 2 The task dispatching method provided by the embodiment of the present invention includes:

[0057] Step 210: Determine basic data corresponding to the task to be processed according to at least one of the incoming time, external submission type, incoming number and tag quantity of the task to be processed cached in the database.

[0058] The basic data of the task to be processed may include at least one of the incoming time, external input type, incoming times and label quantity of the task to be processed.

[0059] Specifically, the basic data is json data in key-value format, where the key can be a keyword representing the incoming call time, external submission type, number of incoming calls, or number of tags, and the value can be a specific numerical value of the incoming call time, external submission type, number of incoming calls, or number of tags. The keyword for the incoming call time is "insert_no_handler", and the specific numerical value can be a specific time. For example, the specific numerical value is 2022-02-25, 02:59:46, indicating that the time when the task to be processed is cached to the database is 2022-02-25, 02:59:46; the keyword for the external submission type is "out_complaint_handler", and the specific numerical value can be the identifier of the external submission type of the task to be processed. The system may have a built-in correspondence table between the external submission type and the external submission type identifier. After determining the external submission type of the task to be processed, the external submission type identifier corresponding to the external submission type of the task to be processed can be found in the correspondence table between the external submission type and the external submission type identifier. For example, when the external submission type is a complaint to the postal system, the external submission type The type identifier is 2. For example, the specific data is 2, indicating that the external submission type of the task to be processed is a complaint to the postal system; the keyword for the number of incoming calls is "repeat_num_handler", and the specific value can be the number of times the task to be processed is cached in the database. For example, the specific value is 6, indicating that the task to be processed is cached in the database for the sixth time; the keyword for the number of tags is "customer_role_handler", and the specific value can be the number of identifiers of the users corresponding to the task to be processed. The number of identifiers can be understood as the number of identification information of the user. For example, when the user is a member user, an enterprise user, and a key area user at the same time, it can be determined that the number of identification information of the user is 3. For example, the specific value is 3, indicating that there are three types of identification information of the user corresponding to the task to be processed.

[0060] Since the pending tasks are the pending tasks cached in the database, the basic data of all pending tasks include the online time. If the pending task is a query task and the user has complained about the query task, the basic data of the pending task also includes the external projection type; if the pending task is cached in the database multiple times, the basic data of the pending task also includes the number of online times; if the pending task corresponds to a user, the basic data of the pending task also includes the number of tags.

[0061] After determining the basic data of the task to be processed, the basic data of the task to be processed in json format may be inserted into the dispatch data (DispatchData) of the task to be processed.

[0062] In an embodiment of the present invention, basic data of pending tasks cached in a database is determined, and the basic data of pending tasks can be used to construct a task tree set corresponding to the pending tasks, providing a data basis for determining the task tree set corresponding to the pending tasks.

[0063] Step 220: construct a task tree set according to the basic data of the tasks to be processed cached in the database.

[0064] The task tree set stores tasks to be processed sorted from large to small according to the scoring information.

[0065] Figure 3 A flowchart of step 220 in another task dispatching method provided by an embodiment of the present invention is shown in FIG. Figure 3 As shown, in one implementation, step 220 may specifically include:

[0066] Step 2210: Determine the scoring information of each of the tasks to be processed according to the current scoring configuration and the basic data of each of the tasks to be processed.

[0067] In one implementation, step 2210 may specifically include:

[0068] Parse the basic data of the task to be processed to obtain the scoring items of the task to be processed; score each of the scoring items of the task to be processed according to the current scoring configuration to obtain the scoring results corresponding to each of the scoring items; sum the scoring results corresponding to each of the scoring items of the task to be processed to obtain the scoring information of the task to be processed.

[0069] The basic data of the task to be processed is inserted into the scheduling data of the task to be processed, and is in the json format. Therefore, when determining the scoring information of the task to be processed, it is first necessary to determine the basic data of the task to be processed based on the scheduling data of the task to be processed. Secondly, the basic data can be parsed, and the key in the basic data in the json format, that is, the keywords of the incoming time, external investment type, number of incoming calls or number of tags in the basic data, is determined as the scoring item of the task to be processed. The scoring item may include at least one of the incoming time, external investment type, number of incoming calls and number of tags.

[0070] The server pre-stores a current scoring configuration for scoring the tasks to be processed, and the current scoring configuration includes a current incoming time scoring configuration, a current external submission type scoring configuration, a current incoming number scoring configuration, and a current tag quantity scoring configuration, that is, the current scoring configuration may include scores corresponding to values ​​of each scoring item. Table 1 is a current scoring configuration table provided by an embodiment of the present invention. As shown in Table 1, the scoring items may include online time, online times and label quantity. The current online time scoring configuration may be: when the online time value is 0h-24h, 24h-26h, 26h-28h, 28h-30h, 30h-32h, 32h-34h, 34h-36h, 36h-38h, and greater than 38h, the corresponding scores are 1, 2, 3, 4, 5, 6, 7, 8, and 9; the current label quantity scoring configuration may be: when the label quantity value is 1, 2, 3, 4, 5, 6, 7, 8, the corresponding scores are 1, 2, 3, 4, 5, 6, 7, 8; the current online times scoring configuration may be: when the online times value is 4, 5, 6, 7, 8, 9, 10, 11-15, the corresponding scores are 1, 2, 3, 4, 5, 6, 7, 10.

[0071] Table 1

[0072]

[0073] After parsing the basic data of the pending task to obtain the scoring items of the pending task, the scoring items of the pending task can be scored according to the current scoring configuration shown in Table 1 to obtain the scoring results corresponding to each scoring item. Specifically, the online time of the pending task can be scored according to the current online time scoring configuration in the current scoring configuration to obtain the score corresponding to the online time, i.e., the scoring result; the number of tags of the pending task can be scored according to the current number of tags scoring configuration in the current scoring configuration to obtain the score corresponding to the number of tags, i.e., the scoring result; the number of online times of the pending task can be scored according to the current number of online times scoring configuration in the current scoring configuration to obtain the score corresponding to the number of online times, i.e., the scoring result; and the scoring information of the pending task can also be determined according to the sum of the scoring results of the online time, the number of tags, and the number of times of the pending task.

[0074] It should be noted that the current configuration information can be determined according to actual needs and can be built into the easyRule rule engine. When it is necessary to determine the scoring information of the task to be processed, the easyRule rule engine can be called to enable the easyRule rule engine to score the scoring items of the task to be processed obtained by parsing the basic data of the task to be processed according to the built-in current scoring configuration, and determine the scoring information of the task to be processed based on the sum of the scoring results of each scoring item. In the easyRule rule engine, when the number of incoming calls is scored based on the current incoming call scoring configuration in the current scoring configuration, the operation logic of the easyRule rule engine is as follows: determine that the rule name is RePeatNum_4, indicating that the number of incoming calls is 4; determine that the rule description is RePeatNum_4TO 1, indicating that the scoring result is 1 when the number of incoming calls is 4; determine that the priority is 1, indicating that the first priority is used to score the number of incoming calls; determine that the judgment rule is "dispatchData.getData==4, dispatchData.setScore(1D)", indicating that the scoring result is 1 when the number of incoming calls is 4; determine that the rule name is RePeatNum_5, indicating that the number of incoming calls is 5; determine that the rule description is RePeatNum_5TO 2, indicating that the scoring result is 2 when the number of incoming calls is 5; determine that the priority is 2, indicating that the second priority is used to score the number of incoming calls; determine that the judgment rule is "dispatchData.getData==5, dispatchData.setScore(2D)", indicating that the scoring result is 2 when the number of incoming calls is 5.

[0075] After determining the score information of the task to be processed, the score information of the task to be processed may also be inserted into the dispatch data (DispatchData) of the task to be processed.

[0076] In the easyRule rule engine, the scoring items of the tasks to be processed obtained by parsing the basic data of the tasks to be processed are scored according to the current configuration information built into the easyRule rule engine, and the scoring information of the tasks to be processed is determined according to the scoring results of each scoring item. The current configuration information can be configured according to actual needs, reducing the difficulty of determining the scoring information of the tasks to be processed.

[0077] Step 2220: sort the tasks to be processed based on the scoring information of the tasks to be processed, and store the sorted tasks to be processed into an ordered tree set to obtain the task tree set.

[0078] The ordered tree set may be a TreeSet structure.

[0079] Specifically, the tasks to be processed can be sorted from large to small based on the scoring information of the tasks to be processed, and the sorted tasks to be processed are stored in the TreeSet structure to obtain a task tree set. The tasks to be processed can be sorted according to the scoring information of the tasks to be processed, and the sorted tasks to be processed are stored in the TreeSet structure to obtain a task tree set.

[0080] In practical applications, the task tree collection can be stored in Redis.

[0081] It should be noted that it is also possible to traverse the pending tasks cached in the database, determine the score information of the pending tasks, insert the pending tasks into the ordered tree set according to the score information of the pending tasks, and obtain the task tree set. Of course, the pending tasks with higher score information can be inserted into the ordered tree set first, so that the pending tasks with the highest score information are always at the front of the ordered tree set.

[0082] In an embodiment of the present invention, a task tree set corresponding to the pending tasks cached in the database is determined, and the task tree set stores the pending tasks sorted from large to small according to the scoring information. The higher the scoring information, the higher the priority of the pending tasks. Therefore, the pending tasks at the front of the task tree set have the highest priority and can be dispatched first, providing a data basis for the dispatch of tasks.

[0083] In addition, the amount of data of pending tasks cached in the database is huge. A task tree set can be constructed for every 100,000 pending tasks according to the online time. Each task tree set stores 100,000 pending tasks sorted from large to small with scoring information. When assigning tasks, the pending tasks in the task tree set with a longer online time can be assigned first. The effective time of the task tree set can be preset in advance, and the pending tasks in the task tree set can be assigned within the effective time of the task tree set. After the effective time, the task tree set is automatically deleted. When the next assignment begins, the corresponding task tree set is rebuilt based on the pending tasks cached in the database.

[0084] Step 230: Determine the current task to be processed in the task tree set, and determine the type information of the current task to be processed.

[0085] In one implementation, determining the current task to be processed in the task tree set includes:

[0086] The to-be-processed task with the highest score in the task tree set is determined as the current to-be-processed task.

[0087] Specifically, task processing polling can be started to read the pending tasks in the task tree set in batches, and a preset number of pending tasks can be determined as a batch of pending tasks. The pending tasks in the task tree set are sorted from large to small according to the score information, so each batch of pending tasks read out are the pending tasks with the highest priority. Then, the pending tasks in the same batch are determined as the current pending tasks in turn.

[0088] Next, you need to determine the assignment object of the current pending task, that is, the processing personnel who can handle the current pending task. The processing personnel can be the customer service who handles the pending task. The processing personnel have different business capabilities, that is, different processing types, and different processing efficiency. In order to assign the current pending task with the highest priority to the best processing personnel. On the one hand, the processing type of the processing personnel needs to match the type information of the current pending task, and on the other hand, the processing efficiency of the processing personnel needs to meet the preset requirements.

[0089] Therefore, after determining the current pending task, the type information of the current pending task for the target processing personnel corresponding to the current pending task can be determined. For example, the current pending task can be determined to be a system task related to a computer or a personnel task related to a natural person.

[0090] In an embodiment of the present invention, the pending task with the highest score in the task tree set can be determined as the current pending task. The current pending task is the task that needs to be assigned at present. In order to assign the current pending task to a processing personnel who can handle the task, it is necessary to determine the type information of the current pending task so as to assign the current pending task to a processing personnel who matches the type information.

[0091] Step 240: construct the processing queue according to the saturation of the processing personnel.

[0092] In one implementation, step 240 may specifically include:

[0093] Determine the interval saturation of the processing personnel, and sort the processing personnel based on the interval saturation; if the interval saturation of multiple processing personnel is consistent, determine the daily saturation of the processing personnel with consistent interval saturation, and sort the processing personnel with consistent interval saturation based on the daily saturation; store the identification information of the sorted processing personnel based on the queue to obtain the processing queue.

[0094] The business capabilities and business processing efficiency of processing personnel are not uniform. In order to balance the task processing capabilities of each processing personnel, the daily processing volume limit and distribution rhythm can be configured for each processing personnel. For example, the daily processing volume limit can be configured as 50,000, and the distribution rhythm can be configured as 2 / 1800 seconds. The processing volume limit is used to control the total business volume of processing personnel, and the distribution rhythm is used to control the processing efficiency of processing personnel.

[0095] Before assigning the tasks to be processed, it is necessary to determine the saturation of each processing personnel, and the saturation here can be the interval saturation or the daily saturation. The higher the saturation, the higher the work saturation of the processing personnel, and it is difficult to continue to assign tasks. The lower the saturation, the lower the work saturation of the processing personnel, and the tasks can continue to be assigned. Determine the interval saturation of the processing personnel in the interval where the current time period is located. Specifically, the ratio of the processing volume and the dispatch rhythm of the processing personnel in the current time period can be determined as the interval saturation of the processing personnel in the interval where the current time period is located. Then, the processing personnel can be sorted in the order of interval saturation from small to large. If the interval saturation of multiple processing personnel is consistent, the daily saturation of the processing personnel with consistent interval saturation is determined. Specifically, the ratio of the daily processing volume and the upper limit of the daily processing volume can be determined as the daily saturation of the processing personnel with consistent interval saturation. Then, the processing personnel with consistent interval saturation can be sorted based on the order of daily saturation from small to large. Finally, the identification information of the sorted processing personnel can be stored based on the queue to obtain the processing queue.

[0096] In practical applications, all processing personnel can be traversed to determine the interval saturation of the processing personnel, so as to insert the identification information of the processing personnel into the processing queue based on the interval saturation. If the interval saturation of the processing personnel is consistent with the interval saturation of at least one processing personnel already inserted into the processing queue, the daily saturation of the processing personnel with the same interval saturation can be determined, and the identification information of the processing personnel can be inserted into the processing queue based on the daily saturation. Of course, the identification information of the processing personnel with lower interval saturation can be preferentially inserted into the processing queue, so that the identification information of the processing personnel with the lowest saturation is located at the bottom of the processing queue.

[0097] In the embodiment of the present invention, the processing personnel can be sorted based on the two dimensions of interval saturation and daily saturation of the processing personnel, and the identification information of the processing personnel sorted from small to large according to the saturation can also be stored based on the processing queue.

[0098] Step 250: Determine the target processing personnel from the processing queue storing the identification information of the processing personnel according to the type information.

[0099] The processing queue is constructed according to the saturation of processing personnel.

[0100] In one implementation, step 250 may specifically include:

[0101] The processing personnel are traversed according to the identification information of the processing personnel stored in the processing queue, and the processable types of the processing personnel are determined; and the processing personnel with the lowest saturation and whose processable type matches the type information is determined as the target processing personnel.

[0102] Specifically, the processing personnel can be traversed in sequence based on the identification information of the processing personnel sorted from small to large according to the saturation stored in the processing queue to determine the processable type of each processing personnel. Since the identification information of the processing personnel is stored in the processing queue in the order of saturation from small to large, based on the first-in-first-out principle of the queue, the processing personnel whose processable type matches the type information of the current task to be processed and is first traversed can be determined as the target processing personnel, that is, the processing personnel with the lowest saturation and whose processable type matches the type information of the current task to be processed can be determined as the target processing personnel.

[0103] In an embodiment of the present invention, after determining the current task to be processed, the target processing personnel can be determined in a processing queue that stores the identification information of the processing personnel in order from small to large saturation, so as to determine the processing personnel with the lowest saturation and whose processable type matches the type information of the current task to be processed as the target processing personnel, thereby determining the optimal processing personnel corresponding to the current processing task.

[0104] Step 260: Send the current task to be processed to the target terminal corresponding to the target processing personnel.

[0105] Specifically, after determining the target processing personnel corresponding to the current pending task, the target terminal corresponding to the target processing personnel can be determined, and then the current pending task can be sent to the target terminal to achieve the dispatch of the current pending task. When dispatching the pending tasks in the task tree set, multi-threaded dispatching can be performed to speed up the dispatching efficiency.

[0106] Of course, the target processing personnel can process the current pending tasks based on the target terminal, and the optimal processing personnel corresponding to the highest priority pending tasks can process the highest priority pending tasks, thereby achieving timely and efficient processing of pending tasks.

[0107] After the pending tasks in the task tree set are successfully assigned to the processing terminal corresponding to the processing personnel, the business data of the pending tasks can be determined and recorded in the dispatch information record table. The dispatch information record table records the business data of the pending tasks that are successfully assigned in the task tree set. The business data of the pending tasks includes the scoring items, sorting, dispatch batches and scheduling data of the pending tasks. The scheduling data includes basic data and scoring data.

[0108] In an embodiment of the present invention, the highest priority pending task is sent to the target terminal corresponding to the corresponding optimal processing personnel, so as to realize the timely dispatch of the pending task. Of course, the optimal processing personnel can timely process the highest priority pending task based on the target terminal, so as to realize the timely processing of the pending task and improve the task processing efficiency.

[0109] Of course, processing personnel can still access the task tree collection stored in Redis based on the processing terminal to manually obtain tasks to be processed and reduce the pressure on the database.

[0110] It should be noted that the collection, use, storage, sharing and transfer of user personal information involved in the technical solution of the present invention are in compliance with the provisions of relevant laws and regulations, and the user needs to be informed and the user's consent or authorization is obtained. When applicable, the user's personal information is de-identified and / or anonymized and / or encrypted. For example: when determining the basic data of the task to be processed, if the basic data includes the number of tags, we will de-identify the number of tags through technical means.

[0111] The task dispatching method provided by an embodiment of the present invention includes: determining basic data corresponding to the task to be processed according to at least one of the incoming time, external submission type, incoming number and number of tags of the task to be processed cached in a database; constructing a task tree set according to the basic data of the task to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to scoring information; determining the current task to be processed in the task tree set, and determining the type information of the current task to be processed; constructing the processing queue according to the saturation of the processing personnel; determining the target processing personnel from the processing queue storing the identification information of the processing personnel according to the type information; and sending the current task to be processed to the target terminal corresponding to the target processing personnel. The above technical scheme can first determine the basic data of the pending tasks cached in the database, the basic data of the pending tasks are used to determine the scoring information of the pending tasks, and the scoring information of the pending tasks is used to sort the pending tasks. Therefore, the basic data of the pending tasks determined here provide a data basis for sorting the pending tasks. Secondly, a task tree set corresponding to the pending tasks can be constructed according to the basic data of the pending tasks cached in the database. The task tree set stores the pending tasks sorted from large to small according to the scoring information, so as to realize the sorting and storage of the pending tasks according to the scoring information. Thirdly, the pending task with the highest score in the task tree set can be determined as the current pending task, and the type information of the current pending task can be determined, from the processing tree set constructed according to the saturation of the processing personnel and stored in order from small to large according to the saturation. The target processing personnel is determined in the processing queue of the personnel's identification information. Specifically, the processing personnel whose processing type matches the type information of the current pending task and whose saturation is the smallest can be determined as the target processing personnel. The current pending task is the pending task with the highest score, that is, the current pending task is the pending task with the highest priority, so as to determine the target processing personnel corresponding to the pending task with the highest priority, and then the current pending task can be sent to the target terminal corresponding to the target processing personnel, so as to send the pending task with the highest priority to the target terminal corresponding to the optimal processing personnel corresponding to the pending task with the highest priority, so as to realize the timely dispatch of the pending task with the highest priority. Of course, the target processing personnel can process the pending task with the highest priority in a timely manner based on the target terminal, so as to realize the timely processing of the pending task.

[0112] Figure 4 The structure diagram of a task dispatching device provided by an embodiment of the present invention is shown in FIG. The device and the task dispatching methods of the above embodiments belong to the same inventive concept. For details not described in detail in the embodiment of the task dispatching device, reference can be made to the embodiment of the above task dispatching method.

[0113] The specific structure of the task dispatching device is as follows: Figure 4As shown, including:

[0114] The task tree set construction module 410 is used to construct a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information;

[0115] The task determination module 420 is used to determine the current task to be processed in the task tree set, and determine the type information of the current task to be processed;

[0116] A personnel determination module 430, configured to determine a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel;

[0117] The execution module 440 is used to send the current task to be processed to the target terminal corresponding to the target processing person.

[0118] Based on the above embodiment, the device further includes:

[0119] The data determination module is used to determine the basic data of the task to be processed according to at least one of the incoming time, external submission type, incoming number and label quantity of the task to be processed cached in the database.

[0120] Based on the above embodiment, the task tree set construction module 410 is specifically used for:

[0121] According to the current scoring configuration and the basic data of each of the tasks to be processed, the scoring information of each of the tasks to be processed is determined; based on the scoring information of each of the tasks to be processed, each of the tasks to be processed is sorted, and the sorted tasks to be processed are stored in an ordered tree set to obtain the task tree set.

[0122] In one implementation, determining the scoring information of each of the tasks to be processed according to the current scoring configuration and the basic data of each of the tasks to be processed includes:

[0123] Parse the basic data of the task to be processed to obtain the scoring items of the task to be processed; score each of the scoring items of the task to be processed according to the current scoring configuration to obtain the scoring results corresponding to each of the scoring items; sum the scoring results corresponding to each of the scoring items of the task to be processed to obtain the scoring information of the task to be processed.

[0124] Based on the above embodiment, the task determination module 420 is specifically used for:

[0125] The to-be-processed task with the highest score in the task tree set is determined as the current to-be-processed task; and type information of the current to-be-processed task is determined.

[0126] Based on the above embodiment, the device further includes:

[0127] A processing queue construction module is used to construct the processing queue according to the saturation of the processing personnel.

[0128] In one implementation, the processing queue construction module is specifically used to:

[0129] Determine the interval saturation of the processing personnel, and sort the processing personnel based on the interval saturation; if the interval saturation of multiple processing personnel is consistent, determine the daily saturation of the processing personnel with consistent interval saturation, and sort the processing personnel with consistent interval saturation based on the daily saturation; store the identification information of the sorted processing personnel based on the queue to obtain the processing queue.

[0130] Based on the above embodiment, the personnel determination module 430 is specifically used for:

[0131] The processing personnel are traversed according to the identification information of the processing personnel stored in the processing queue, and the processable types of the processing personnel are determined; and the processing personnel with the lowest saturation and whose processable type matches the type information is determined as the target processing personnel.

[0132] The task dispatching device provided in the embodiment of the present invention can execute the task dispatching method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of executing the task dispatching method.

[0133] It is worth noting that in the embodiment of the above-mentioned task dispatching device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention.

[0134] Figure 5 A schematic diagram of the structure of a computer device provided in an embodiment of the present invention. Figure 5 A block diagram of an exemplary computer device 5 suitable for use in implementing embodiments of the present invention is shown. Figure 5 The computer device 5 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0135] like Figure 5As shown, the computer device 5 is in the form of a general-purpose computing electronic device. The components of the computer device 5 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 connecting different system components (including the system memory 28 and the processing unit 16).

[0136] Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor or a local bus using any of a variety of bus architectures. By way of example, these architectures include, but are not limited to, an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MAC) bus, an Enhanced ISA bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnect (PCI) bus.

[0137] The computer device 5 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computer device 5, including volatile and non-volatile media, removable and non-removable media.

[0138] The system memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The computer device 5 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 5 not shown, usually called a "hard drive"). Although Figure 5 Not shown in the figure, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The system memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present invention.

[0139] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in system memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. Program modules 42 generally perform the functions and / or methods of the embodiments described herein.

[0140] The computer device 5 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), one or more devices that enable a user to interact with the computer device 5, and / or any device that enables the computer device 5 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed through an input / output (I / O) interface 22. Furthermore, the computer device 5 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 20. Figure 5 As shown, the network adapter 20 communicates with other modules of the computer device 5 via the bus 18. It should be understood that although Figure 5 Not shown, other hardware and / or software modules may be used in conjunction with computer device 5, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0141] The processing unit 16 executes various functional applications and page displays by running the programs stored in the system memory 28, for example, implementing the task dispatching method provided in the embodiment of the present invention, which includes:

[0142] Constructing a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information;

[0143] Determine a current task to be processed in the task tree set, and determine type information of the current task to be processed;

[0144] Determining a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel;

[0145] The current task to be processed is sent to the target terminal corresponding to the target processing person.

[0146] Of course, those skilled in the art can understand that the processor can also implement the technical solution of the task dispatching method provided by any embodiment of the present invention.

[0147] An embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, a task dispatching method provided in an embodiment of the present invention is implemented. The method includes:

[0148] Constructing a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information;

[0149] Determine a current task to be processed in the task tree set, and determine type information of the current task to be processed;

[0150] Determining a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel;

[0151] The current task to be processed is sent to the target terminal corresponding to the target processing person.

[0152] The computer storage medium of the embodiment of the present invention can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this document, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0153] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0154] The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0155] Computer program code for performing the operations of the present invention may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0156] It should be understood by those skilled in the art that the modules or steps of the present invention described above can be implemented by a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, optionally, they can be implemented by a program code executable by a computer device, so that they can be stored in a storage device and executed by the computing device, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0157] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A task assignment method, characterized in that: include: Constructing a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information; Determine a current task to be processed in the task tree set, and determine type information of the current task to be processed; Determining a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel; The current task to be processed is sent to the target terminal corresponding to the target processing person.

2. The task assignment method according to claim 1, characterized in that: Before building a task tree set based on the basic data of pending tasks cached in the database, it also includes: The basic data of the task to be processed is determined according to at least one of the incoming time, the external input type, the incoming number and the number of tags of the task to be processed cached in the database.

3. The task assignment method according to claim 1, characterized in that: Build a task tree set based on the basic data of pending tasks cached in the database, including: Determine the scoring information of each of the tasks to be processed according to the current scoring configuration and the basic data of each of the tasks to be processed; The tasks to be processed are sorted based on the scoring information of the tasks to be processed, and the sorted tasks to be processed are stored in an ordered tree set to obtain the task tree set.

4. The task assignment method according to claim 3, characterized in that: Determine the scoring information of each of the tasks to be processed according to the current scoring configuration and the basic data of each of the tasks to be processed, including: Parsing the basic data of the task to be processed to obtain the scoring items of the task to be processed; Scoring each of the scoring items of the task to be processed according to the current scoring configuration to obtain a scoring result corresponding to each of the scoring items; The scoring results corresponding to the scoring items of the task to be processed are summed to obtain the scoring information of the task to be processed.

5. The task assignment method according to claim 1, characterized in that: Determining the current task to be processed in the task tree set includes: The to-be-processed task with the highest score in the task tree set is determined as the current to-be-processed task.

6. The task assignment method according to claim 1, characterized in that: Before determining the target processing personnel from the processing queue storing the identification information of the processing personnel according to the type information, the method further includes: The processing queue is constructed according to the saturation of the processing personnel.

7. The task assignment method according to claim 6, characterized in that: The processing queue is constructed according to the saturation of the processing personnel, including: determining interval saturation of the processing personnel, and ranking the processing personnel based on the interval saturation; If the interval saturation of multiple processing personnel is consistent, determining the daily saturation of the processing personnel with consistent interval saturation, and sorting the processing personnel with consistent interval saturation based on the daily saturation; The processing queue is obtained by storing the sorted identification information of the processing personnel based on the queue.

8. The task assignment method according to claim 7, characterized in that: Determining a target processing person from a processing queue storing identification information of processing persons according to the type information, wherein the processing queue is constructed according to the saturation of processing persons, including: Traversing the processing personnel according to the identification information of the processing personnel stored in the processing queue, and determining the processing types that the processing personnel can process; The processing personnel whose saturation is the lowest and whose processable type matches the type information is determined as the target processing personnel.

9. A task dispatching device, characterized in that: include: A task tree set construction module is used to construct a task tree set according to the basic data of the tasks to be processed cached in the database, wherein the task tree set stores the tasks to be processed sorted from large to small according to the scoring information; A task determination module, used to determine the current pending task in the task tree set, and determine the type information of the current pending task; A personnel determination module, used for determining a target processing personnel from a processing queue storing identification information of processing personnel according to the type information, wherein the processing queue is constructed according to the saturation of processing personnel; The execution module is used to send the current task to be processed to the target terminal corresponding to the target processing personnel.

10. A computer device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the task dispatching method as described in any one of claims 1 to 8.

11. A storage medium containing computer executable instructions, characterized in that: When the computer executable instructions are executed by a computer processor, they are used to perform the task dispatching method according to any one of claims 1 to 8.