CN116258304A - Task allocation method and device, electronic equipment and storage medium - Google Patents

Abstract

The application discloses a task allocation method, a task allocation device, electronic equipment and a storage medium, and belongs to the technical field of information processing. The method comprises the following steps: responding to a processing request of target equipment, and acquiring an identification of the target equipment; determining a task queue to be processed corresponding to the target equipment at the current time according to the identification of the target equipment, wherein the task queue to be processed contains a plurality of tasks to be processed; determining an expected completion time for the target device to complete the plurality of tasks to be processed; and adding at least one task to be processed in the task queue to be distributed under the condition that the expected completion time is not earlier than the preset time.

Description

A task allocation method, device, electronic equipment and storage medium

technical field

The present application belongs to the technical field of information processing, and specifically relates to a task allocation method, device, electronic equipment and storage medium.

Background technique

The assignment of tasks related to the approval process of reimbursement documents in the expense reimbursement system generally assigns the approval tasks of reimbursement documents to fixed review positions or reviewers through pre-configured rules. This allocation method cannot flexibly adjust the review of processing tasks according to the actual situation Posts or reviewers, for example, when the review task of post A is heavy and the task of post B is relatively easy, the tasks cannot be transferred, which affects the processing efficiency of the overall pending tasks.

Contents of the invention

The purpose of the embodiments of the present application is to provide a task allocation method, device, electronic equipment and storage medium, which can solve the problems of inflexible task allocation and low processing efficiency.

In order to solve the above-mentioned technical problems, the application is implemented as follows:

In the first aspect, the embodiment of the present application provides a method for assigning tasks. The method includes: obtaining the identifier of the target device in response to a processing request of the target device; The task queue to be processed corresponding to the target device, wherein the task queue to be processed contains a plurality of tasks to be processed; determine the expected completion time for the target device to complete the plurality of tasks to be processed; at the expected completion time If it is not earlier than the preset time, at least one pending task in the pending task queue is added to the pending task queue.

In the second aspect, the embodiment of the present application provides a task allocation device, the device includes: a response module, configured to acquire the identifier of the target device in response to a processing request of the target device; a determination module, configured to The identification of the target device determines the pending task queue corresponding to the target device as of the current time, wherein the pending task queue contains a plurality of pending tasks; the determining module is also used to determine that the target device completes The expected completion time of the plurality of pending tasks; a recovery module, configured to add at least one pending task in the pending task queue to be allocated when the expected completion time is not earlier than a preset time task queue.

In the third aspect, the embodiment of the present application provides an electronic device, the electronic device includes a processor and a memory, the memory stores programs or instructions that can run on the processor, and the programs or instructions are processed by the The steps of implementing the task allocation method as described in the first aspect when the controller is executed.

In a fourth aspect, an embodiment of the present application provides a readable storage medium, on which a program or an instruction is stored, and when the program or instruction is executed by a processor, the task allocation method as described in the first aspect is implemented A step of.

In the fifth aspect, the embodiment of the present application provides a chip, the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is used to run programs or instructions, so as to implement the first aspect The task assignment method described.

In a sixth aspect, an embodiment of the present application provides a computer program product, the program product is stored in a storage medium, and the program product is executed by at least one processor to implement the task allocation method as described in the first aspect.

According to a task allocation method provided by an embodiment of the present application, by responding to the processing request of the target device, the identification of the target device is acquired; according to the identification of the target device, the task to be processed corresponding to the target device is determined as of the current time Queue, wherein, the pending task queue contains a plurality of pending tasks; determine the expected completion time for the target device to complete the plurality of pending tasks; when the expected completion time is not earlier than the preset time Next, adding at least one pending task in the pending task queue to the pending task queue, and reassigning the at least one pending task can solve the problems of inflexible assignment of pending tasks and low processing efficiency.

Description of drawings

FIG. 1 is a schematic flow chart of a task allocation method provided by an embodiment of the present application;

Fig. 2 is a schematic structural diagram of a task allocation device provided by an embodiment of the present application;

