Task processing system and method for shared service center and medium

Abstract

The invention discloses a task processing system and method for a shared service center and a medium. Tasks to be processed are received and subjected to structured storage and classification to obtain priority processing levels, a predicted execution path is determined, and a task execution summary list is formed; according to the predicted execution path, entering the central task processing node to carry out packet routing scheduling and determine the packet processing node, then entering the packet processing node to carry out execution routing scheduling and determine an individual execution node, and when the individual execution node is not a final processing node in the predicted execution path, executing routing scheduling. And continuing to enter the next packet processing node in the predicted execution path to execute routing scheduling until the individual execution node is the final processing node, and marking that the task is completed. According to the method, the processing requirement of a single task is combined with the processing rules and the processing capabilities of all subsequent grouped execution nodes and individual execution nodes, so that the task can be efficiently processed through the most appropriate path, and the enterprise resources are optimally configured.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a task processing system, method and medium for a shared service center. Background Art

[0002] Shared Service Center (SSC) refers to the enterprise centralizing the same, repetitive and standardized support work and professional service work of each business unit into one organization to provide professional, large-scale and integrated unified shared services. It is a key organizational system for enterprises to improve efficiency, reduce costs and optimize resource strength. In order to ensure the efficient operation of shared services and continuous value creation, and to handle a large number of complex and repetitive tasks efficiently and at low cost, a reasonable and well-functioning task processing system is required.

[0003] The existing task processing system of the shared service center is to ensure that the tasks handled by each shared service center are assigned to the right person so that the tasks can be properly handled. It revolves around how to assign tasks. The task processing system is generally composed of three major elements, namely, the task pool, process rules, and assignment rules. Among them, the task pool displays and manages the tasks entering the shared center according to certain division rules, the process rules determine the subsequent processing path of each task, and the assignment rules determine how the tasks are assigned to specific audit employees. These three major elements will jointly determine the path through which the tasks entering the shared service center will be assigned and who will ultimately handle them. After the task is assigned to a specific audit employee, the audit employee will carry out the task processing, which is generally based on the employee's PC computer and the shared center operation management software. It can be fast and effective when facing a single task, but as the company grows and grows, when faced with a large number of tasks that need to be assigned, the processing time is difficult to meet the needs of enterprise development. Moreover, the task assignment process is assigned downward around a single node, lacks overall scheduling, and cannot estimate the service quality and service time from an overall perspective.

[0004] Based on the above problems, the applicant proposed the technical solution of this application. Summary of the invention

[0005] In order to achieve the above object, the present invention discloses a task processing system for a shared service center, comprising the following modules:

[0006] The task receiving module is used to automatically receive pending tasks from the upstream system in the form of an API interface, perform validity verification on the task information in the pending tasks, and perform structured storage on the pending tasks that pass the verification;

[0007] A priority classification module is used to classify the tasks to be processed in structured storage using a CART decision tree model to obtain the priority processing levels corresponding to the tasks to be processed;

[0008] A path prediction module, used to determine the expected execution path of the task to be processed according to the task information, the priority level and the current node status of each execution node within the jurisdiction of the shared service center, wherein each execution node includes a central task processing node, a group processing node and a personal execution node;

[0009] A task summary module, used to form a task execution summary list, sorting each pending task according to its priority level, wherein the task execution summary list includes all pending tasks that need to be processed by the shared service center;

[0010] The task dispatching module is used to enter the central task processing node for group routing scheduling according to the sorting sequence of the priority processing level, for each pending task in the task execution summary list, according to the expected execution path corresponding to the pending task, determine the group processing node that matches the pending task, and then enter the group processing node for execution routing scheduling, determine the personal execution node that matches the pending task, and when the personal execution node is not the final processing node in the expected execution path, continue to enter the next group processing node in the expected execution path for execution routing scheduling, until the personal execution node is the final processing node in the expected execution path, marking the pending task as a completed task.

[0011] Preferably, the packet routing scheduling is specifically to traverse the current node status of each packet processing node under the jurisdiction of the central task processing node one by one, and if the current node status is online, determine the packet processing node as the packet processing node matching the task to be processed.

[0012] Preferably, the execution routing scheduling is specifically to traverse the current node status of each individual execution node under the group processing node within the group processing node, and if the current node status is online, determine the individual execution node as a personal execution node that matches the task to be processed, and the online status indicates that the execution node can process the task.

