WO2019205370A1

WO2019205370A1 - Electronic device, task distribution method and storage medium

Info

Publication number: WO2019205370A1
Application number: PCT/CN2018/102088
Authority: WO
Inventors: 王磊
Original assignee: 平安科技（深圳）有限公司
Priority date: 2018-04-24
Filing date: 2018-08-24
Publication date: 2019-10-31
Also published as: CN108805397A

Abstract

The invention relates to an electronic device, a task distribution method and a storage medium. The method comprises: before task distribution, pre-dispatching current tasks to distribution objects in a task system and calculating a pre-dispatching score; obtaining a quantity of residual tasks of the distribution objects, and calculating a residual task score according to the quantity of the residual tasks; obtaining task processing quantities of the distribution objects in a past preset time, and calculating a task processing score according to the task processing quantities and the quantity of the residual tasks; during task distribution, if a distribution object whose residual task score is greater than or equal to 0 exists, calculating a weight score according to the pre-dispatching score, the residual task score and the task processing score, and dispatching the current task to a corresponding distribution object according to the weight score and a predetermined distribution rule. According to the method, the task condition of each distribution object can be comprehensively evaluated, and tasks are distributed to staffs with strong comprehensive processing ability, so that the timeliness of processing is ensured.

Description

Electronic device, method for distributing tasks, and storage medium

Priority claim

The present application is based on the priority of the Chinese Patent Application entitled "Electronic Device, Method of Assigning Tasks and Storage Medium", which is filed on April 24, 2018, with the application number of CN 2018103745724, the entire contents of which are The manner of reference is incorporated in the present application.

Technical field

The present application relates to the field of data processing technologies, and in particular, to an electronic device, a method for allocating tasks, and a storage medium.

Background technique

At present, the assignment of tasks is generally performed by the system according to the established strategy to assign tasks to various processing personnel in the team, for example, assigning tasks to the processing personnel who have the largest difference in the proportion of assigned tasks with the current relative burden ratio distance setting (ie, distance presets) The maximum load gap is the largest: for each type of task set the team and the team members in the task arrangement ratio, team A has two A and B, the proportion of A and B set is 67% and 33%, then the first task comes over, because Have not assigned tasks, will be assigned to the task assignment ratio is high, that is assigned to A; when the second task comes over, A currently has a task, B has no task, as the relative burden ratio of A is 100%, B relative The burden ratio is 0%, so the second task is assigned to B. When the third task comes, A and B currently have tasks, and the relative burden ratio of A and B is 50%, but the distance of A is set. 67% is the largest, so the task is assigned to A; when the fourth task comes over, the current relative burden ratio is calculated to be 66.6%, and the current relative burden ratio of B is 33.3%. A task is assigned to four, and so on.

However, the processing personnel need to process multiple tasks at the same time, and the processing time of each task is different. The current system cannot be fully evaluated, and it is easy to cause the task to be dispatched, and the processing time cannot meet the business requirements.

Summary of the invention

The purpose of the present application is to provide an electronic device, a method for distributing a task, and a storage medium, which are intended to comprehensively evaluate the task situation of each assigned object, and assign the task to a person with comprehensive processing capability to ensure the timeliness of the processing. .

To achieve the above object, the present application provides an electronic device including a memory and a processor coupled to the memory, the memory storing a processing system operable on the processor, the processing The system implements the following steps when executed by the processor:

a first calculating step of pre-assigning the current task to the assigned object in the task system before assigning the task, and calculating a pre-dispatch score of the assigned object after pre-dispatching;

a second calculating step of obtaining the number of remaining tasks of the allocated object, and calculating a remaining task score corresponding to the assigned object according to the number of remaining tasks of the allocated object;

a third calculating step: acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the assigned object and the number of remaining tasks;

The analysis step, when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;

a first allocation step, if not, assigning a task to a pre-allocated allocation object;

a second allocation step, if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned according to the weighting score and the predetermined allocation rule according to the weighting score calculated by the pre-allocation score, the remaining task score, and the processing task score Assign the corresponding assignment object.

To achieve the above objective, the present application further provides a method for allocating tasks, and the method for assigning tasks includes:

S1, before assigning the task, pre-assigning the current task to the assigned object in the task system, and calculating the pre-dispatch score of the assigned object after pre-dispatching;

