Intelligent scheduling method and device for to-do tasks

Abstract

The application discloses a kind of to-be-done task intelligent scheduling method and device, the method includes: according to the task information of the to-be-done task obtained, determine the target task thread matched with to-be-done task from the multiple task threads of pre-set;The task information of to-be-done task is sent to target task thread, to make target task thread process to-be-done task;Receive the processing result of to-be-done task, and according to the processing result of to-be-done task, execute the node operation matched with to-be-done task to to-be-done task.It can be seen that the application can intelligently schedule to-be-done task according to the task information and processing result of to-be-done task, so that relevant personnel can handle to-be-done task in time, so that the scheduling matching degree of to-be-done task can be improved without the subjective will of enterprise personnel to push to-be-done task, and relevant personnel can handle to-be-done task in time with processing capacity, so as to smoothly promote the work of enterprise.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to an intelligent scheduling method and apparatus for pending tasks. Background Technology

[0002] With the rapid development of internet technology, enterprises are building more and more business information systems. To ensure the smooth operation of business, employees often send pending tasks to the business information system so that the relevant personnel can process them.

[0003] Currently, task assignment is generally done manually. However, this traditional method relies on employees subjectively pushing tasks to designated personnel, resulting in poor task matching. This leads to situations where designated personnel struggle to process tasks promptly or lack the necessary skills, hindering the smooth operation of the business. Therefore, providing a method to improve task matching is crucial. Summary of the Invention

[0004] The technical problem to be solved by the present invention is to provide a method and apparatus for intelligent scheduling of pending tasks, which can improve the scheduling matching degree of pending tasks, thereby enabling relevant personnel to have the ability to process pending tasks in a timely manner, and thus smoothly promote the work of the enterprise.

[0005] To address the aforementioned technical problems, the first aspect of this invention discloses an intelligent scheduling method for pending tasks, the method comprising:

[0006] Obtain task information for pending tasks that need to be processed; the task information includes at least one of the following: task type, task urgency, task creation status, task processing content, and task progress recipient information;

[0007] Based on the task information of the pending task, a target task thread that matches the pending task is determined from a set of multiple preset task threads.

[0008] The task information of the pending task is sent to the target task thread so that the target task thread can process the pending task.

[0009] Receive the processing result of the pending task sent by the target task thread, and perform a matching node operation on the pending task according to the processing result of the pending task; the node operation includes task cancellation operation or thread task handover operation.

[0010] As an optional implementation, in the first aspect of the present invention, determining a target task thread matching the task to be done from a preset plurality of task threads based on the task information of the task to be done includes:

[0011] Determine the thread information for each preset task thread; the thread information for each task thread includes at least one of the following: the task type processed by the task thread, the thread level of the task thread, and the historical processing time information of the task thread.

[0012] Based on the task information of the pending task and the thread information of each task thread, calculate the first matching degree between the pending task and each task thread;

[0013] From all the task threads, the task thread with a first matching degree greater than or equal to a preset first matching degree threshold is determined as the target task thread that matches the task to be done.

[0014] As an optional implementation, in the first aspect of the present invention, the target task thread includes multiple pending processing roles; the step of sending the task information of the pending task to the target task thread, so that the target task thread processes the pending task, includes:

[0015] Determine the role information of each pending processing role in the target task thread; the role information of each pending processing role includes at least one of the following: the role level of the pending processing role, the corresponding processing task type, and historical processing time information;

[0016] Based on the task information of the pending task and the role information of each pending processing role, a second matching degree between the pending task and each pending processing role is calculated, and a target processing role with a second matching degree greater than or equal to a preset second matching degree threshold is determined from all pending processing roles.

[0017] The task information of the pending task is sent to the target processing role in the target task thread so that the target processing role can process the pending task; the number of the target processing roles is greater than or equal to 1.

[0018] As an optional implementation, in the first aspect of the invention, all the said pending processing roles are determined by the following method:

[0019] When the task information of the pending task includes the task urgency, the current status information of multiple processing roles included in the target task thread is determined; the current status information of each processing role includes at least one of the following: the current task load of the processing role, the current network online / offline status, and the current network transmission quality.

[0020] Based on the current status information of each processing role, predict the task processing progress of each processing role;

[0021] Based on the urgency of the pending tasks and the task processing progress of each processing role, all pending processing roles that meet the preset task processing time conditions are determined from all processing roles; meeting the task processing time conditions means that the pending tasks can be processed within the preset time period.

[0022] As an optional implementation, in the first aspect of the present invention, the step of performing a matching node operation on the pending task based on the processing result of the pending task includes:

[0023] Based on the processing result of the pending task, determine whether the processing result of the pending task is a preset processing completion result;

[0024] When it is determined that the processing result of the pending task is not the preset processing completion result, a thread task handover operation is performed on the pending task.

[0025] When it is determined that the processing result of the pending task is the preset processing completion result, the task cancellation operation is performed on the pending task.

[0026] As an optional implementation, in the first aspect of the present invention, determining whether the processing result of the pending task is a preset processing completion result based on the processing result of the pending task includes:

[0027] Determine the number of results corresponding to the processing results of the pending tasks;

[0028] Determine whether the number of results corresponding to the processing results of the pending task is greater than or equal to a preset number threshold;