[0013] Preferably, in the task dispatching module, for pending tasks with a high priority level or for pending tasks for which the expected execution path is unavailable, the expected execution path of the pending tasks is re-determined, and the expected execution path is unavailable specifically means that the current node status of any execution node in the path is offline, and the offline status indicates that the execution node cannot process the task.

[0014] Preferably, the path prediction module is also used to preset the upstream and downstream relationships between the execution nodes within the jurisdiction of the shared service center, as well as the current node status of each execution node, to obtain an available adjacency matrix, and to determine the expected execution path based on the task information and the available adjacency matrix.

[0015] Preferably, the available adjacency matrix is ​​established in the following manner:

[0016] Starting from the central task processing node within the jurisdiction of the shared service, traverse all execution nodes to obtain the total number of all nodes and a sequential total list containing at least node IDs and node names;

[0017] Traversing the sequence total table, recording the execution nodes in the online state as online nodes, and obtaining the total number of online nodes and an online sequence table containing all online nodes;

[0018] Traversing the online sequence table, comparing the preset rule set with the task information in the task to be processed, obtaining available nodes that can be used to process the task to be processed, and obtaining the total number of available nodes and an available sequence table including all available nodes;

[0019] Based on the upstream and downstream relationships, an available adjacency matrix is ​​constructed according to the execution nodes in the available sequence table. The available adjacency matrix is ​​used to represent the adjacency relationship of each available node. The size of the available adjacency matrix is ​​set according to the total number of available nodes.

[0020] Preferably, the estimated execution path is established in the following manner:

[0021] Using a breadth-first search algorithm based on the available adjacency matrix to obtain multiple execution paths;

[0022] For each execution path, starting from the central task processing node, the available sequence table is traversed. When the individual execution node in the execution path is also the final processing node of the task to be processed, the execution path is used as the expected execution path.

[0023] Preferably, for a to-be-processed task with a high priority level, an optimal path is selected from a plurality of estimated execution paths as the estimated execution path.

[0024] The present invention also discloses a task processing method for a shared service center, comprising the following steps:

[0025] Automatically receive pending tasks from the upstream system in the form of an API interface, perform validity verification on the task information in the pending tasks, and perform structured storage on the pending tasks that pass the verification;

[0026] Using the CART decision tree model, the tasks to be processed in structured storage are classified to obtain the priority levels corresponding to the tasks to be processed;

[0027] Determine the expected execution path of the task to be processed according to the task information, the priority level and the current node status of each execution node within the jurisdiction of the shared service center, wherein each execution node includes a central task processing node, a group processing node and a personal execution node;

[0028] Forming a task execution summary list, sorting each pending task according to its priority level, wherein the task execution summary list includes all pending tasks that need to be processed by the shared service center;

[0029] According to the sorting sequence of the priority processing level, for each pending task in the task execution summary list, according to the expected execution path corresponding to the pending task, enter the central task processing node for group routing scheduling, determine the group processing node that matches the pending task, and then enter the group processing node for execution routing scheduling, determine the personal execution node that matches the pending task, when the personal execution node is not the final processing node in the expected execution path, continue to enter the next group processing node in the expected execution path for execution routing scheduling, until the personal execution node is the final processing node in the expected execution path, the pending task is marked as a completed task.

[0030] The present invention also discloses a computer-readable storage medium, on which a computer program is stored. When the computer program is processed and executed, the task processing method for a shared service center is implemented.

[0031] Compared with the prior art, the present invention has the following beneficial effects:

[0032] The task processing system, method and medium for a shared service center provided by the present invention not only consider the processing requirements of a single task during the path prediction process, but also comprehensively consider the processing rules and processing capabilities of all subsequent group execution nodes and individual execution nodes. This global planning enables tasks to be efficiently processed through the most appropriate path, thereby optimizing the allocation of enterprise resources, while also improving the enterprise's response speed and effectively improving the task processing efficiency of the shared service center in the enterprise.

[0033] The concept, specific structure and technical effects of the present invention will be further described below in conjunction with the accompanying drawings to fully understand the purpose, characteristics and effects of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 It is a schematic diagram of the framework of the task processing system for a shared service center of the present invention.