S2: acquiring the number of remaining tasks of the allocated object, and calculating a remaining task score corresponding to the allocated object according to the number of remaining tasks of the allocated object;

S3, acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the allocated object and the number of remaining tasks;

S4, when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;

S5, if no, assign the task to the pre-allocated allocation object;

S6, if yes, in the allocation object whose remaining task score is greater than or equal to 0, the weighting score calculated according to the pre-allocation score, the remaining task score, and the processing task score, the current task is assigned to the corresponding task according to the weighting score and the predetermined allocation rule. Assign objects.

The present application also provides a computer readable storage medium having stored thereon a processing system, the processing system being executed by a processor to implement the steps of the method of assigning tasks as described above.

The beneficial effects of the present application are: Before assigning a task to each assigned object in the team, the present application first analyzes the situation in which the assigned object is currently pre-assigned, the remaining unprocessed task, and the assigned object in the past preset time. The task processing situation, and calculating the corresponding score according to the situation, when the task is assigned, if there are multiple assignment objects whose number of remaining tasks is less than or equal to a certain value, the calculation is based on the pre-dispatch score, the remaining task score, and the processing task score. For the weight score of the comprehensive evaluation, the current task is assigned to the corresponding assignment object according to the weight score and the predetermined distribution rule, and the task situation of each assignment object can be comprehensively evaluated, and the task is assigned to the person with comprehensive processing capability. To ensure the timeliness of processing.

DRAWINGS

1 is a schematic diagram of a hardware architecture of an embodiment of an electronic device according to the present application;

FIG. 2 is a schematic flowchart diagram of an embodiment of a method for allocating tasks according to the present application.

detailed description

In order to make the objects, technical solutions, and advantages of the present application more comprehensible, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the application and are not intended to be limiting. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present application without departing from the inventive scope are the scope of the present application.

It should be noted that the descriptions of "first", "second" and the like in the present application are for the purpose of description only, and are not to be construed as indicating or implying their relative importance or implicitly indicating the number of technical features indicated. . Thus, features defining "first" or "second" may include at least one of the features, either explicitly or implicitly. In addition, the technical solutions between the various embodiments may be combined with each other, but must be based on the realization of those skilled in the art, and when the combination of the technical solutions is contradictory or impossible to implement, it should be considered that the combination of the technical solutions does not exist. Nor is it within the scope of protection required by this application.

FIG. 1 is a schematic diagram of an application environment of an embodiment of an electronic device of the present application. The electronic device 1 is an apparatus capable of automatically performing numerical calculation and/or information processing in accordance with an instruction set or stored in advance. The electronic device 1 may be a computer, a single network server, a server group composed of multiple network servers, or a cloud-based cloud composed of a large number of hosts or network servers, where cloud computing is a type of distributed computing. A super virtual computer consisting of a group of loosely coupled computers.

In the present embodiment, the electronic device 1 may include, but is not limited to, a memory 11 communicably connected to each other through a system bus, a processor 12, and a network interface 13, and the memory 11 stores a processing system operable on the processor 12. It should be noted that FIG. 1 only shows the electronic device 1 having the components 11-13, but it should be understood that not all illustrated components are required to be implemented, and more or fewer components may be implemented instead.

The memory 11 includes a memory and at least one type of readable storage medium. The memory provides a cache for the operation of the electronic device 1; the readable storage medium may be, for example, a flash memory, a hard disk, a multimedia card, a card type memory (eg, SD or DX memory, etc.), a random access memory (RAM), a static random access memory (SRAM). A non-volatile storage medium such as a read only memory (ROM), an electrically erasable programmable read only memory (EEPROM), a programmable read only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, or the like. In some embodiments, the readable storage medium may be an internal storage unit of the electronic device 1, such as a hard disk of the electronic device 1; in other embodiments, the non-volatile storage medium may also be external to the electronic device 1. A storage device, such as a plug-in hard disk equipped with an electronic device 1, a smart memory card (SMC), a Secure Digital (SD) card, a flash card, or the like. In this embodiment, the readable storage medium of the memory 11 is generally used to store an operating system and various types of application software installed in the electronic device 1, such as program code for storing a processing system in an embodiment of the present application. Further, the memory 11 can also be used to temporarily store various types of data that have been output or are to be output.

The processor 12 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments. The processor 12 is typically used to control the overall operation of the electronic device 1, such as performing control and processing related to data interaction or communication with other devices. In this embodiment, the processor 12 is configured to run program code or process data stored in the memory 11, such as running a processing system or the like.