Fig. 3 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of them. Based on the embodiments in this application, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of this application.

The terms "first", "second" and the like in the specification and claims of the present application are used to distinguish similar objects, and are not used to describe a specific sequence or sequence. It should be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application can be practiced in sequences other than those illustrated or described herein, and that references to "first," "second," etc. distinguish Objects are generally of one type, and the number of objects is not limited. For example, there may be one or more first objects. In addition, "and/or" in the specification and claims means at least one of the connected objects, and the character "/" generally means that the related objects are an "or" relationship.

In the relevant expense reimbursement system, the task assignment plan for the approval process of financial reimbursement documents generally assigns the approval tasks of financial reimbursement documents to fixed review positions or review personnel according to pre-configured fixed rules, without considering different review positions and review personnel. The efficiency of tasks, the problem of personnel vacations, and the fluctuation of the processing time of different types of to-do tasks. The existing scheme cannot effectively balance the load of reviewers, which affects the processing time of the overall to-do tasks.

In order to solve the above technical problems, embodiments of the present application provide a task allocation method, device, electronic equipment, and storage medium.

A task allocation method, device, electronic device, and storage medium provided in the embodiments of the present application will be described in detail below through specific embodiments and application scenarios with reference to the accompanying drawings.

FIG. 1 shows a task allocation method provided by an embodiment of the present application. The method may be executed by an electronic device, and the electronic device may include: a server and/or a terminal device. In other words, the method can be executed by software or hardware installed in the electronic device, and the method includes the following steps:

S101: Obtain an identifier of the target device in response to a processing request of the target device.

This step responds to the processing request of the target device, such as a task transfer request when an auditor is on vacation or when there are too many tasks in the backlog, or when some tasks have special complexity or confidentiality, or an auditor reviews The efficiency is high, and it is necessary to obtain the identification of the target device corresponding to the reviewer in the task assignment request submitted when applying for reassignment of tasks.

S102: According to the identifier of the target device, determine a pending task queue corresponding to the target device as of the current time.

Wherein, the pending task queue includes a plurality of pending tasks.

In this step, according to the identification of the target device obtained in the above steps, for example, the local task allocation table can be searched and the completed task table can be combined to determine the pending task queue corresponding to the target device as of the current time, wherein the pending task queue contains multiple pending tasks. In an implementation manner, both the task allocation table and the completed task table store the corresponding relationship between the identifier of the target device and the identifier of the processing task.

S103: Determine an expected completion time for the target device to complete the plurality of tasks to be processed.

In an implementation manner, the determining the expected completion time for the target device to complete the plurality of tasks to be processed includes:

The expected completion time is determined according to the historical processing time of each task to be processed by the target device.

In this step, the expected completion time for the target device to complete the plurality of tasks to be processed is determined by combining the historical processing time of the target device for each pending task, which can serve as a reference for subsequent task allocation.

In an implementation manner, before determining the expected completion time according to the historical processing time of each task to be processed by the target device, the method further includes:

According to the task type corresponding to each task to be processed and the historical processing time of the target device corresponding to each task type, the historical processing time of the target device for each task to be processed is determined.

For example, the system checks the user U's current to-do tasks T1, T2, ..., Tj, ..., Tm corresponding to the target device identifier, and obtains the historical average time for user U to process this type of task according to the type of each to-do task Ci, so as to calculate the expected duration COST=T1*C1+T2*C2+...+Tj*Ci+...+Tm*Cm for the current user U to complete the current to-do task.

In an implementation manner, the determining the historical processing time of the target device for each task to be processed according to the task type corresponding to each task to be processed and the historical processing time of the target device corresponding to each task type includes:

According to the task type corresponding to each task to be processed and the historical average processing time corresponding to each task type of the audit group to which the target device belongs, the historical processing time of the target device for each task to be processed is determined.