[0029] When it is determined that the number of results corresponding to the processing result of the pending task is less than the preset number threshold, it is determined that the processing result of the pending task is not the preset processing completion result.

[0030] When it is determined that the number of results corresponding to the processing result of the pending task is greater than or equal to the preset number threshold, the processing quality of the pending task is determined.

[0031] Determine whether the processing result of the pending task corresponds to the preset processing condition;

[0032] When it is determined that the processing result of the pending task is not the preset processing result, it is determined that the processing result of the pending task is not the preset processing completion result.

[0033] When it is determined that the processing result of the pending task corresponds to the preset processing condition, the processing result of the pending task is determined to be the preset processing completion result.

[0034] As an optional implementation, in the first aspect of the present invention, the step of performing a thread task handover operation on the pending task includes:

[0035] When the thread information of each task thread includes the thread level of that task thread, based on the thread level of each task thread, determine all other task threads besides the target task thread from all the task threads whose thread level is greater than or equal to the thread level of the target task thread.

[0036] Based on the thread information of each of the other task threads and the thread information of the task thread, calculate the thread similarity between each of the other task threads and the target task thread;

[0037] From all the other task threads, identify the target other task threads whose thread similarity is greater than or equal to a preset similarity threshold, and transfer the pending task to the target other task threads.

[0038] A second aspect of the present invention discloses an intelligent scheduling device for pending tasks, the device comprising:

[0039] The acquisition module is used to acquire task information of pending tasks that need to be processed; the task information includes at least one of the following: task type, task urgency, task creation status, task processing content, and task progress receiver information.

[0040] The determination module is used to determine the target task thread that matches the task to be done from a set of preset task threads based on the task information of the task to be done.

[0041] The sending module is used to send the task information of the pending task to the target task thread, so that the target task thread can process the pending task;

[0042] A receiving module is used to receive the processing result of the pending task sent by the target task thread;

[0043] The scheduling module is used to perform matching node operations on the pending tasks based on the processing results of the pending tasks; the node operations include task cancellation operations or thread task handover operations.

[0044] As an optional implementation, in a second aspect of the present invention, the method by which the determining module determines the target task thread matching the task to be done from a preset plurality of task threads based on the task information of the task to be done is specifically as follows:

[0045] Determine the thread information for each preset task thread; the thread information for each task thread includes at least one of the following: the task type processed by the task thread, the thread level of the task thread, and the historical processing time information of the task thread.

[0046] Based on the task information of the pending task and the thread information of each task thread, calculate the first matching degree between the pending task and each task thread;

[0047] From all the task threads, the task thread with a first matching degree greater than or equal to a preset first matching degree threshold is determined as the target task thread that matches the task to be done.

[0048] As an optional implementation, in the second aspect of the present invention, the target task thread includes multiple pending processing roles; the sending module sends the task information of the pending task to the target task thread, so that the target task thread processes the pending task in the following specific manner:

[0049] Determine the role information of each pending processing role in the target task thread; the role information of each pending processing role includes at least one of the following: the role level of the pending processing role, the corresponding processing task type, and historical processing time information;

[0050] Based on the task information of the pending task and the role information of each pending processing role, a second matching degree between the pending task and each pending processing role is calculated, and a target processing role with a second matching degree greater than or equal to a preset second matching degree threshold is determined from all pending processing roles.

[0051] The task information of the pending task is sent to the target processing role in the target task thread so that the target processing role can process the pending task; the number of the target processing roles is greater than or equal to 1.

[0052] As an optional implementation, in the second aspect of the invention, all the said pending processing roles are determined by the following method:

[0053] When the task information of the pending task includes the task urgency, the current status information of multiple processing roles included in the target task thread is determined; the current status information of each processing role includes at least one of the following: the current task load of the processing role, the current network online / offline status, and the current network transmission quality.

[0054] Based on the current status information of each processing role, predict the task processing progress of each processing role;

[0055] Based on the urgency of the pending tasks and the task processing progress of each processing role, all pending processing roles that meet the preset task processing time conditions are determined from all processing roles; meeting the task processing time conditions means that the pending tasks can be processed within the preset time period.

[0056] As an optional implementation, in a second aspect of the present invention, the scheduling module performs matching node operations on the pending task based on the processing result of the pending task in the following specific manner:

[0057] Based on the processing result of the pending task, determine whether the processing result of the pending task is a preset processing completion result;

[0058] When it is determined that the processing result of the pending task is not the preset processing completion result, a thread task handover operation is performed on the pending task.

[0059] When it is determined that the processing result of the pending task is the preset processing completion result, the task cancellation operation is performed on the pending task.

[0060] As an optional implementation, in the second aspect of the present invention, the scheduling module determines whether the processing result of the pending task is a preset processing completion result based on the processing result of the pending task in the following specific way:

[0061] Determine the number of results corresponding to the processing results of the pending tasks;

[0062] Determine whether the number of results corresponding to the processing results of the pending task is greater than or equal to a preset number threshold;

[0063] When it is determined that the number of results corresponding to the processing result of the pending task is less than the preset number threshold, it is determined that the processing result of the pending task is not the preset processing completion result.