[0035] Figure 2 It is a front view of a task processing terminal corresponding to the task processing system for a shared service center of the present invention when in use.

[0036] Figure 3 It is a rear view of a task processing terminal corresponding to the task processing system for a shared service center of the present invention when in use.

[0037] Figure 4 The figure is a side view of a task processing terminal corresponding to the task processing system for a shared service center of the present invention when in use.

[0038] Figure 5 It is a flowchart of the task processing method for a shared service center of the present invention. DETAILED DESCRIPTION

[0039] In order to make the technical means, creative features, objectives and effects of the invention easier to understand, the invention is further described below with reference to specific diagrams. However, the invention is not limited to the following implementation cases.

[0040] It should be noted that the structures, proportions, sizes, etc. illustrated in the drawings in this specification are only used to match the contents disclosed in the specification so as to facilitate understanding and reading by persons familiar with this technology. They are not used to limit the conditions under which the present invention can be implemented, and therefore have no substantive technical significance. Any structural modification, change in proportion or adjustment of size, without affecting the effects and purposes that can be achieved by the present invention, should still fall within the scope of the technical contents disclosed by the present invention.

[0041] The existing task processing of shared service centers lacks the full-link planning and scheduling capabilities that take into account the service level. Since task dispatch processing often revolves around a single node to dispatch tasks to the next node based on rules, the task can only be determined to which execution node it is assigned when it leaves a certain execution node and goes to the next execution node. For certain tasks with high priority, it is impossible to select the optimal link for them, and it is impossible to estimate the overall time required for task processing. This causes the subsequent processing nodes on the task processing link to respond passively to the newly added tasks, and it is impossible to estimate and prepare in advance the amount of tasks to be processed based on the information of the previous nodes. There is a lack of full-link closed-loop tracking capabilities for tasks to be processed, and it is difficult to timely grasp the workload, service efficiency, service quality and execution results of task dispatch of each execution node.

[0042] like Figure 1As shown, this embodiment discloses a task processing system for a shared service center, including a task receiving module, a priority classification module, a path prediction module, a task aggregation module and a task dispatching module.

[0043] The task receiving module is used to automatically receive pending tasks from the upstream system in the form of an API interface, and to perform validity verification on the task information in the pending tasks, and to perform structured storage on the pending tasks that have passed the verification. Taking the processing task of financial reimbursement documents as an example, the structured storage of pending tasks includes the following fields: task type, task code, task name, task initiator, initiator's rank, affiliated unit, affiliated department, reimbursement amount, task priority, business transaction type, task processing history, task status, service level requirements, and other necessary business fields required for task processing. After receiving the pending tasks, the task information in the pending tasks will be checked and verified, including whether the required fields exist, whether the field length is within the valid range, and whether the field value is within the valid range. In some examples, the processing history of the pending tasks will also be checked, such as checking whether the task is a new task or an existing task based on the task code, and checking the processing history information of the task, including whether the order is returned, the number of returns, the reason for the return, the processing time, etc.

[0044] The priority classification module is used to classify the pending tasks in structured storage using the CART decision tree model, and obtain the priority level corresponding to the pending tasks. In this embodiment, the priority level is divided into four levels, namely, extremely high priority, high priority, higher priority and ordinary priority. The CART decision tree model is used to recursively traverse each variable in the pending tasks in structured storage that matches the preset variable threshold rule. The CART decision tree divides the variables according to the set threshold to obtain the division result of whether it is urgent. After the CART decision tree completes the traversal of all variables, the frequency of occurrence of the division result is counted, and the priority level corresponding to the pending task is determined according to the frequency of occurrence. For example, if the first variable in the pending task is greater than the first threshold, the division result is regarded as urgent, if the second variable is greater than the second threshold, the division result is regarded as non-urgent, if the third variable is greater than the third threshold, the division result is regarded as urgent, at this time, the division result is urgent The frequency of occurrence is 2 times, and the frequency of occurrence of the division result is non-urgent is 1 time, then the priority level of the pending task is determined as a higher priority. Different priority levels correspond to providing different service levels for tasks.