For example, reviewers are divided into N review groups G1, G2, ..., Gi, ..., Gn, and when assigning tasks, each reviewer only belongs to one review group. For each reviewer Gi, count its After the current to-do tasks T1, T2, ..., Tj, ..., Tm, obtain the historical average processing time Cj of the task type in the group according to the task Tj, and calculate the time for the current user Ui to complete the current to-do task Expected duration COSTi=T1*C1+T2*C2+...+Tj*Cj+...+Tm*Cm, and then obtain the expected end time Ei for the current user to complete the current to-do task; in addition, the processing request indicates that the current user If there is a vacation plan, obtain the vacation arrangement of the current user Ui between the current time and the expected end time Ei of the current to-do task, and calculate the expected end time Ei ^' after the scheduled vacation.

In an implementation manner, after determining the expected completion time according to the historical processing time of each task to be processed by the target device, the expected completion time Ei of the to-do task to which each user Ui belongs can also be calculated according to the expected completion time Ei from small to The large sequence prioritizes each user and provides decision support for the system to assign tasks.

In addition, in the case that the processing request is a task allocation request, considering its subjectively high work enthusiasm, the expected duration of processing the current to-do task is multiplied by the coefficient R (0.8<R<1.0), Update COSTi; and then get Ui's expected end time Ei" for completing the current to-do task.

S104: If the expected completion time is not earlier than the preset time, add at least one pending task in the pending task queue to the pending task queue.

In this step, if it is estimated that the historical processing time of each task to be processed by the target device is not earlier than the preset time, it is estimated that the user corresponding to the target device may not be able to complete the assigned task before the preset time , reclaiming at least one pending task in the pending task queue corresponding to the target device, so as to facilitate subsequent reallocation.

According to a task allocation method provided by an embodiment of the present application, by responding to the processing request of the target device, the identification of the target device is acquired; according to the identification of the target device, the task to be processed corresponding to the target device is determined as of the current time Queue, wherein, the pending task queue contains a plurality of pending tasks; determine the expected completion time for the target device to complete the plurality of pending tasks; when the expected completion time is not earlier than the preset time Next, adding at least one pending task in the pending task queue to the pending task queue, and reassigning the at least one pending task can solve the problems of inflexible assignment of pending tasks and low processing efficiency.

In one implementation, the recovered to-do tasks can be put back into the task queue to be assigned according to the three dimensions of the user's company code corresponding to the target device, the document type involved in the task, and the review process. The time for this link is prioritized. For example, for the recovered task T1, the time stamp of the first arrival in the pending task queue is t1, there is currently another task T2 in the queue, and the time stamp of the first arrival in the queue is t2, if t1<t2, the recovered task T1 is more than the current pending task T2 in the processing queue enjoys a higher priority to be processed.

In an implementation manner, before the above step S102, the method further includes:

According to a preset allocation rule, adding multiple tasks to be processed in the task queue to be allocated to the task queue to be processed corresponding to the target device.

In an implementation manner, after the above step S103, the method further includes:

If the expected completion time is earlier than the preset time, at least one pending task in the pending task queue is added to the pending task queue corresponding to the target device according to a preset allocation rule.

In an implementation manner, the preset assignment rule is determined according to an identifier type of the target device, a task type of a task to be processed, and a priority of the task to be processed.

The preset distribution rules described in this application may include three different distribution methods, namely manual distribution, automatic distribution and shared order grabbing. These three distribution methods exist side by side, and through complementary advantages, the task distribution can be completed flexibly and efficiently. Purpose. Manual allocation can ensure the overall flexibility of the task allocation mode to deal with special situations, including manual task recycling and manual task assignment. For example, when a reviewer has a temporary transaction, his task can be withdrawn and put back into the task to be assigned Queue, or directly assigned to other reviewers; or when the entire review team has too many tasks in the backlog of reviewers and does not meet the conditions for automatic assignment, manual assignment is performed; shared order grabbing is a supplementary mechanism to the automatic assignment method. It is also an effective way to implement performance incentives for reviewers. Under the premise of assigning each reviewer to meet the basic tasks through automatic assignment, reviewers with spare capacity can actively obtain more to-dos by sharing orders Tasks, so as to obtain more performance rewards; automatic assignment is the first automatic execution of the system to ensure that each reviewer obtains a relatively average basic task load, and to a certain extent, guarantees that each reviewer obtains the number of pending tasks For fairness, global locks can be set during the execution of automatic assignment tasks, and manual assignment and shared order grabbing operations are not allowed.