The network interface 13 may comprise a wireless network interface or a wired network interface, which is typically used to establish a communication connection between the electronic device 1 and other electronic devices.

The processing system is stored in the memory 11 and includes at least one computer readable instruction stored in the memory 11, the at least one computer readable instruction being executable by the processor 12 to implement the methods of various embodiments of the present application; The at least one computer readable instruction can be classified into different logic modules depending on the functions implemented by its various parts.

In an embodiment, when the processing system is executed by the processor 12, the following steps are implemented:

In this embodiment, the pre-dispatching represents that the assignment object is currently pre-dispatched, and the task may be first dispatched according to a pre-defined strategy in the task system. The pre-deployed strategy may be pre-dispatched according to the current task number of each allocation object, and the probability that the current task number is less pre-dispatched is larger; or the pre-dispatch may be performed according to the efficiency of each allocation object processing task. The higher the efficiency of processing a task, the greater the probability of being pre-dispatched. It may also be based on the current number of tasks of each assigned object and the efficiency of the processing task. The lesser the current task number of the assigned object, the more efficient the task. The higher the probability of being pre-dispatched, the more, and so on, there is no limit here.

Specifically, a task is pre-assigned to one assignment object, and the assignment object is currently assigned to one task, and the corresponding pre-dispatch score is 1 point. If the assignment object is not currently assigned to the task, the corresponding assignment object is pre-dispatched. The score is 0 points; or the task is pre-assigned to the corresponding assignment object according to the distribution ratio preset by the task system (for example, the task is divided into 5, each of which is 20%), and the assignment object is currently assigned to a certain proportion of tasks. Then, the corresponding pre-dispatch score is 1 point, and the assigned object is not currently assigned to the task, and the corresponding assigned object pre-dispatch score is 0 points.

In this embodiment, the number of remaining tasks represents the remaining unprocessed tasks of the allocation object. The smaller the number of remaining tasks, the higher the remaining task scores, and the more the number of remaining tasks, the lower the remaining task scores.

The calculation rule of the remaining task score may be pre-determined, and the remaining task score corresponding to the allocation object is calculated according to the number of remaining tasks of the allocation object and the calculation rule of the remaining task score. Specifically, the remaining task score = 1 - (number of remaining tasks / n) * 0.1, where n is a conversion parameter, and the value of n can be predetermined according to different actual situations, for example, in an actual case, if the number of remaining tasks is 50 tasks are demarcation points, then the value of n can be 1/10 of 50, which is 5; if the number of remaining tasks is 30 points, the value of n can be 1/10 of 30. That is, 3, etc., of course, it is also possible to reserve the value of n as other values, and there is no excessive limit here.

In the formula remaining task score = 1 - (number of remaining tasks / n) * 0.1, preferably, n is 5, that is, the number of remaining tasks of the assigned object is equal to 50, the remaining task score is 0, and the number of remaining tasks is less than 50, the remaining task score is greater than 0, the remaining task number is greater than 50, and the remaining task score is less than 0.

In this embodiment, the number of task processing of the assigned object in the past preset time represents the situation in which the assigned object recently processed the task. The more the number of task processing of the assigned object in the past preset time, the less the number of remaining tasks, the more the processing task score is. high.

The calculation rule of the processing task score may be pre-established, and the processing task score corresponding to the allocation object is calculated according to the number of task processing of the allocation object in the past preset time, the number of remaining tasks, and the calculation rule of the processing task score. Specifically, the processing task score = the number of task processing / (the number of task processing + the number of remaining tasks). Among them, the past preset time is preferably 7 days.

In this embodiment, the allocation objects whose remaining task scores are greater than or equal to 0 are first filtered out, that is, the allocation objects whose remaining tasks are less than or equal to a certain value are filtered out, for example, the number of remaining tasks is less than or equal to the allocation objects of 50 tasks. Screen out and then conduct a comprehensive assessment. If the remaining task scores of all the assigned objects are less than 0, the allocation is performed according to the aforementioned pre-allocation case, and the tasks are equally distributed to the pre-allocated allocation objects. For the assigned objects whose remaining task score is greater than or equal to 0, the weight score for the comprehensive evaluation is calculated.