[0045] The path prediction module is used to determine the expected execution path of the task to be processed according to the task information, the priority level and the current node status of each execution node within the jurisdiction of the shared service center, wherein each execution node includes a central task processing node, a group processing node and a personal execution node. The path prediction module is also used to preset the upstream and downstream relationships between the execution nodes within the jurisdiction of the shared service center, and the current node status of each execution node, obtain an available adjacency matrix, and determine the expected execution path according to the task information and the available adjacency matrix.

[0046] Specifically, each execution node within the jurisdiction of the shared service center is used to manage and display pending tasks and processed tasks within a certain range, and track the processing status of each task. Each execution node can be turned on or off. If the execution node is turned on, it means that the execution node is online and has the ability to process tasks. If the execution node is turned off, it means that the execution node is offline and cannot process tasks. Different execution nodes have different task processing scopes and permissions. According to the different task processing scopes, each execution node within the jurisdiction of the shared service center is divided into central task processing nodes, group processing nodes and personal execution nodes. Each shared service center has at least one central task processing node, each central task processing node has at least two group processing nodes, and each group processing node has at least two personal execution nodes. Upstream and downstream relationships are stored in each execution node. If the execution node is turned on or off, it reflects that the current node status of the execution node is online or offline.

[0047] In one example, the available adjacency matrix is ​​established in the following manner:

[0048] First, starting from the central task processing node within the jurisdiction of the shared service, all execution nodes are traversed to obtain the total number of all nodes and a sequential total table containing at least node IDs and node names.

[0049] Then, the sequence total table is traversed, and the execution nodes in the online state are recorded as online nodes, so as to obtain the total number of online nodes and an online sequence table including all online nodes.

[0050] Afterwards, the online sequence table is traversed, and the preset rule set is compared with the task information in the task to be processed, and the available nodes that can be used to process the task to be processed are obtained, and the total number of available nodes and the available sequence table including all available nodes are obtained. The preset rule set includes the task types that each execution node can process, and it can be stipulated that a certain execution node can process cost accounting. When the task type required by a task is cost accounting, the execution node is recorded as the available node of the task to be processed.

[0051] Finally, based on the upstream and downstream relationship, according to the execution nodes in the available sequence table, an available adjacency matrix is ​​constructed, and the available adjacency matrix is ​​used to represent the adjacency relationship of each available node, and the size of the available adjacency matrix is ​​set according to the total number of available nodes. The upstream and downstream relationship represents the superior-subordinate relationship between each execution node, and the total number of available nodes is represented by a, then the size of the adjacency matrix is ​​a*a.

[0052] In one example, the expected execution path is established by:

[0053] Based on the available adjacency matrix, a breadth-first search algorithm is used to obtain multiple execution paths; for each execution path, the available sequence table is traversed starting from the central task processing node, and when the individual execution node in the execution path is also the final processing node of the task to be processed, the execution path is used as the expected execution path. After traversing in this way, all execution paths in the adjacency matrix will be obtained.

[0054] In some examples, after obtaining all execution paths, pre-set check rules are used to determine whether these execution paths contain necessary execution nodes, so as to avoid skipping certain necessary execution nodes when processing certain special tasks. In some examples, the execution paths are screened according to the priority level of the task to be processed. When the priority level is high, the optimal path is recalculated. When the priority level is not high, a path is randomly selected from all execution paths as the estimated execution path. When recalculating the optimal path, the average actual processing time of each execution node when processing similar tasks is considered, and then the actual processing time of each execution node is summed to obtain the estimated total processing time of each execution path. The path with the shortest estimated total processing time is selected as the optimal path. If there are multiple execution paths with the same estimated total processing time, a path is randomly selected from them as the optimal path.

[0055] The task summary module is used to form a task execution summary list, sorting each pending task according to its priority level. The task execution summary list includes all pending tasks that need to be processed by the shared service center. That is, the execution tasks processed by the path prediction module will directly enter the central task processing node, and the central task processing node will record the arrival time and completion status of each execution task. Through the task execution summary list, the execution status of each execution task can be intuitively grasped. In the subsequent task dispatch execution process, the task execution summary list here will also be dynamically updated.

[0056] The task dispatching module is used to enter the central task processing node for group routing scheduling according to the sorting sequence of the priority processing level, for each pending task in the task execution summary list, according to the expected execution path corresponding to the pending task, determine the group processing node that matches the pending task, and then enter the group processing node for execution routing scheduling, determine the personal execution node that matches the pending task, and when the personal execution node is not the final processing node in the expected execution path, continue to enter the next group processing node in the expected execution path for execution routing scheduling, until the personal execution node is the final processing node in the expected execution path, marking the pending task as a completed task.