The preset allocation rule may be determined according to the type of the target device identifier, the task type of the task to be processed, and the priority of the task to be processed, wherein the type of the target device identifier may include the identity of the user corresponding to the target device Type, the task type may include the type of documents to be reviewed, and the priority of the pending tasks may include the order in which the pending tasks arrive in the queue, or be sorted according to the urgency of the pending tasks.

In an implementation manner, before adding a plurality of pending tasks in the pending task queue to the pending task queue corresponding to the target device according to the preset allocation rule, the method further includes:

The queue of tasks to be allocated is established, wherein the queue of tasks to be allocated includes the multiple tasks to be processed, and the multiple tasks to be processed have priorities.

For example, the expense reimbursement system completes the document filling, generates to-do tasks, and pushes the relevant data of the to-do tasks to the message queue. Then, consume the to-do task data in the message queue, build the to-do task queue, obtain the relevant information of the to-do task from the message queue, group the to-do tasks according to the three dimensions of company code, document type, and audit link, and group them according to the to-do task Arrange the priority of task processing according to the order in which the tasks arrive in the queue, build the queue of tasks to be allocated for subsequent task allocation and shared order grabbing, and the users corresponding to the relevant devices will review and process the allocated tasks to be done, After completing the audit task of the financial reimbursement document in the current audit link, submit the task to the next link; the system judges whether the current document has completed the audit work of all links, and if so, updates the document status according to the audit result to complete the audit task processing process; if there is still a follow-up audit link, then re-assign tasks according to the task allocation method in the above embodiment until all the audit tasks of documents are processed.

When the relevant expense reimbursement system allocates tasks, it generally pre-runs the task processing process into workflow data according to the pre-configured fixed strategy. The query efficiency cannot meet the requirements, and the financial reimbursement documents are deeply coupled with the workflow data of task assignment. The query and assignment of to-do tasks involve the associated operation of document data and workflow data. The query and processing performance is low, which affects the processing. Timeliness, for example, reviewers have to re-query the current remaining to-do tasks after almost every to-do task is processed, which brings great performance pressure to the database and applications.

In this embodiment of the present application, a queue of tasks to be allocated is established in advance, and then multiple tasks to be processed in the queue of tasks to be allocated are allocated to users corresponding to each device according to a preset allocation method and a preset allocation rule, such as expense reimbursement After the system users complete the reimbursement documents in the system, they submit the documents for storage, and then send the information related to the review of pending tasks to the queue of tasks to be assigned through the message queue. During this process, the expense reimbursement system no longer records the pending tasks The workflow data in the task processing process decouples the financial reimbursement document data from the process data of pending task processing, reducing the amount of data in the expense reimbursement system.

According to a task allocation method provided by an embodiment of the present application, by responding to the processing request of the target device, the identification of the target device is acquired; according to the identification of the target device, the task to be processed corresponding to the target device is determined as of the current time Queue, wherein, the pending task queue contains a plurality of pending tasks; determine the expected completion time for the target device to complete the plurality of pending tasks; when the expected completion time is not earlier than the preset time Next, at least one pending task in the pending task queue is added to the pending task queue, and the at least one pending task is redistributed, which can solve the problems of inflexible assignment of pending tasks and low processing efficiency; by Establishing the queue of tasks to be assigned, wherein the queue of tasks to be assigned includes the plurality of tasks to be processed, and the plurality of tasks to be processed have priorities; according to preset allocation rules, the queue of tasks to be assigned Adding a plurality of pending tasks in the target device into the queue of pending tasks corresponding to the target device can realize the decoupling of the financial reimbursement document data and the process data of pending task processing, and reduce the amount of data in the expense reimbursement system.