Wherein, weight score=w1*pre-distribution score+w2*remaining task score+w3* processing task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, w3 is the weight of the processing task score, w1 <w2<w3, w1+w2+w3=1, preferably, w1=0.1, w2=0.4, w3=0.5.

As can be seen from the above description, the assigned object with high pre-scoring score indicates that it is currently pre-dispatched; the higher the remaining task score, the less the number of remaining tasks; the higher the processing task score is. The more the number of recent task processing and the smaller the number of remaining tasks; the higher the weight score, the stronger the comprehensive ability of the assigned object to represent its processing tasks.

In an embodiment, the predetermined allocation rule includes: if the remaining task score is greater than or equal to 0, the assigned task is assigned to the assigned object;

If there are a plurality of allocation objects whose remaining task scores are greater than or equal to 0, in the following allocation scenario, assignment of tasks is performed for the allocation objects whose scores of the plurality of remaining tasks are greater than or equal to 0. In each of the following operations, if the task has been assigned, the next step is not performed. If the task is not assigned, the operation is performed in the following order: in the multiple assignment objects whose remaining task score is greater than or equal to 0, analyze whether there is any allocation. The weight score, the processing task score and the remaining task score of the object respectively correspond to the same, that is, whether the weight scores of the assigned objects are the same, and whether the processing task scores are the same, and whether the remaining task scores are the same;

If the three assignments of the assignment object are the same, respectively, the assignment tasks are assigned to the corresponding assignment objects in descending order of the pre-dispatch scores among the assignment objects that are identical in the above-mentioned three assignments ( The first allocation), that is, firstly assigned to the above three objects that are identical to each other but not pre-assigned to the task, for example, the task is assigned to the above three in order according to the pre-dispatch score from low to high. All the same, pre-dispatch assignments with a score of 0.

If there are three different situations (for example, there are different distribution weight scores, or the processing task scores are different, or the remaining task scores are different), then in the allocation objects with multiple remaining task scores greater than or equal to 0 (if there is a first assignment) Then, the allocation object of the first assigned task is removed, and further analysis is performed whether the weighting score of the assigned object and the processing task score are respectively the same, that is, whether the weighting scores of the assigned objects are the same, and whether the processing task scores are the same. ;

If the two objects of the assigned object are respectively the same, then in the allocation object with multiple remaining task scores greater than or equal to 0 (if there is the first allocation, the assigned object of the first assigned task is removed), according to the remaining The task is assigned to the corresponding assigned object (second allocation) in order from highest to lowest;

If there is a difference between the two (for example, there is a different distribution weight score, or the processing task score is different), then in the allocation object with multiple remaining task scores greater than or equal to 0 (if there is the first allocation, the first time is eliminated) Assigning the assignment object of the task, if there is the first assignment, the second assignment, the assignment objects of the two assigned tasks are eliminated) and further analyzing whether the weight scores of the respective assignment objects are the same;

If yes, the current task is assigned to the corresponding allocation object in order from the highest to the lowest in the processing task score; if not, the current task is assigned to the corresponding allocation object in descending order of the weighting score.

In another embodiment, the predetermined allocation rule may further include: if the remaining task score is greater than or equal to 0, the assignment task is assigned to the assignment object; if the remaining task score is greater than or equal to 0, the assignment object is If there are multiple, the current task is assigned to the corresponding assigned object in order from the highest to the lowest.

Compared with the prior art, the present application first analyzes the situation in which the assigned object is currently pre-assigned the task, the remaining unprocessed task, and the object allocated in the past preset time before assigning the task to each assigned object in the team. The task processing situation, and calculating the corresponding score according to the situation, when the task is assigned, if there are multiple assignment objects whose number of remaining tasks is less than or equal to a certain value, the calculation is based on the pre-dispatch score, the remaining task score, and the processing task score. For the weight score of the comprehensive evaluation, the current task is assigned to the corresponding assignment object according to the weight score and the predetermined distribution rule, and the task situation of each assignment object can be comprehensively evaluated, and the task is assigned to the person with comprehensive processing capability. To ensure the timeliness of processing.

As shown in FIG. 2, FIG. 2 is a schematic flowchart of an embodiment of a method for allocating tasks according to the present application. The method for allocating tasks includes the following steps:

Step S1, before assigning the task, pre-assigning the current task to the allocation object in the task system, and calculating the pre-dispatch score of the assigned object after pre-dispatching;