[0064] When it is determined that the number of results corresponding to the processing result of the pending task is greater than or equal to the preset number threshold, the processing quality of the pending task is determined.

[0065] Determine whether the processing result of the pending task corresponds to the preset processing condition;

[0066] When it is determined that the processing result of the pending task is not the preset processing result, it is determined that the processing result of the pending task is not the preset processing completion result.

[0067] When it is determined that the processing result of the pending task corresponds to the preset processing condition, the processing result of the pending task is determined to be the preset processing completion result.

[0068] As an optional implementation, in the second aspect of the present invention, the scheduling module performs thread task handover operations on the pending tasks in the following specific manner:

[0069] When the thread information of each task thread includes the thread level of that task thread, based on the thread level of each task thread, determine all other task threads besides the target task thread from all the task threads whose thread level is greater than or equal to the thread level of the target task thread.

[0070] Based on the thread information of each of the other task threads and the thread information of the task thread, calculate the thread similarity between each of the other task threads and the target task thread;

[0071] From all the other task threads, identify the target other task threads whose thread similarity is greater than or equal to a preset similarity threshold, and transfer the pending task to the target other task threads.

[0072] A third aspect of the present invention discloses another intelligent scheduling device for to-do tasks, the device comprising:

[0073] Memory containing executable program code;

[0074] A processor coupled to the memory;

[0075] The processor calls the executable program code stored in the memory to execute the intelligent scheduling method for to-do tasks disclosed in the first aspect of the present invention.

[0076] The fourth aspect of the present invention discloses a computer storage medium storing computer instructions, which, when invoked, are used to execute the intelligent scheduling method for pending tasks disclosed in the first aspect of the present invention.

[0077] Compared with the prior art, the embodiments of the present invention have the following beneficial effects:

[0078] In this embodiment of the invention, task information of pending tasks to be processed is obtained; based on the task information, a target task thread matching the pending task is determined from a set of preset task threads; the task information of the pending task is sent to the target task thread so that the target task thread can process the pending task; the processing result of the pending task sent by the target task thread is received, and based on the processing result, a matching node operation is executed on the pending task. It is evident that implementing this invention can intelligently schedule pending tasks based on their task information and processing results, enabling relevant personnel to process them promptly. This eliminates the need for employees to subjectively push pending tasks, improving the scheduling matching rate and ensuring that relevant personnel have the capability to process them in a timely manner, thus enabling the pending tasks to be completed and smoothly advancing the company's work. Attached Figure Description

[0079] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0080] Figure 1 This is a schematic diagram of a scheduling scenario for tasks to be done, as disclosed in an embodiment of the present invention.

[0081] Figure 2 This is a flowchart illustrating an intelligent scheduling method for pending tasks disclosed in an embodiment of the present invention;

[0082] Figure 3 This is a flowchart illustrating another intelligent scheduling method for to-do tasks disclosed in an embodiment of the present invention;

[0083] Figure 4 This is a schematic diagram of the structure of an intelligent scheduling device for pending tasks disclosed in an embodiment of the present invention;

[0084] Figure 5 This is a schematic diagram of the structure of another intelligent scheduling device for pending tasks disclosed in an embodiment of the present invention. Detailed Implementation

[0085] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0086] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this invention are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, apparatus, product, or end that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or ends.

[0087] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of the invention. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0088] This invention discloses an intelligent scheduling method and apparatus for pending tasks, which can improve the scheduling matching degree of pending tasks, thereby enabling relevant personnel to have the processing ability and handle pending tasks in a timely manner, thus smoothly advancing the work of the enterprise. Detailed descriptions follow.

[0089] Example 1

[0090] Please see Figure 2 , Figure 2 This is a flowchart illustrating an intelligent scheduling method for pending tasks disclosed in an embodiment of the present invention. Figure 2The described intelligent scheduling method for to-do tasks can be applied to scheduling and processing various types of to-do tasks, such as tasks related to mobile development platforms, tasks related to object mapping relationships, tasks related to business process management, tasks related to software configuration, and tasks related to gateways, etc., and this embodiment of the invention is not limited thereto. Optionally, this method can be implemented by a to-do task scheduling system, which can be integrated into the to-do task scheduling device, or it can exist independently of the intelligent operation device, or it can be a local server or cloud server used to process the to-do task scheduling process, etc., and this embodiment of the invention is not limited thereto. Figure 2 As shown, the intelligent scheduling method for this task may include the following operations:

[0091] 101. Obtain task information for pending tasks that need to be processed.

[0092] In this embodiment of the invention, optionally, the task information includes at least one of the following: task type, task urgency, task creation status, task processing content, and task process recipient information. The task type may include tasks related to the mobile development platform, tasks related to object mapping relationships, tasks related to business process management, tasks related to software configuration, and tasks related to the gateway, etc. The task creation status may include task creator information, task creation time, etc. The task process recipient may be a person who can and needs to know the task processing progress.

[0093] 102. Based on the task information of the pending task, determine the target task thread that matches the pending task from multiple preset task threads.

[0094] In this embodiment of the invention, for example, if the task type of the pending task is a task related to software configuration, then a target task thread related to technology can be determined from a plurality of preset task threads; and if the task type of the pending task is a task related to business process management, then a target task thread related to on-site management can be determined from a plurality of preset task threads.