It should be noted that, for the task allocation method provided in the embodiment of the present application, the execution subject may be a task allocation device, or a control module in the task allocation device for executing the task allocation method. In the embodiment of the present application, the method for performing task distribution by the task distribution device is taken as an example to describe the task distribution device provided in the embodiment of the present application.

Fig. 2 is a schematic structural diagram of a task allocation device provided by an embodiment of the present application. As shown in FIG. 2 , the task allocation apparatus 200 includes: a response module 210, configured to acquire the identification of the target device in response to a processing request of the target device; a determination module 220, configured to determine the deadline The pending task queue corresponding to the target device at the current time, wherein the pending task queue contains multiple pending tasks; the determining module 220 is further configured to determine that the target device completes the multiple pending tasks The expected completion time of the task; the recovery module 230, configured to add at least one pending task in the queue of pending tasks to the queue of tasks to be assigned when the expected completion time is not earlier than a preset time.

In an implementation manner, the determining module 220 is configured to:

The expected completion time is determined according to the historical processing time of each task to be processed by the target device.

In an implementation manner, the determining module 220 is further configured to:

According to the task type corresponding to each task to be processed and the historical processing time of the target device corresponding to each task type, the historical processing time of the target device for each task to be processed is determined.

In an implementation manner, the device 200 further includes:

An allocating module, configured to add a plurality of pending tasks in the to-be-allocated task queue to the pending task queue corresponding to the target device according to a preset allocation rule.

In an implementation manner, the allocation module is further configured to:

If the expected completion time is earlier than the preset time, at least one pending task in the pending task queue is added to the pending task queue corresponding to the target device according to a preset allocation rule.

In an implementation manner, the preset assignment rule is determined according to an identifier type of the target device, a task type of a task to be processed, and a priority of the task to be processed.

In an implementation manner, the device 200 further includes:

An establishment module, configured to establish the queue of tasks to be allocated, wherein the queue of tasks to be allocated includes the multiple tasks to be processed, and the multiple tasks to be processed have priorities.

A task allocation device provided in an embodiment of the present application is configured to use a response module to respond to a processing request of a target device to obtain the identifier of the target device; a determination module is configured to determine the Time the pending task queue corresponding to the target device, wherein the pending task queue contains a plurality of pending tasks; the determining module is further configured to determine when the target device completes the multiple pending tasks Expected completion time; recycling module, used to add at least one pending task in the pending task queue to the pending task queue under the condition that the expected completion time is not earlier than the preset time, which can solve the pending tasks The assignment is not flexible, and the processing efficiency is low.

The task allocation device provided in the embodiment of the present application can implement the various processes implemented in the embodiment of the task allocation method described in FIG. 1 and achieve the same technical effect. To avoid repetition, details are not repeated here.

The task allocation apparatus in the embodiment of the present application may be an apparatus, or may be a component, an integrated circuit, or a chip in a terminal device. The device may be a mobile electronic device or a non-mobile electronic device. Exemplarily, the mobile electronic device may be a mobile phone, a tablet computer, a notebook computer, a palmtop computer, a vehicle electronic device, a wearable device, an ultra-mobile personal computer (UMPC), a netbook or a personal digital assistant (personal digital assistant, PDA), etc., non-mobile electronic equipment can be server, network attached storage (Network Attached Storage, NAS), personal computer (personal computer, PC), television (television, TV), teller machine or self-service machine, etc., this application Examples are not specifically limited.

The task allocation device in the embodiment of the present application may be a device with an operating system. The operating system may be an Android (Android) operating system, an ios operating system, or other possible operating systems, which are not specifically limited in this embodiment of the present application.

Optionally, as shown in FIG. 3 , the embodiment of the present application further provides an electronic device 300, including a processor 301, a memory 302, and programs or instructions stored in the memory 302 and operable on the processor 301, When the program or instruction is executed by the processor 301, it is implemented: in response to the processing request of the target device, obtain the identification of the target device; according to the identification of the target device, determine the pending task queue corresponding to the target device as of the current time , wherein, the pending task queue includes a plurality of pending tasks; determining the expected completion time for the target device to complete the plurality of pending tasks; in the case that the expected completion time is not earlier than a preset time , adding at least one pending task in the pending task queue to the pending task queue.