[0057] The packet routing scheduling is specifically to traverse the current node status of each packet processing node under the jurisdiction of the central task processing node one by one, and if the current node status is online, determine the packet processing node as the packet processing node matching the task to be processed.

[0058] The execution routing scheduling is specifically as follows: traversing the current node status of each individual execution node under the group processing node within the group processing node; if the current node status is online, determining the individual execution node as the individual execution node that matches the task to be processed; the online status indicates that the execution node can process the task.

[0059] After the unfinished pending tasks pass through the central task processing node, they are sorted according to the priority level, and the pending tasks with high priority levels are processed first. By traversing the available status of the adjacent downstream task processing nodes of the central task processing node, the appropriate group processing node is selected to process the task, that is, group routing scheduling is performed. Each pending task in the pending task list is processed according to the preset dispatching rules, for example, the processing task of the domestic travel reimbursement document is dispatched to the group processing node related to the domestic travel expense preliminary review group for processing. If the service level level or priority level of the pending task is high, the group processing node is selected according to the optimal path during the group routing scheduling process to complete the task dispatch. If the service level level or priority level of the pending task is extremely high, or the selected expected execution path is unavailable, the expected execution path needs to be re-determined. At this time, it is necessary to trigger from the current node, recalculate the execution path, and dispatch tasks according to the execution path.

[0060] In some examples, after the task is assigned, the time when the task leaves the current processing node and the actual processing time of the current processing node are recorded, and the estimated processing time of the document of this type is updated.

[0061] It should be noted that since each group task processing node includes at least two individual execution nodes, and the final processing node of each task to be processed is a personal execution node. In the task dispatching module, after the personal execution node is processed, it is necessary to determine whether the personal execution node is the final processing node. If it is not the final processing node, it will return to the group task processing node again according to the expected execution path to perform routing scheduling. This is repeated until a personal execution node is the final processing node of the task to be processed, at which time the execution of the task to be processed is completed.

[0062] In some examples, when executing tasks at individual execution nodes, corresponding personnel carry out task processing operations on the task processing terminal. The task processing terminal is used to help the staff of the shared service center to perform task processing operations, and also provides the staff with answering and calling voice calls. A rotating display screen assembly is provided on the upper half of the upper end surface of the shell of the task processing terminal, which includes a touch screen, and a camera and a microphone array are provided on the top part. The display device assembly is connected to the device shell through a rotating shaft and has a rotation function to adjust the angle of the display screen. A speaker is provided in the middle part of the upper end surface of the device, and a rotating roller and a special keyboard for task processing in the shared service center are embedded in the lower half. A power interface is installed on one side of the device, as well as an I / O panel with RJ45, RJ11, RJ9, 3.5mm audio interface and USB Type-C interface for connecting to external devices, and an ambient sound microphone is provided. The device mainboard is provided on the bottom surface of the device, which is connected to the aforementioned interfaces and devices, and includes a system-on-chip (SOC), memory, hard disk and heat dissipation device.

[0063] like Figures 2 to 4As shown, the touch screen 4 is connected to the device housing through a rotating shaft, has a rotation function to adjust the angle of the screen, and ensures the stability of the angle of the screen through a support structure 19, and is connected to the device motherboard through a cable to provide content display and touch input. The display can display task information, call and contact information, device option information, etc. The multi-touch input provided by the touch screen can help users select content, switch content, or manipulate the task processing system for the shared service center. The camera 2 on the top of the rotating display assembly is connected to the device motherboard, which can provide face recognition, help users quickly log in to the task scheduling system of the shared service center without verification, perform task processing, and can also perform employee on-the-job / off-the-job detection. The microphone array 1 on the top of the rotating display assembly is connected to the device motherboard, which can provide directional sound pickup in the hands-free call state to improve the sound quality of the voice call. The microphone 5 in the middle of the upper surface of the device is connected to the device motherboard for playing system prompt sounds or playing call sounds during hands-free calls. The selection button 6 in the middle of the upper surface of the device is connected to the device motherboard for quickly controlling the touch screen to display specific menus or content. The rotating roller 8 in the middle of the upper surface of the device is connected to the device main board, and the roller can roll around the axis to help the user zoom in and out, adjust the volume or select content. The central button of the rotating roller 3 in the middle of the upper surface of the device is connected to the device main board, which can help the user confirm the selected content. The rotating roller auxiliary button 9 in the middle of the upper surface of the device is connected to the device main board and can be used to define the object controlled by the roller. Each auxiliary button contains an LED light at the bottom. When the auxiliary button is pressed, the LED light at the bottom of the auxiliary button lights up, indicating that the function is activated. The device-specific keyboard 7 includes three areas and 22 buttons. Each button contains an LED light at the bottom. When the auxiliary button is pressed, the LED light at the bottom of the auxiliary button lights up, indicating that the function is activated.