[0095] 103. Send the task information of the pending task to the target task thread so that the target task thread can process the pending task.

[0096] In this embodiment of the invention, the target task thread may contain multiple preset processing roles, meaning that the task to be done can be processed by one or more processing roles. For example, after the task information of the task to be done is sent to the target task thread, processing role A in the target task thread can process the task to be done. After processing role A finishes processing, it can be determined whether the number of processing results corresponding to the task to be done is greater than or equal to a preset number threshold. If not, the task to be done is transferred to processing role B in the target task thread for processing, until the number of processing results corresponding to the task to be done is greater than or equal to the preset number threshold.

[0097] 104. Receive the processing result of the pending task sent by the target task thread, and perform the matching node operation on the pending task according to the processing result of the pending task.

[0098] In this embodiment of the invention, optionally, node operations include task cancellation operations or thread task transfer operations. Specifically, the execution of a task cancellation operation means that the pending task has been processed and is well done, while the execution of a thread task transfer operation means that the pending task has not been processed or has not achieved a good processing effect after being processed by the target task thread, and thus the pending task is transferred to a task thread of the same type or the next level for processing.

[0099] As can be seen, implementing the embodiments of the present invention can intelligently schedule pending tasks based on task information and processing results, so that relevant personnel can handle pending tasks in a timely manner. In this way, there is no need for enterprise personnel to push pending tasks based on their subjective will, which can improve the scheduling and matching degree of pending tasks. This enables relevant personnel to have the ability to process pending tasks and handle them in a timely manner, thereby ensuring that pending tasks are completed and smoothly advancing the work of the enterprise.

[0100] In an optional embodiment, step 102 above, which involves determining the target task thread matching the task from a preset pool of task threads based on the task information of the task to be done, includes:

[0101] Determine the thread information for each pre-defined task thread;

[0102] Based on the task information of the pending tasks and the thread information of each task thread, calculate the first matching degree between the pending tasks and each task thread.

[0103] From all task threads, identify the task thread with a first matching degree greater than or equal to a preset first matching degree threshold, and use it as the target task thread that matches the pending task.

[0104] In this optional embodiment, the thread information of each task thread may optionally include at least one of the following: the task type processed by the task thread, the thread level of the task thread, and the historical processing time information of the task thread. For example, if the urgency of a pending task is urgent and it needs to be completed within one day, a target task thread that meets the processing time condition of the pending task can be determined from the historical processing time of each task thread, thereby reliably and accurately scheduling the pending task.

[0105] As can be seen, this optional embodiment can determine the matching target task thread for the task based on the task information of the task to be done and the thread information of each task thread. This helps to improve the reliability and accuracy of the task thread determination operation, and in turn, improves the reliability and accuracy of the scheduling operation of the task to be done, thereby improving the timeliness of the task processing and accelerating the processing speed of the task to be done.

[0106] Example 2

[0107] Please see Figure 3 , Figure 3 This is a flowchart illustrating an intelligent scheduling method for pending tasks disclosed in an embodiment of the present invention. Figure 3 The described intelligent scheduling method for to-do tasks can be applied to scheduling and processing various types of to-do tasks, such as tasks related to mobile development platforms, tasks related to object mapping relationships, tasks related to business process management, tasks related to software configuration, and tasks related to gateways, etc., and this embodiment of the invention is not limited thereto. Optionally, this method can be implemented by a to-do task scheduling system, which can be integrated into the to-do task scheduling device, or it can exist independently of the intelligent operation device, or it can be a local server or cloud server used to process the to-do task scheduling process, etc., and this embodiment of the invention is not limited thereto. Figure 3 As shown, the intelligent scheduling method for this task may include the following operations:

[0108] 201. Obtain task information for pending tasks that need to be processed.

[0109] 202. Based on the task information of the pending task, determine the target task thread that matches the pending task from multiple preset task threads.

[0110] 203. Determine the role information of each pending processing role in the target task thread.

[0111] In this embodiment of the invention, optionally, the role information for each pending processing role includes at least one of the following: the role level of the pending processing role, the corresponding processing task type, and historical processing time information. For example, if the task type of the pending task is a gateway-related task, one or more pending processing roles capable of handling gateway-related tasks can be determined from the technology-related target task threads.

[0112] Furthermore, as an optional implementation, all pending processing roles are determined in the following way:

[0113] When the task information of the pending task includes the task urgency, determine the current status information of multiple processing roles included in the target task thread;

[0114] Based on the current status information of each processing role, predict the task processing progress of each processing role;

[0115] Based on the urgency of the tasks to be done and the task processing progress of each processing role, all pending processing roles that meet the preset task processing time conditions are identified from all processing roles.

[0116] In this optional embodiment, if the task information of the pending task does not include task urgency, meaning the pending task does not require immediate processing, then it is not necessary to determine the current status information of each processing role. The pending task can simply be sent to the target processing role in the target task thread that matches the task information of the pending task. Optionally, the current status information of each processing role includes at least one of the following: the current workload of the processing role, the current network online / offline status, and the current network transmission quality. Specifically, meeting the task processing time condition means that the pending task can be processed within a preset time period. For example, when the task urgency of the pending task is urgent, the processing role whose current network online / offline status is online can be determined from all processing roles in the target task thread as a pending processing role that meets the preset task processing time condition; if there is no processing role with a current network online / offline status among all processing roles in the target task thread, then the processing role whose current workload is less than or equal to the workload threshold can be determined from all processing roles as a pending processing role that meets the preset task processing time condition.