In an implementation manner, when the above-mentioned program or instruction is executed by the processor 301, it may be realized that: according to the historical processing time of each task to be processed by the target device, the expected completion time is determined.

In one implementation manner, when the above-mentioned program or instruction is executed by the processor 301, it is realized that according to a preset assignment rule, multiple pending tasks in the pending task queue are added to the pending task queue corresponding to the target device middle.

In one implementation manner, when the above-mentioned program or instruction is executed by the processor 301, it is implemented: in the case that the expected completion time is earlier than the preset time, according to the preset allocation rule, the task queue to be allocated At least one pending task of the target device is added to the corresponding pending task queue of the target device.

In one implementation, when the above programs or instructions are executed by the processor 301, it is realized that: according to the task type corresponding to each task to be processed and the historical processing time of the target device corresponding to each task type, determine the The historical processing time of the processing task.

In one implementation manner, when the above-mentioned program or instruction is executed by the processor 301, it is implemented: establishing the queue of tasks to be allocated, wherein the queue of tasks to be allocated includes the multiple tasks to be processed, and the multiple queues of tasks to be allocated are Processing tasks have priorities.

For specific execution steps, reference may be made to each step in the above embodiment of the task allocation method, and the same technical effect can be achieved. To avoid repetition, details are not repeated here.

It should be noted that the electronic device in the embodiment of the present application includes: a server, a terminal device, or other devices except the terminal device.

The above electronic device structure does not constitute a limitation to the electronic device, and the electronic device may include more or fewer components than shown in the illustration, or combine certain components, or arrange different components, for example, an input unit may include a graphics processor (Graphics Processing Unit, GPU) and a microphone, and the display unit may be configured with a display panel in the form of a liquid crystal display, an organic light emitting diode, or the like. The user input unit includes at least one of a touch panel and other input devices. A touch panel is also called a touch screen. Other input devices may include, but are not limited to, physical keyboards, function keys (such as volume control buttons, switch buttons, etc.), trackballs, mice, and joysticks, which will not be repeated here.