[0064] The functionality of a dedicated keyboard is defined through the driver software, and by default its features include:

[0065] Task operation: The lower left corner of the dedicated keyboard is the task operation key area, which can be used to operate the pending tasks. There is a PASS button to give a decision on the task processing, a REJECT button to reject the task, and a HOLD button to suspend the task. In addition, there are four custom keys FN1, FN2, FN3, and FN4, which can be used for other custom functions, such as viewing task images, or opening other related systems, etc.

[0066] Task selection: The upper right corner of the dedicated keyboard is the task selection key area, which is equipped with direction keys and PREV and NEXT keys to help users quickly switch between pending tasks; there are also FN5 and FN6 custom keys that can be used for other custom functions, such as switching to other accessible task lists.

[0067] Call control: The lower right corner of the dedicated keyboard is the call control key area, which can be used to control voice calls. There is a CALL button for directly calling the contact corresponding to the pending task, a MUTE button for muting the call, and an SRC button for selecting the call mode, such as hands-free, headset, and handle.

[0068] The ambient sound microphone 10 installed on one side of the device is connected to the device motherboard and is used to work with the front panel microphone array to improve the quality of hands-free call reception. The power interface 11 is connected to the device motherboard to facilitate powering on the device. The first RJ45 interface 12 is connected to the device motherboard, allowing the device to access the LAN network or Internet voice phone via wired mode. The second RJ45 interface 13 is connected to the device motherboard, allowing the device to provide LAN network access for PC computers. The RJ11 interface 14 is connected to the device motherboard, allowing the device to access the telephone network. The two RJ9 interfaces 15 and 16 are connected to the device motherboard, allowing users to connect to the call handle or headset. The 3.5mm audio interface 17 is connected to the device motherboard, allowing users to connect to the headset. The USB Type-C interface 18 is connected to the device motherboard, allowing the device to be connected to the PC computer in a wired manner.

[0069] In some examples, the task processing system for the shared service center also includes a task prediction module, which provides the estimated processing time, estimated processing completion time, and predicted future task volume of each execution node for a single task during the processing of the tasks to be processed. Specifically, the unfinished tasks to be executed are traversed in the central task processing node to obtain an unfinished task sequence list, and then the current execution node of the unfinished task is determined for the estimated execution path of each unfinished task in the unfinished task sequence list, and the departure time of the task from the current execution node is calculated based on the arrival time of the task to the current execution node and the estimated processing time of the current execution node for the same type of tasks. When the estimated arrival time and the estimated departure time of each execution node on the execution path of all the tasks to be processed are calculated, they are classified and summarized, so as to predict the future task arrival, task departure, and task processing status of each execution node.

[0070] In some examples, the task processing system for a shared service center also includes an operation status detection module, which identifies abnormal situations that may affect the service level of each execution node during the processing of pending tasks, and issues abnormal situation alarms. For example, an alarm is issued for the total task volume of a node exceeding the limit, and an alarm is issued when the total number of tasks processed or unprocessed by a certain execution node within a certain time range approaches or exceeds the maximum processing threshold. An alarm is issued for the node processing time exceeding the limit, and an alarm is issued when the ratio of the average task processing time required by a certain execution node within a certain time range to the historical average time approaches or exceeds the maximum fatigue threshold. An alarm is issued for the total processing time of a node, and an alarm is issued when the total processing time of a certain execution node approaches or exceeds the maximum time threshold.