[0117] 204. Based on the task information of the pending task and the role information of each pending processing role, calculate the second matching degree between the pending task and each pending processing role, and determine the target processing role from all pending processing roles whose second matching degree is greater than or equal to the preset second matching degree threshold.

[0118] In this embodiment of the invention, the target processing role that can process the pending task and is predicted to be able to process it well is determined from all pending processing roles.

[0119] 205. Send the task information of the pending task to the target processing role in the target task thread so that the target processing role can process the pending task.

[0120] In this embodiment of the invention, optionally, the number of target processing roles is greater than or equal to 1. Specifically, when the task to be done requires approval or joint processing by multiple processing roles, the number of target processing roles is greater than 1.

[0121] 206. Receive the processing result of the pending task sent by the target task thread, and perform the matching node operation on the pending task according to the processing result of the pending task.

[0122] In this embodiment of the invention, for other descriptions of steps 201, 202 and 206, please refer to the detailed description of steps 101, 102 and 104 in Embodiment 1. These descriptions will not be repeated in this embodiment of the invention.

[0123] As can be seen, by implementing the embodiments of the present invention, the target processing role that can process the task to be done can be determined in a targeted manner based on the task information of the task to be done and the role information of each pending processing role. This can improve the reliability and accuracy of the determination of the target processing role, thereby improving the effectiveness of processing the task to be done and accelerating the overall processing process of the task to be done.

[0124] In an optional embodiment, step 206 above, which involves performing a matching node operation on the task to be done based on the processing result of the task, includes:

[0125] Based on the processing results of the pending tasks, determine whether the processing results of the pending tasks are the preset processing completion results;

[0126] When it is determined that the processing result of the pending task is not the preset processing completion result, the pending task execution thread task handover operation is performed;

[0127] When it is determined that the processing result of the pending task is the preset processing completion result, the task cancellation operation is performed on the pending task.

[0128] In this optional embodiment, the processing result of the pending task may optionally include the number of processing results and / or the processing quality. Specifically, determining whether the processing result of the pending task is a preset completion result can be understood as follows: when the number of processing results and / or the processing quality of the pending task do not meet the target, it can be determined that the processing result of the pending task is not a preset completion result, that is, the target task thread has not been able to complete the processing of the pending task.

[0129] As can be seen, this optional embodiment can perform matching node operations on the pending tasks based on the processing results of the pending tasks, thereby performing targeted scheduling operations on the pending tasks. This helps to improve the scheduling matching degree of the pending tasks, and in turn, improves the reliability, accuracy and timeliness of the processing of the pending tasks, so that the overall work process of the enterprise can be smoothly promoted.

[0130] In another optional embodiment, the step of determining whether the processing result of the pending task is a preset completion result based on the processing result of the pending task includes:

[0131] Determine the number of results corresponding to the processing outcome of the pending tasks;

[0132] Determine whether the number of results corresponding to the processing results of the pending tasks is greater than or equal to a preset number threshold;

[0133] When it is determined that the number of results corresponding to the processing result of the pending task is less than the preset number threshold, it is determined that the processing result of the pending task is not the preset processing completion result.

[0134] When it is determined that the number of results corresponding to the processing results of the pending task is greater than or equal to the preset number threshold, the processing quality of the pending task is determined.

[0135] Determine whether the processing result of the pending task corresponds to the preset processing result;

[0136] When it is determined that the processing result of the pending task is not the preset processing result, it is determined that the processing result of the pending task is not the preset processing completion result.

[0137] When it is determined that the processing result of the pending task corresponds to the preset processing condition, the processing result of the pending task is determined to be the preset processing completion result.

[0138] In this optional embodiment, for example, such as Figure 1 As shown, Figure 1This is a schematic diagram of a task scheduling scenario disclosed in an embodiment of the present invention. After the target processing role in the target task thread completes the overall processing of the task, the processing result of the task in the target processing role is evaluated. If the task fails to obtain the preset processing completion result in the target task thread, a thread task handover operation needs to be performed on the task so that a task thread of the same type as the target task thread or a task thread at the next level can perform subsequent processing on the task.

[0139] As can be seen, this optional embodiment can intelligently determine whether the processing result of the pending task is a preset processing completion result, enriching the intelligent determination method of the pending task scheduling system for the processing status of pending tasks, improving the reliability and accuracy of the determination of the processing status of pending tasks, and thus improving the reliability and accuracy of the subsequent thread transfer operation of pending tasks, thereby reducing the occurrence of pending tasks not being processed in a timely manner.

[0140] In yet another optional embodiment, the task handover operation of the task execution thread includes:

[0141] When the thread information of each task thread includes the thread level of that task thread, based on the thread level of each task thread, determine all other task threads besides the target task thread whose thread level is greater than or equal to the thread level of the target task thread from all task threads.

[0142] Based on the thread information of each other task thread and the thread information of the task thread, calculate the thread similarity between each other task thread and the target task thread;