Step S2: acquiring the number of remaining tasks of the allocation object, and calculating a remaining task score corresponding to the allocation object according to the number of remaining tasks of the allocation object;

Step S3: acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the allocated object and the number of remaining tasks;

Step S4, when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;

Step S5, if no, assign the task to the pre-allocated allocation object;

Step S6, if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned to the corresponding task according to the weight score and the predetermined distribution rule according to the weight score calculated by the pre-distribution score, the remaining task score, and the processing task score. Assignment object.

The serial numbers of the embodiments of the present application are merely for the description, and do not represent the advantages and disadvantages of the embodiments.

Through the description of the above embodiments, those skilled in the art can clearly understand that the foregoing embodiment method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be through hardware, but in many cases, the former is better. Implementation. Based on such understanding, the technical solution of the present application, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, The optical disc includes a number of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the methods described in various embodiments of the present application.

The above is only a preferred embodiment of the present application, and is not intended to limit the scope of the patent application, and the equivalent structure or equivalent process transformations made by the specification and the drawings of the present application, or directly or indirectly applied to other related technical fields. The same is included in the scope of patent protection of this application.

Claims

An electronic device, comprising: a memory and a processor coupled to the memory, wherein the memory stores a processing system operable on the processor, the processing system being The processor implements the following steps when it executes:

a first calculating step of pre-assigning the current task to the assigned object in the task system before assigning the task, and calculating a pre-dispatch score of the assigned object after pre-dispatching;

a second calculating step of obtaining the number of remaining tasks of the allocated object, and calculating a remaining task score corresponding to the assigned object according to the number of remaining tasks of the allocated object;

a third calculating step: acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the assigned object and the number of remaining tasks;

The analysis step, when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;

a first allocation step, if not, assigning a task to a pre-allocated allocation object;

a second allocation step, if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned according to the weighting score and the predetermined allocation rule according to the weighting score calculated by the pre-allocation score, the remaining task score, and the processing task score Assign the corresponding assignment object.
The electronic device according to claim 1, wherein the step of calculating the remaining task score corresponding to the assignment object according to the number of remaining tasks of the assignment object comprises: remaining task score=1 - (number of remaining tasks / n) *0.1, where n is a conversion parameter;

The step of calculating the processing task score according to the number of task processing of the allocation object and the number of remaining tasks includes: processing task score=number of task processing/(number of task processing+number of remaining tasks).
The electronic device according to claim 1, wherein the step of calculating the weight score according to the pre-dispatch score, the remaining task score, and the processing task score comprises: weight score = w1 * pre-distribution score + w2 * remaining The task score + w3 * processes the task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, and w3 is the weight of the processing task score, w1 < w2 < w3.
The electronic device according to claim 2, wherein the step of calculating the weight score according to the pre-distribution score, the remaining task score, and the processing task score comprises: weight score = w1 * pre-distribution score + w2 * remaining The task score + w3 * processes the task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, and w3 is the weight of the processing task score, w1 < w2 < w3.
The electronic device according to claim 3 or 4, wherein the predetermined distribution rule comprises:

If the remaining task score is greater than or equal to 0, the assigned task is assigned to the assigned object;

If there are multiple allocation objects whose remaining task score is greater than or equal to 0, in the multiple allocation objects whose remaining task score is greater than or equal to 0, whether the weighting score, the processing task score, and the remaining task score of the assigned object are respectively corresponding to each other the same;

If yes, the current task is assigned to the corresponding assigned object in descending order of the pre-dispatch scores, respectively, in the same allocation object.

If no, in the allocation object whose remaining task score is greater than or equal to 0, it is analyzed whether the weighting score of the assigned object and the processing task score are respectively the same;

If yes, the current task is assigned to the corresponding allocation object in descending order of the remaining task scores in the same allocation object.

If not, in the allocation object whose remaining task score is greater than or equal to 0, analyze whether the weight scores of the respective assigned objects are the same;

If yes, the current task is assigned to the corresponding assigned object in order of processing task scores from high to low;

If not, the current task is assigned to the corresponding assigned object in descending order of the weight score; or

The predetermined allocation rule includes: if the remaining task score is greater than or equal to 0, the assignment task is assigned to the assignment object; if the remaining task score is greater than or equal to 0, the assignment object is higher according to the weight score. The current task is assigned to the corresponding assigned object in descending order.
The electronic device according to claim 1, wherein the step of pre-assigning the current task to the assignment object in the task system, and calculating the pre-dispatch score of the assignment object after the pre-dispatch, specifically includes:

Pre-assign a task to an assignment object, and calculate a pre-dispatch score for the assignment object pre-dispatched to the task; or

The task is pre-assigned to the corresponding assigned object according to the distribution ratio preset by the task system, and the pre-dispatch score of the assigned object pre-assigned to the task is calculated.
The electronic device according to claim 2, wherein the step of pre-assigning the current task to the assignment object in the task system and calculating the pre-dispatch score of the assignment object after the pre-dispatch includes:

Pre-assign a task to an assignment object, and calculate a pre-dispatch score for the assignment object pre-dispatched to the task; or

The task is pre-assigned to the corresponding assigned object according to the distribution ratio preset by the task system, and the pre-dispatch score of the assigned object pre-assigned to the task is calculated.
A method for assigning a task, characterized in that the method for assigning a task includes:

S1, before assigning the task, pre-assigning the current task to the assigned object in the task system, and calculating the pre-dispatch score of the assigned object after pre-dispatching;

S2: acquiring the number of remaining tasks of the allocated object, and calculating a remaining task score corresponding to the allocated object according to the number of remaining tasks of the allocated object;

S3, acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of tasks processed by the assigned object and the number of remaining tasks;

S4, when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;

S5, if no, assign the task to the pre-allocated allocation object;

S6, if yes, in the allocation object whose remaining task score is greater than or equal to 0, the weighting score calculated according to the pre-allocation score, the remaining task score, and the processing task score, the current task is assigned to the corresponding task according to the weighting score and the predetermined allocation rule. Assign objects.
The method of assigning tasks according to claim 8, wherein the step of calculating the remaining task scores corresponding to the allocation objects according to the number of remaining tasks of the allocation object comprises: remaining task scores = 1 - (remaining tasks Quantity / n) * 0.1, where n is a conversion parameter;

The step of calculating the processing task score according to the number of task processing of the allocation object and the number of remaining tasks includes: processing task score=number of task processing/(number of task processing+number of remaining tasks).
The method for assigning a task according to claim 8, wherein the step of calculating the weight score according to the pre-allocation score, the remaining task score, and the processing task score comprises: weight score = w1 * pre-distribution score + w2 * Remaining task score + w3 * processing task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, and w3 is the weight of the processing task score, w1 < w2 < w3.
The method for assigning tasks according to claim 9, wherein the step of calculating the weight scores according to the pre-dispatch score, the remaining task score, and the processing task score comprises: weight score = w1 * pre-distribution score + w2 * Remaining task score + w3 * processing task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, and w3 is the weight of the processing task score, w1 < w2 < w3.
The method of assigning a task according to claim 10 or 11, wherein the predetermined distribution rule comprises:

If the remaining task score is greater than or equal to 0, the assigned task is assigned to the assigned object;

If there are multiple allocation objects whose remaining task score is greater than or equal to 0, in the multiple allocation objects whose remaining task score is greater than or equal to 0, whether the weighting score, the processing task score, and the remaining task score of the assigned object are respectively corresponding to each other the same;

If yes, the current task is assigned to the corresponding assigned object in descending order of the pre-dispatch scores, respectively, in the same allocation object.

If no, in the allocation object whose remaining task score is greater than or equal to 0, it is analyzed whether the weighting score of the assigned object and the processing task score are respectively the same;

If yes, the current task is assigned to the corresponding allocation object in descending order of the remaining task scores in the same allocation object.

If not, in the allocation object whose remaining task score is greater than or equal to 0, analyze whether the weight scores of the respective assigned objects are the same;

If yes, the current task is assigned to the corresponding assigned object in order of processing task scores from high to low;

If not, the current task is assigned to the corresponding assigned object in descending order of the weight score; or

The predetermined allocation rule includes: if the remaining task score is greater than or equal to 0, the assignment task is assigned to the assignment object; if the remaining task score is greater than or equal to 0, the assignment object is higher according to the weight score. The current task is assigned to the corresponding assigned object in descending order.
The method of assigning a task according to claim 8, wherein the step of pre-assigning the current task to the assigned object in the task system and calculating the pre-allocation score of the assigned object after the pre-dispatching comprises:

Pre-assign a task to an assignment object, and calculate a pre-dispatch score for the assignment object pre-dispatched to the task; or