[0071] In order to ensure that the shared service center that provides unified shared services in the enterprise can efficiently and cost-effectively assign the tasks to be processed to appropriate employees for processing, this embodiment builds a task processing system for the shared service center, effectively improves the task processing efficiency of the shared service center in the enterprise, and has better global link planning and prediction capabilities. In the process of path prediction, not only the processing requirements of a single task are considered, but also the processing rules and processing capabilities of all subsequent group execution nodes and individual execution nodes are comprehensively considered. This global planning enables tasks to be efficiently processed through the most appropriate path, thereby optimizing the allocation of enterprise resources and improving the response speed of the enterprise. When assigning tasks, the applicable priority level and service level are determined according to the included attributes of the task itself, and the task assignment path can be flexibly adjusted to ensure that high-priority tasks can obtain the best resource allocation and service guarantee, ensure that the task flow is more efficient, and improve the service quality of the shared service center as a whole.

[0072] The second embodiment of the present invention discloses a task processing method for a shared service center, specifically: Figure 5 As shown, the following steps are included:

[0073] Task reception: automatically receiving pending tasks from the upstream system in the form of an API interface, performing validity verification on the task information in the pending tasks, and performing structured storage on the pending tasks that pass the verification.

[0074] Calculate the priority, use the CART decision tree model to classify the tasks to be processed in structured storage, and obtain the priority level corresponding to the tasks to be processed.

[0075] Perform path prediction and determine the expected execution path of the task to be processed based on the task information, the priority processing level and the current node status of each execution node under the jurisdiction of the shared service center, wherein the execution nodes include a central task processing node, a group processing node and a personal execution node.

[0076] Enter the central task processing node, form a task execution summary list, and sort each task to be processed according to its priority level. The task execution summary list includes all the tasks to be processed that need to be processed by the shared service center.

[0077] According to the sorting sequence of the priority processing level, for each pending task in the task execution summary list, according to the expected execution path corresponding to the pending task, enter the central task processing node and perform group routing scheduling to determine the group processing node that matches the pending task.

[0078] Then enter the group processing node and perform execution route scheduling to determine the personal execution node that matches the task to be processed. When the personal execution node is not the final processing node in the expected execution path, continue to enter the next group processing node in the expected execution path to perform execution route scheduling until the personal execution node is the final processing node in the expected execution path, and mark the task to be processed as a completed task.

[0079] Since the first embodiment corresponds to this embodiment, this embodiment can be implemented in conjunction with the first embodiment. The relevant technical details mentioned in the first embodiment are still valid in this embodiment, and the technical effects that can be achieved in the first embodiment can also be achieved in this embodiment. In order to reduce repetition, they are not repeated here. Accordingly, the relevant technical details mentioned in this embodiment can also be applied in the first embodiment.

[0080] The third embodiment of the present invention relates to a computer-readable storage medium having a computer program / instruction stored thereon, wherein the computer program / instruction implements the steps of the method in the second embodiment when executed by a processor.

[0081] The preferred specific embodiments of the present invention are described in detail above. It should be understood that ordinary technicians in the field can make many modifications and changes based on the concept of the present invention without creative work. Therefore, all technical solutions that can be obtained by technicians in the technical field based on the concept of the present invention through logical analysis, reasoning or limited experiments on the basis of the prior art should be within the scope of protection determined by the claims.

Claims

1. A task processing system for a shared service center, characterized in that: Includes the following modules: The task receiving module is used to automatically receive pending tasks from the upstream system in the form of an API interface, perform validity verification on the task information in the pending tasks, and perform structured storage on the pending tasks that pass the verification; A priority classification module is used to classify the tasks to be processed in structured storage using a CART decision tree model to obtain the priority processing levels corresponding to the tasks to be processed; A path prediction module, used to determine the expected execution path of the task to be processed according to the task information, the priority level and the current node status of each execution node within the jurisdiction of the shared service center, wherein each execution node includes a central task processing node, a group processing node and a personal execution node; A task summary module, used to form a task execution summary list, sorting each pending task according to its priority level, wherein the task execution summary list includes all pending tasks that need to be processed by the shared service center; The task dispatching module is used to enter the central task processing node for group routing scheduling according to the sorting sequence of the priority processing level, for each pending task in the task execution summary list, according to the expected execution path corresponding to the pending task, determine the group processing node that matches the pending task, and then enter the group processing node for execution routing scheduling, determine the personal execution node that matches the pending task, and when the personal execution node is not the final processing node in the expected execution path, continue to enter the next group processing node in the expected execution path for execution routing scheduling, until the personal execution node is the final processing node in the expected execution path, marking the pending task as a completed task.