The memory can be used to store software programs as well as various data. The memory may mainly include a first storage area for storing programs or instructions and a second storage area for storing data, wherein the first storage area may store an operating system, application programs or instructions required by at least one function (such as sound playback function, image playback function, etc.) etc. Also, memory may include volatile memory or nonvolatile memory, or memory may include both volatile and nonvolatile memory. Wherein, the non-volatile memory may be a read-only memory (Read-Only Memory, ROM), a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electronically programmable Erase Programmable Read-Only Memory (Electrically EPROM, EEPROM) or Flash. Volatile memory can be random access memory (Random Access Memory, RAM), static random access memory (Static RAM, SRAM), dynamic random access memory (Dynamic RAM, DRAM), synchronous dynamic random access memory (Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (Synchlink DRAM, SLDRAM) and Direct Memory Bus Random Access Memory (Direct Rambus RAM, DRRAM).

The processor may include one or more processing units; optionally, the processor integrates an application processor and a modem processor, wherein the application processor mainly handles operations related to the operating system, user interface, and application programs, and the modem The tone processor mainly processes wireless communication signals, such as a baseband processor. It can be understood that the foregoing modem processor may not be integrated into the processor.

The embodiment of the present application also provides a readable storage medium. The readable storage medium stores programs or instructions. When the program or instructions are executed by the processor, the various processes of the above-mentioned task allocation method embodiments can be achieved, and the same To avoid repetition, the technical effects will not be repeated here.

Wherein, the processor is the processor in the electronic device described in the above embodiments. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk or an optical disk, and the like.

The embodiment of the present application further provides a chip, the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the above task allocation method embodiment Each process can achieve the same technical effect, so in order to avoid repetition, it will not be repeated here.

It should be understood that the chips mentioned in the embodiments of the present application may also be called system-on-chip, system-on-chip, system-on-a-chip, or system-on-a-chip.

It should be noted that, in this document, the term "comprising", "comprising" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article or apparatus comprising a set of elements includes not only those elements, It also includes other elements not expressly listed, or elements inherent in the process, method, article, or device. Without further limitations, an element defined by the phrase "comprising a ..." does not preclude the presence of additional identical elements in the process, method, article, or apparatus comprising that element. In addition, it should be pointed out that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, and may also include performing functions in a substantially simultaneous manner or in reverse order according to the functions involved. Functions are performed, for example, the described methods may be performed in an order different from that described, and various steps may also be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

Through the description of the above embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware, but in many cases the former is better implementation. Based on such an understanding, the technical solution of the present application can be embodied in the form of a software product in essence or the part that contributes to the prior art, and the computer software product is stored in a storage medium (such as ROM/RAM, disk, CD) contains several instructions to enable a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the methods described in various embodiments of the present application.

The embodiments of the present application have been described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementations. The above-mentioned specific implementations are only illustrative and not restrictive. Those of ordinary skill in the art will Under the inspiration of this application, without departing from the purpose of this application and the scope of protection of the claims, many forms can also be made, all of which belong to the protection of this application.

Claims (10)

1. A task assignment method, characterized in that the method comprises: Responding to the processing request of the target device, acquiring the identifier of the target device; According to the identifier of the target device, determine a pending task queue corresponding to the target device as of the current time, wherein the pending task queue includes a plurality of pending tasks; determining an expected completion time for the target device to complete the plurality of pending tasks; If the expected completion time is not earlier than the preset time, at least one pending task in the pending task queue is added to the pending task queue. 2. The method according to claim 1, wherein the determining the expected completion time for the target device to complete the plurality of tasks to be processed comprises: The expected completion time is determined according to the historical processing time of each task to be processed by the target device. 3. The method according to claim 1, characterized in that, before determining the plurality of pending tasks corresponding to the target device as of the current time according to the identifier of the target device, the method further comprises: According to a preset allocation rule, adding multiple tasks to be processed in the task queue to be allocated to the task queue to be processed corresponding to the target device. 4. The method according to claim 1, characterized in that, after the determination of the expected completion time for the target device to complete the plurality of tasks to be processed, the method further comprises: If the expected completion time is earlier than the preset time, at least one pending task in the pending task queue is added to the pending task queue corresponding to the target device according to a preset allocation rule. 5. The method according to claim 2, wherein, before determining the expected completion time according to the historical processing time of each task to be processed by the target device, the method further comprises: According to the task type corresponding to each task to be processed and the historical processing time of the target device corresponding to each task type, the historical processing time of the target device for each task to be processed is determined. 6. The method according to claim 3 or 4, wherein the preset allocation rule is determined according to the type of the target device identifier, the task type of the task to be processed, and the priority of the task to be processed. 7. The method according to claim 3, wherein, according to the preset assignment rules, adding a plurality of pending tasks in the pending task queue to the pending task queue corresponding to the target device Previously, the method further included: The queue of tasks to be allocated is established, wherein the queue of tasks to be allocated includes the multiple tasks to be processed, and the multiple tasks to be processed have priorities. 8. A task distribution device, characterized in that the device comprises: A response module, configured to acquire the identity of the target device in response to the processing request of the target device; A determining module, configured to determine a pending task queue corresponding to the target device as of the current time according to the identifier of the target device, wherein the pending task queue includes a plurality of pending tasks; The determining module is further configured to determine an expected completion time for the target device to complete the plurality of tasks to be processed; A recycling module, configured to add at least one pending task in the pending task queue to the pending task queue when the expected completion time is not earlier than a preset time. 9. An electronic device, characterized in that it includes a processor, a memory, and a program or instruction stored on the memory and operable on the processor, and the program or instruction is implemented when executed by the processor. The steps of the task allocation method as claimed in any one of claims 1-7. 10. A readable storage medium, characterized in that a program or an instruction is stored on the readable storage medium, and when the program or instruction is executed by a processor, the task assignment according to any one of claims 1-7 is realized method steps.

Images