The task is pre-assigned to the corresponding assigned object according to the distribution ratio preset by the task system, and the pre-dispatch score of the assigned object pre-assigned to the task is calculated.
The method of assigning a task according to claim 9, wherein the step of pre-assigning the current task to the assigned object in the task system and calculating the pre-allocation score of the assigned object after the pre-dispatching comprises:

Pre-assign a task to an assignment object, and calculate a pre-dispatch score for the assignment object pre-dispatched to the task; or

The task is pre-assigned to the corresponding assigned object according to the distribution ratio preset by the task system, and the pre-dispatch score of the assigned object pre-assigned to the task is calculated.
A computer readable storage medium, wherein the computer readable storage medium stores a processing system, and when the processing system is executed by the processor, the steps are:

a first calculating step of pre-assigning the current task to the assigned object in the task system before assigning the task, and calculating a pre-dispatch score of the assigned object after pre-dispatching;

a second calculating step of obtaining the number of remaining tasks of the allocated object, and calculating a remaining task score corresponding to the assigned object according to the number of remaining tasks of the allocated object;

a third calculating step: acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the assigned object and the number of remaining tasks;

The analysis step, when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;

a first allocation step, if not, assigning a task to a pre-allocated allocation object;

a second allocation step, if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned according to the weighting score and the predetermined allocation rule according to the weighting score calculated by the pre-allocation score, the remaining task score, and the processing task score Assign the corresponding assignment object.
The computer readable storage medium according to claim 15, wherein the step of calculating the remaining task score corresponding to the assignment object according to the number of remaining tasks of the assignment object comprises: remaining task score=1 - (remaining task Number of /n)*0.1, where n is a conversion parameter;

The step of calculating the processing task score according to the number of task processing of the allocation object and the number of remaining tasks includes: processing task score=number of task processing/(number of task processing+number of remaining tasks).
The computer readable storage medium according to claim 15, wherein the step of calculating the weight score according to the pre-dispatch score, the remaining task score, and the processing task score comprises: weight score = w1 * pre-dispatch score + W2* remaining task score + w3* processing task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, and w3 is the weight of the processing task score, w1 < w2 < w3.
The computer readable storage medium according to claim 16, wherein the step of calculating the weight score according to the pre-dispatch score, the remaining task score, and the processing task score comprises: weight score = w1 * pre-dispatch score + W2* remaining task score + w3* processing task score, where w1 is the weight of the pre-dispatch score, w2 is the weight of the remaining task score, and w3 is the weight of the processing task score, w1 < w2 < w3.
The computer readable storage medium according to claim 17 or 18, wherein the predetermined distribution rule comprises:

If the remaining task score is greater than or equal to 0, the assigned task is assigned to the assigned object;

If there are multiple allocation objects whose remaining task score is greater than or equal to 0, in the multiple allocation objects whose remaining task score is greater than or equal to 0, whether the weighting score, the processing task score, and the remaining task score of the assigned object are respectively corresponding to each other the same;

If yes, the current task is assigned to the corresponding assigned object in descending order of the pre-dispatch scores, respectively, in the same allocation object.

If no, in the allocation object whose remaining task score is greater than or equal to 0, it is analyzed whether the weighting score of the assigned object and the processing task score are respectively the same;

If yes, the current task is assigned to the corresponding allocation object in descending order of the remaining task scores in the same allocation object.

If not, in the allocation object whose remaining task score is greater than or equal to 0, analyze whether the weight scores of the respective assigned objects are the same;

If yes, the current task is assigned to the corresponding assigned object in order of processing task scores from high to low;

If not, the current task is assigned to the corresponding assigned object in descending order of the weight score; or

The predetermined allocation rule includes: if the remaining task score is greater than or equal to 0, the assignment task is assigned to the assignment object; if the remaining task score is greater than or equal to 0, the assignment object is higher according to the weight score. The current task is assigned to the corresponding assigned object in descending order.
The computer readable storage medium according to claim 15, wherein the step of pre-assigning a current task to an assignment object in the task system and calculating a pre-dispatch score of the assignment object after pre-dispatching, specifically comprises :

Pre-assign a task to an assignment object, and calculate a pre-dispatch score for the assignment object pre-dispatched to the task; or

The task is pre-assigned to the corresponding assigned object according to the distribution ratio preset by the task system, and the pre-dispatch score of the assigned object pre-assigned to the task is calculated.