2. The task processing system for a shared service center according to claim 1, characterized in that: The packet routing scheduling is specifically to traverse the current node status of each packet processing node under the jurisdiction of the central task processing node one by one, and if the current node status is online, determine the packet processing node as the packet processing node matching the task to be processed.

3. The task processing system for a shared service center according to claim 2, characterized in that: The execution routing scheduling is specifically as follows: traversing the current node status of each individual execution node under the group processing node within the group processing node; if the current node status is online, determining the individual execution node as the individual execution node that matches the task to be processed; the online status indicates that the execution node can process the task.

4. The task processing system for a shared service center according to claim 1, characterized in that: In the task dispatching module, for pending tasks with a high priority level or for pending tasks for which the expected execution path is unavailable, the expected execution path of the pending tasks is re-determined. The unavailability of the expected execution path means that the current node status of any execution node in the path is offline, and the offline status indicates that the execution node cannot process the task.

5. The task processing system for a shared service center according to claim 1, characterized in that: The path prediction module is also used to preset the upstream and downstream relationships between the execution nodes within the jurisdiction of the shared service center, as well as the current node status of each execution node, to obtain an available adjacency matrix, and to determine the expected execution path based on the task information and the available adjacency matrix.

6. The task processing system for a shared service center according to claim 5, characterized in that: The available adjacency matrix is ​​established in the following way: Starting from the central task processing node within the jurisdiction of the shared service, traverse all execution nodes to obtain the total number of all nodes and a sequential total list containing at least node IDs and node names; Traversing the sequence total table, recording the execution nodes in the online state as online nodes, and obtaining the total number of online nodes and an online sequence table containing all online nodes; Traversing the online sequence table, comparing the preset rule set with the task information in the task to be processed, obtaining available nodes that can be used to process the task to be processed, and obtaining the total number of available nodes and an available sequence table including all available nodes; Based on the upstream and downstream relationships, an available adjacency matrix is ​​constructed according to the execution nodes in the available sequence table. The available adjacency matrix is ​​used to represent the adjacency relationship of each available node. The size of the available adjacency matrix is ​​set according to the total number of available nodes.

7. The task processing system for a shared service center according to claim 6, characterized in that: The estimated execution path is established in the following way: Using a breadth-first search algorithm based on the available adjacency matrix to obtain multiple execution paths; For each execution path, starting from the central task processing node, the available sequence table is traversed. When the individual execution node in the execution path is also the final processing node of the task to be processed, the execution path is used as the expected execution path.

8. The task processing system for a shared service center according to claim 7, characterized in that: For a pending task with a high priority level, an optimal path is selected from multiple expected execution paths as the expected execution path.

9. A task processing method for a shared service center, characterized in that: The following steps are involved: Automatically receive pending tasks from the upstream system in the form of an API interface, perform validity verification on the task information in the pending tasks, and perform structured storage on the pending tasks that pass the verification; Using the CART decision tree model, the tasks to be processed in structured storage are classified to obtain the priority levels corresponding to the tasks to be processed; Determine the expected execution path of the task to be processed according to the task information, the priority level and the current node status of each execution node within the jurisdiction of the shared service center, wherein each execution node includes a central task processing node, a group processing node and a personal execution node; Forming a task execution summary list, sorting each pending task according to its priority level, wherein the task execution summary list includes all pending tasks that need to be processed by the shared service center; According to the sorting sequence of the priority processing level, for each pending task in the task execution summary list, according to the expected execution path corresponding to the pending task, enter the central task processing node for group routing scheduling, determine the group processing node matching the pending task, and then enter the group processing node for execution routing scheduling, determine the personal execution node matching the pending task, when the personal execution node is not the final processing node in the expected execution path, continue to enter the next group processing node in the expected execution path for execution routing scheduling, until the personal execution node is the final processing node in the expected execution path, the pending task is marked as a completed task.

10. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is processed and executed, the task processing method for a shared service center as claimed in claim 9 is implemented.

Images