[0143] Identify other target task threads from all other task threads whose thread similarity is greater than or equal to a preset similarity threshold, and transfer the pending tasks to these other target task threads.

[0144] In this optional embodiment, for example, when it is necessary to perform a task transfer operation on the thread to be done and the thread level of the target task thread is level 2, it is necessary to identify all other task threads with a level greater than or equal to 2 from all task threads, and then identify other target task threads with a high similarity to the target task thread from all other task threads, so as to transfer the task to be done from the target task thread to the other target task thread.

[0145] As can be seen, this optional embodiment can specifically identify other target task threads that can perform subsequent processing of pending tasks. This can further improve the scheduling matching degree of pending tasks, thereby improving the timeliness of processing pending tasks, as well as the reliability and accuracy of processing pending tasks. This ensures that the processing flow of pending tasks is completed smoothly and that the processing effect of pending tasks meets the requirements of the proposer.

[0146] Example 3

[0147] Please see Figure 4 , Figure 4 This is a schematic diagram of the structure of an intelligent scheduling device for pending tasks disclosed in an embodiment of the present invention. Figure 4 As shown, the intelligent scheduling device for the pending tasks may include:

[0148] Module 301 is used to obtain task information of pending tasks that need to be processed;

[0149] The determination module 302 is used to determine the target task thread that matches the task to be done from a set of preset task threads based on the task information of the task to be done.

[0150] The sending module 303 is used to send the task information of the pending task to the target task thread so that the target task thread can process the pending task.

[0151] The receiving module 304 is used to receive the processing result of the pending task sent by the target task thread;

[0152] The scheduling module 305 is used to perform matching node operations on the pending tasks based on the processing results of the pending tasks.

[0153] In this embodiment of the invention, the task information includes at least one of the following: task type, task urgency, task creation status, task processing content, and task process receiver information; the node operation includes a task cancellation operation or a thread task transfer operation.

[0154] It is evident that implementation Figure 4 The intelligent scheduling device for pending tasks described can intelligently schedule pending tasks based on their task information and processing results, enabling relevant personnel to handle them in a timely manner. This eliminates the need for employees to push pending tasks based on their subjective will, improving the matching degree of scheduling and ensuring that relevant personnel have the ability to process and handle pending tasks promptly, thereby enabling the completion of pending tasks and smoothly advancing the company's work.

[0155] In an optional embodiment, the determining module 302 determines the target task thread that matches the pending task from a preset plurality of task threads based on the task information of the pending task in the following specific manner:

[0156] Determine the thread information for each pre-defined task thread;

[0157] Based on the task information of the pending tasks and the thread information of each task thread, calculate the first matching degree between the pending tasks and each task thread.

[0158] From all task threads, identify the task thread with a first matching degree greater than or equal to a preset first matching degree threshold, and use it as the target task thread that matches the pending task.

[0159] In this optional embodiment, the thread information of each task thread includes at least one of the task type processed by the task thread, the thread level of the task thread, and the historical processing time information of the task thread.

[0160] It is evident that implementation Figure 4 The intelligent scheduling device for pending tasks described can determine the matching target task thread for the pending task based on the task information of the pending task and the thread information of each task thread. This helps to improve the reliability and accuracy of the task thread determination operation, and in turn, improves the reliability and accuracy of the scheduling operation of pending tasks, thereby improving the timeliness of the processing of pending tasks and accelerating the processing speed of pending tasks.

[0161] In another optional embodiment, the sending module 303 sends the task information of the pending task to the target task thread, so that the target task thread processes the pending task in the following specific manner:

[0162] Determine the role information of each pending processing role in the target task thread;

[0163] Based on the task information of the pending tasks and the role information of each pending processing role, calculate the second matching degree between the pending tasks and each pending processing role, and determine the target processing role from all pending processing roles whose second matching degree is greater than or equal to the preset second matching degree threshold.

[0164] The task information of the pending task is sent to the target processing role in the target task thread so that the target processing role can process the pending task.

[0165] In this optional embodiment, the target task thread includes multiple pending processing roles; the role information of each pending processing role includes at least one of the following: the role level of the pending processing role, the corresponding processing task type, and historical processing time information; the number of roles of the target processing role is greater than or equal to 1.

[0166] Furthermore, as an optional implementation, all pending processing roles are determined in the following way:

[0167] When the task information of the pending task includes the task urgency, determine the current status information of multiple processing roles included in the target task thread;

[0168] Based on the current status information of each processing role, predict the task processing progress of each processing role;

[0169] Based on the urgency of the tasks to be done and the task processing progress of each processing role, all pending processing roles that meet the preset task processing time conditions are identified from all processing roles.

[0170] Optionally, the current status information for each processing role includes at least one of the following: the current workload of that processing role, the current network online / offline status, and the current network transmission quality. Specifically, meeting the task processing time condition means that the pending tasks can be processed within a preset time period.

[0171] It is evident that implementation Figure 4 The intelligent scheduling device for pending tasks described can determine the matching target task thread for the pending task based on the task information of the pending task and the thread information of each task thread. This helps to improve the reliability and accuracy of the task thread determination operation, and in turn, improves the reliability and accuracy of the scheduling operation of pending tasks, thereby improving the timeliness of the processing of pending tasks and accelerating the processing speed of pending tasks.

[0172] In another optional embodiment, the scheduling module 305 executes matching node operations on the pending tasks based on the processing results of the pending tasks in the following specific manner:

[0173] Based on the processing results of the pending tasks, determine whether the processing results of the pending tasks are the preset processing completion results;

[0174] When it is determined that the processing result of the pending task is not the preset processing completion result, the pending task execution thread task handover operation is performed;

[0175] When it is determined that the processing result of the pending task is the preset processing completion result, the task cancellation operation is performed on the pending task.

[0176] It is evident that implementation Figure 4 The intelligent scheduling device for pending tasks described can perform matching node operations on pending tasks based on the processing results of the pending tasks, thereby performing targeted scheduling operations on the pending tasks. This helps to improve the matching degree of the scheduling of pending tasks, and in turn, improves the reliability, accuracy and timeliness of the processing of pending tasks, so as to enable the smooth progress of the overall work process of the enterprise.

[0177] In another optional embodiment, the scheduling module 305 determines whether the processing result of the pending task is a preset completion result based on the processing result of the pending task in the following specific way:

[0178] Determine the number of results corresponding to the processing outcome of the pending tasks;

[0179] Determine whether the number of results corresponding to the processing results of the pending tasks is greater than or equal to a preset number threshold;

[0180] When it is determined that the number of results corresponding to the processing result of the pending task is less than the preset number threshold, it is determined that the processing result of the pending task is not the preset processing completion result.

[0181] When it is determined that the number of results corresponding to the processing results of the pending task is greater than or equal to the preset number threshold, the processing quality of the pending task is determined.

[0182] Determine whether the processing result of the pending task corresponds to the preset processing result;

[0183] When it is determined that the processing result of the pending task is not the preset processing result, it is determined that the processing result of the pending task is not the preset processing completion result.

[0184] When it is determined that the processing result of the pending task corresponds to the preset processing condition, the processing result of the pending task is determined to be the preset processing completion result.

[0185] It is evident that implementation Figure 4 The intelligent scheduling device for pending tasks described can intelligently determine whether the processing result of pending tasks is a preset completion result. This enriches the intelligent judgment method of pending task scheduling system, improves the reliability and accuracy of the judgment of pending task processing status, and further improves the reliability and accuracy of subsequent thread transfer operations of pending tasks, thereby reducing the occurrence of pending tasks not being processed in a timely manner.

[0186] In yet another optional embodiment, the scheduling module 305 performs the task handover operation for the pending task execution thread in the following specific manner:

[0187] When the thread information of each task thread includes the thread level of that task thread, based on the thread level of each task thread, determine all other task threads besides the target task thread whose thread level is greater than or equal to the thread level of the target task thread from all task threads.

[0188] Based on the thread information of each other task thread and the thread information of the task thread, calculate the thread similarity between each other task thread and the target task thread;

[0189] Identify other target task threads from all other task threads whose thread similarity is greater than or equal to a preset similarity threshold, and transfer the pending tasks to these other target task threads.

[0190] It is evident that implementation Figure 4 The intelligent scheduling device for pending tasks described can specifically identify other target task threads that can perform subsequent processing on pending tasks. This can further improve the scheduling matching degree of pending tasks, thereby improving the timeliness of processing pending tasks, as well as the reliability and accuracy of processing pending tasks. This ensures that the processing flow of pending tasks is completed smoothly and that the processing effect of pending tasks meets the needs of the proposer.

[0191] Example 4

[0192] Please see Figure 5 , Figure 5 This is a schematic diagram of the structure of another intelligent scheduling device for pending tasks disclosed in an embodiment of the present invention. For example... Figure 5 As shown, the intelligent scheduling device for the pending tasks may include:

[0193] Memory 401 storing executable program code;

[0194] Processor 402 coupled to memory 401;

[0195] The processor 402 calls the executable program code stored in the memory 401 to execute the steps in the intelligent scheduling method for to-do tasks described in Embodiment 1 or Embodiment 2 of the present invention.

[0196] Example 5

[0197] This invention discloses a computer storage medium storing computer instructions. When these computer instructions are invoked, they are used to execute the steps of the intelligent scheduling method for pending tasks described in Embodiment 1 or Embodiment 2 of this invention.

[0198] Example 6

[0199] This invention discloses a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to perform the steps of the intelligent scheduling method for to-do tasks described in Embodiment 1 or Embodiment 2.

[0200] The device embodiments described above are merely illustrative. The modules described as separate components may or may not be physically separate. The components shown as modules may or may not be physical modules; that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0201] Through the detailed description of the above embodiments, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, including read-only memory (ROM), random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), one-time programmable read-only memory (OTPROM), electrically-Erasable Programmable Read-Only Memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, disk storage, magnetic tape storage, or any other computer-readable medium that can be used to carry or store data.

[0202] Finally, it should be noted that the intelligent scheduling method and apparatus for pending tasks disclosed in the embodiments of the present invention are merely preferred embodiments of the present invention and are only used to illustrate the technical solutions of the present invention, not to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. An intelligent scheduling method for pending tasks, characterized in that, The method includes: Obtain task information for pending tasks that need to be processed; the task information includes at least one of the following: task type, task urgency, task creation status, task processing content, and task progress recipient information; Determine the thread information for each preset task thread; the thread information for each task thread includes at least one of the following: the task type processed by the task thread, the thread level of the task thread, and the historical processing time information of the task thread. Based on the task information of the pending task and the thread information of each task thread, calculate the first matching degree between the pending task and each task thread; From all the task threads, the task thread whose first matching degree is greater than or equal to the preset first matching degree threshold is determined as the target task thread that matches the task to be done. The task information of the pending task is sent to the target task thread so that the target task thread can process the pending task. Receive the processing result of the pending task sent by the target task thread, and perform a matching node operation on the pending task according to the processing result of the pending task; the node operation includes task cancellation operation or thread task handover operation.

2. The intelligent scheduling method for pending tasks according to claim 1, characterized in that, The target task thread includes multiple pending processing roles; Sending the task information of the pending task to the target task thread so that the target task thread can process the pending task includes: Determine the role information of each pending processing role in the target task thread; the role information of each pending processing role includes at least one of the following: the role level of the pending processing role, the corresponding processing task type, and historical processing time information; Based on the task information of the pending task and the role information of each pending processing role, a second matching degree between the pending task and each pending processing role is calculated, and a target processing role with a second matching degree greater than or equal to a preset second matching degree threshold is determined from all pending processing roles. The task information of the pending task is sent to the target processing role in the target task thread so that the target processing role can process the pending task; the number of the target processing roles is greater than or equal to 1.

3. The intelligent scheduling method for pending tasks according to claim 2, characterized in that, All the aforementioned pending processing roles were determined in the following way: When the task information of the pending task includes the task urgency, the current status information of multiple processing roles included in the target task thread is determined; the current status information of each processing role includes at least one of the following: the current task load of the processing role, the current network online / offline status, and the current network transmission quality. Based on the current status information of each processing role, predict the task processing progress of each processing role; Based on the urgency of the tasks to be done and the task processing progress of each processing role, determine all pending processing roles that meet the preset task processing time conditions from all processing roles. Meeting the task processing time condition means that the pending task can be processed within a preset time period.

4. The intelligent scheduling method for pending tasks according to claim 3, characterized in that, The step of performing matching node operations on the pending tasks based on the processing results of the pending tasks includes: Based on the processing result of the pending task, determine whether the processing result of the pending task is a preset processing completion result; When it is determined that the processing result of the pending task is not the preset processing completion result, a thread task handover operation is performed on the pending task. When it is determined that the processing result of the pending task is the preset processing completion result, the task cancellation operation is performed on the pending task.

5. The intelligent scheduling method for pending tasks according to claim 4, characterized in that, The step of determining whether the processing result of the pending task is a preset completion result based on the processing result of the pending task includes: Determine the number of results corresponding to the processing results of the pending tasks; Determine whether the number of results corresponding to the processing results of the pending task is greater than or equal to a preset number threshold; When it is determined that the number of results corresponding to the processing result of the pending task is less than the preset number threshold, it is determined that the processing result of the pending task is not the preset processing completion result. When it is determined that the number of results corresponding to the processing result of the pending task is greater than or equal to the preset number threshold, the processing quality of the pending task is determined. Determine whether the processing result of the pending task corresponds to the preset processing condition; When it is determined that the processing result of the pending task is not the preset processing result, it is determined that the processing result of the pending task is not the preset processing completion result. When it is determined that the processing result of the pending task corresponds to the preset processing condition, the processing result of the pending task is determined to be the preset processing completion result.

6. The intelligent scheduling method for pending tasks according to claim 4 or 5, characterized in that, The step of performing thread task handover operation on the pending task includes: When the thread information of each task thread includes the thread level of that task thread, based on the thread level of each task thread, determine all other task threads besides the target task thread from all the task threads whose thread level is greater than or equal to the thread level of the target task thread. Based on the thread information of each of the other task threads and the thread information of the task thread, calculate the thread similarity between each of the other task threads and the target task thread; From all the other task threads, identify the target other task threads whose thread similarity is greater than or equal to a preset similarity threshold, and transfer the pending task to the target other task threads.

7. An intelligent scheduling device for pending tasks, characterized in that, The apparatus is used to perform the intelligent scheduling method for pending tasks as described in any one of claims 1-6, and the apparatus comprises: The acquisition module is used to acquire task information of pending tasks that need to be processed; the task information includes at least one of the following: task type, task urgency, task creation status, task processing content, and task progress receiver information. The determination module is used to determine the target task thread that matches the task to be done from a set of preset task threads based on the task information of the task to be done. The sending module is used to send the task information of the pending task to the target task thread, so that the target task thread can process the pending task; A receiving module is used to receive the processing result of the pending task sent by the target task thread; The scheduling module is used to perform matching node operations on the pending tasks based on the processing results of the pending tasks; the node operations include task cancellation operations or thread task handover operations.

8. An intelligent scheduling device for pending tasks, characterized in that, The device includes: Memory containing executable program code; A processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the intelligent scheduling method for pending tasks as described in any one of claims 1-6.

9. A computer storage medium, characterized in that, The computer storage medium stores computer instructions, which, when invoked, are used to execute the intelligent scheduling method for pending tasks as described in any one of claims 1-6.

Images