Process approval management method and system
By querying historical tasks and constructing a preset node set in the process approval management, the nodes to be approved and the parameters to be passed are dynamically determined, which solves the problem of poor system reusability in traditional methods and achieves efficient process management and improved development efficiency.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-12-17
- Publication Date
- 2026-04-03
AI Technical Summary
Traditional workflow approval methods require writing dedicated logic for each process, resulting in poor system reusability. In particular, key aspects such as historical approval task query, cross-node parameter passing, and matching of pending approval nodes require repeated development of customized code, and extensive modifications are needed when business processes change.
By querying the historical tasks of the current process instance, and using the preset set of approval nodes and parameter copy configuration table, the nodes to be approved and their successor tasks are dynamically determined. An approval progress list containing node identifiers, approver information and node sorting is constructed, realizing the dynamic acquisition of nodes to be approved and approvers and the standardized display of historical approval opinions.
It improves system reusability, reduces system code redundancy and logical complexity, enhances development efficiency and process management maintainability, and adapts to complex approval models.
Smart Images
Figure CN121788061A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of computer technology, and in particular to a process approval management method and system. Background Technology
[0002] With the rapid development of information technology, enterprises are increasingly reliant on IT applications, and workflow applications are becoming more and more widespread. In actual enterprise applications, process instances often involve multiple approval methods such as serial and parallel processing, and there are complex requirements such as dynamically allocating approval nodes and dynamically adjusting node approvers. Therefore, higher demands are placed on the flexibility of process management.
[0003] Currently, traditional workflow approval methods require writing dedicated logic for each workflow. In particular, in key areas such as querying historical approval tasks, passing parameters across nodes, and matching nodes to be approved, customized code needs to be repeatedly developed.
[0004] However, traditional workflow approval methods that require writing dedicated logic for each process involve complex historical task queries, node matching, and parameter passing. Once the business process changes, the relevant code needs to be modified in batches, resulting in poor system reusability. Summary of the Invention
[0005] This invention provides a process approval management method and system that can improve the reusability of the system.
[0006] In a first aspect, embodiments of the present invention provide a process approval management method, the method comprising:
[0007] Query at least one historical task in the current process instance, and determine the current node to be approved based on the at least one historical task;
[0008] Based on a pre-constructed set of preset approval nodes, at least one target preset approval node is determined for at least one subsequent task of the current node to be approved.
[0009] According to the configuration rules of the parameter copy configuration table, the parameters to be copied are selected from the at least one subsequent task and copied to the current parameter set corresponding to the current node to be approved;
[0010] An approval progress list is constructed based on the current parameter set and the at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting.
[0011] Preferably,
[0012] The step of querying at least one historical task in the current process instance and determining the current node to be approved based on the at least one historical task includes:
[0013] Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request;
[0014] Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number;
[0015] Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks.
[0016] The task node that ranks last in the sorting results is selected and identified as the current node to be approved.
[0017] Preferably,
[0018] Before querying at least one historical task in the current process instance and determining the current node to be approved based on the at least one historical task, the method further includes:
[0019] A preset set of approval nodes is pre-constructed, wherein the preset set of approval nodes includes at least: node identifier and node association parameter fields;
[0020] The process of determining at least one target preset approval node corresponding to at least one subsequent task of the current approval node based on a pre-built preset approval node set includes:
[0021] The node information of the current node to be approved is determined based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information;
[0022] Based on the current approval path information corresponding to the current node to be approved, at least one subsequent task associated with the current node to be approved is selected from the preset set of approval nodes;
[0023] Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set;
[0024] When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task;
[0025] Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval node.
[0026] Preferably,
[0027] The step of selecting parameters to be copied from at least one subsequent task and copying them to the current parameter set corresponding to the current node awaiting approval, according to the configuration rules of the parameter copy configuration table, includes:
[0028] The parameter copy configuration table is pre-built, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier;
[0029] Extract at least one successor task and its corresponding node identifier from the current node awaiting approval;
[0030] Iterate through the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table;
[0031] The filter node identifier exists in at least one target successor task in the source node identifier of the parameter copy configuration table;
[0032] Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved.
[0033] Preferably,
[0034] Before querying at least one historical task in the current process instance and determining the current node to be approved based on the at least one historical task, the method further includes:
[0035] A list of nodes to be assigned and corresponding insertion rules are pre-configured. The list of nodes to be assigned includes: node identifier and node approver. The insertion rules include: predecessor node identifier and insertion order priority.
[0036] After constructing the approval progress list based on the current parameter set and the at least one target preset approval node, the process further includes:
[0037] The approval progress list is traversed in reverse order based on the node sorting, and it is determined whether each node in the approval progress list exists in the list of nodes to be assigned.
[0038] When none of the nodes in the approval progress list exist in the node to be assigned parameter list, the node to be assigned is inserted into the target position of the approval progress list according to the insertion rule to generate the target approval progress list;
[0039] The target approval progress list is output as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.
[0040] Secondly, embodiments of the present invention provide a process approval management system, the system comprising:
[0041] Query module: used to query at least one historical task in the current process instance, and determine the current node to be approved based on the at least one historical task;
[0042] Determination module: used to determine at least one target preset approval node corresponding to at least one subsequent task of the current approval node based on a pre-built preset approval node set;
[0043] Parameter copy module: used to select parameters to be copied from the at least one subsequent task and copy them to the current parameter set corresponding to the current node to be approved, according to the configuration rules of the parameter copy configuration table;
[0044] Approval Management Module: Used to construct an approval progress list based on the current parameter set and the at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting.
[0045] Preferably,
[0046] The query module is used to execute:
[0047] Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request;
[0048] Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number;
[0049] Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks.
[0050] The task node that ranks last in the sorting results is selected and identified as the current node to be approved.
[0051] Preferably,
[0052] Prior to the query module, a pre-construction module is further included;
[0053] The pre-built module is used to pre-build a set of preset approval nodes, wherein the set of preset approval nodes includes at least: node identifier and node association parameter fields;
[0054] The determining module is used to perform:
[0055] The node information of the current node to be approved is determined based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information;
[0056] Based on the current approval path information corresponding to the current node to be approved, at least one subsequent task associated with the current node to be approved is selected from the preset set of approval nodes;
[0057] Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set;
[0058] When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task;
[0059] Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval node.
[0060] Preferably,
[0061] The parameter copy module is used to perform:
[0062] The parameter copy configuration table is pre-built, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier;
[0063] Extract at least one successor task and its corresponding node identifier from the current node awaiting approval;
[0064] Iterate through the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table;
[0065] The filter node identifier exists in at least one target successor task in the source node identifier of the parameter copy configuration table;
[0066] Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved.
[0067] Preferably,
[0068] Prior to the query module, a pre-configuration module is further included;
[0069] The pre-configuration module is used to pre-configure the list of node parameters to be assigned and the corresponding insertion rules. The list of node parameters to be assigned includes: node identifier and node approver. The insertion rules include: predecessor node identifier and insertion order priority.
[0070] Following the approval management module, the system further includes: a module for assignment.
[0071] The module to be assigned is used to execute:
[0072] The approval progress list is traversed in reverse order based on the node sorting, and it is determined whether each node in the approval progress list exists in the list of nodes to be assigned.
[0073] When none of the nodes in the approval progress list exist in the node to be assigned parameter list, the node to be assigned is inserted into the target position of the approval progress list according to the insertion rule to generate the target approval progress list;
[0074] The target approval progress list is output as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.
[0075] This invention provides a process approval management method and system. The method first queries all historical tasks in the current process instance to accurately locate the current pending approval node, using this historical task data as a benchmark for approval progress. Next, based on a pre-built set of preset approval nodes, it determines the target preset pending approval node corresponding to the subsequent tasks following the current pending approval node. Then, according to a parameter copy configuration table, it filters out parameters to be copied from all subsequent tasks and executes parameter transfer according to rules, copying the parameters to be copied to the current parameter set of the current pending approval node. Finally, based on the current parameter set and the target preset approval node, it filters valid approval paths and dynamically constructs a complete approval chain including node identifiers, approver information, and node order. The above process proposes a generalized encapsulation method that can uniformly achieve the dynamic acquisition of pending approval nodes and approvers, as well as the standardized display of historical approval opinions. It eliminates the need to write dedicated logic for different processes, reducing system code redundancy and logical complexity while improving development efficiency and process management maintainability, thereby significantly improving system reusability. Attached Figure Description
[0076] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0077] Figure 1 This is a flowchart of a process approval management method provided in an embodiment of the present invention;
[0078] Figure 2 This is a flowchart of another process approval management method provided in an embodiment of the present invention;
[0079] Figure 3 This is a schematic diagram of a workflow approval management system provided in an embodiment of the present invention;
[0080] Figure 4 This is a schematic diagram of another process approval management system provided in an embodiment of the present invention;
[0081] Figure 5 This is a schematic diagram of another process approval management system provided in an embodiment of the present invention. Detailed Implementation
[0082] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative effort are within the scope of protection of the present invention.
[0083] like Figure 1 As shown in the figure, this embodiment of the invention provides a process approval management method, which may include the following steps:
[0084] Step 101: Query at least one historical task in the current process instance, and determine the current node to be approved based on at least one historical task;
[0085] Step 102: Based on the pre-built set of preset approval nodes, determine at least one target preset approval node corresponding to at least one subsequent task of the current node to be approved;
[0086] Step 103: Based on the configuration rules of the parameter copy configuration table, select the parameters to be copied from at least one subsequent task and copy them to the current parameter set corresponding to the current node to be approved;
[0087] Step 104: Construct an approval progress list based on the current parameter set and at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting.
[0088] This invention provides a process approval management method. The method first queries all historical tasks in the current process instance to accurately locate the current pending approval node, using this historical task data as a benchmark for approval progress. Next, based on a pre-built set of preset approval nodes, it determines the target preset pending approval node corresponding to the subsequent tasks following the current pending approval node. Then, according to a parameter copy configuration table, it filters out parameters to be copied from all subsequent tasks and executes parameter transfer according to rules, copying the parameters to be copied to the current parameter set of the current pending approval node. Finally, based on the current parameter set and the target preset approval node, it filters valid approval paths and dynamically constructs a complete approval chain including node identifiers, approver information, and node order. The above process proposes a generalized encapsulation method that can uniformly achieve the dynamic acquisition of pending approval nodes and approvers, as well as the standardized display of historical approval opinions. It eliminates the need to write dedicated logic for different processes, reducing system code redundancy and logical complexity while improving development efficiency and process management maintainability, thereby significantly improving system reusability.
[0089] To determine the current node awaiting approval, in one embodiment of the present invention, step 101 in the above embodiment includes:
[0090] Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request;
[0091] Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number;
[0092] Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks.
[0093] The task node that ranks last in the sorting results is selected and identified as the current node to be approved.
[0094] In this embodiment of the invention, to determine the current node awaiting approval, the current process instance number (i.e., process ID) is first extracted synchronously when receiving the current user's current process instance request. This allows for the automatic generation of complete approval progress information by simply passing in key parameters such as the process instance number. Next, the historical task query interface of the workflow engine (e.g., the Activiti engine) is called to accurately query at least one historical task in the current process instance. Activiti, as an enterprise-level workflow engine, supports complex approval modes such as serial and parallel processing, as well as dynamic node allocation. Then, the API provided by the Activiti engine can be used to determine the task completion time of each historical task, and these historical tasks are sorted in ascending order according to their completion time. Finally, the task node at the bottom of the sorted results is determined as the current node awaiting approval, laying the data foundation for the generation of the subsequent approval progress list.
[0095] To determine the target preset approval node, in one embodiment of the present invention, before step 101, the following is further included:
[0096] A preset set of approval nodes is pre-constructed, wherein the preset set of approval nodes includes at least: node identifier and node association parameter fields;
[0097] Step 102 includes:
[0098] The node information of the current node to be approved is determined based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information;
[0099] Based on the current approval path information corresponding to the current node to be approved, at least one subsequent task associated with the current node to be approved is selected from the preset set of approval nodes;
[0100] Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set;
[0101] When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task;
[0102] Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval node.
[0103] In this embodiment of the invention, to determine the target preset node to be approved, firstly, a preset set of approval nodes containing node identifiers and node association parameter fields is pre-constructed; then, the node information of the current node to be approved is determined based on the preset set of approval nodes; next, based on the current approval path information contained in the node information of the current node to be approved, all subsequent tasks associated with the current node to be approved are filtered from the preset set of approval nodes; then, it is determined whether the association parameter fields of all the above-mentioned subsequent tasks exist in the current parameter set, and if they are determined to exist, the corresponding initial preset node to be approved is extracted to clarify the approval path after the current node to be approved; finally, the task completion time of each initial preset node to be approved is queried, and the initial preset nodes to be approved with completion times later than the current node to be approved are determined as the target preset node to be approved, so as to lay a data foundation for the construction of the subsequent approval progress list.
[0104] To achieve dynamic copying of parameters, in one embodiment of the present invention, step 103 in the above embodiment may specifically include the following steps:
[0105] The parameter copy configuration table is pre-built, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier;
[0106] Extract at least one successor task and its corresponding node identifier from the current node awaiting approval;
[0107] Iterate through the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table;
[0108] The filter node identifier exists in at least one target successor task in the source node identifier of the parameter copy configuration table;
[0109] Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved.
[0110] In this embodiment of the invention, to achieve dynamic parameter copying, firstly, a parameter copying configuration table is pre-constructed, containing source node identifiers, a list of parameters to be copied, and target node identifiers. Next, all task records following the current node to be approved and their corresponding node identifiers are extracted, and these subsequent tasks are traversed to determine whether the node identifier of each subsequent task exists in the source node identifier of the parameter copying configuration table, so as to filter out the target subsequent task with matching node identifiers. Finally, parameters to be copied are filtered from the current task according to the configuration rules and copied to the current parameter set corresponding to the current node to be approved. Through dynamic parameter transfer, the automated construction of the approval progress is achieved, ensuring the completeness and accuracy of the displayed approval path.
[0111] To automate the construction of the approval progress, in one embodiment of the present invention, the above embodiment further includes the following before step 101:
[0112] A list of nodes to be assigned and corresponding insertion rules are pre-configured. The list of nodes to be assigned includes: node identifier and node approver. The insertion rules include: predecessor node identifier and insertion order priority.
[0113] Following step 104, the method further includes:
[0114] The approval progress list is traversed in reverse order based on the node sorting, and it is determined whether each node in the approval progress list exists in the list of nodes to be assigned.
[0115] When none of the nodes in the approval progress list exist in the node to be assigned parameter list, the node to be assigned is inserted into the target position of the approval progress list according to the insertion rule to generate the target approval progress list;
[0116] The target approval progress list is output as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.
[0117] In this embodiment of the invention, to automate the construction of the approval progress, firstly, a list of nodes to be assigned, including node identifiers and approvers, is pre-configured, along with insertion rules including predecessor node identifiers and insertion priority. Next, the constructed approval progress list is traversed in reverse order, determining whether each node in the approval progress list exists in the list of nodes to be assigned passed to the method. If none of the nodes in the approval progress list exist in the list of nodes to be assigned, the nodes to be assigned are inserted into their corresponding positions in the approval progress list according to the insertion rules (e.g., the rule defined in the node information as "insert after the specified node in the progress list"), generating the target approval progress list and thus forming a complete approval path. Finally, the target approval progress list is output as a standardized approval progress view, which fully displays historical approval opinions, nodes to be approved, and approver information. This process, through an intelligent node matching mechanism, automates the construction of the approval progress, ensuring the completeness and accuracy of the approval path display. This significantly improves development efficiency, system maintainability, and the accuracy of process management, enhancing the system's adaptability to complex approval modes such as serial and parallel processing.
[0118] like Figure 2 As shown, in order to more clearly illustrate the technical solution and advantages of the present invention, the following is a detailed description of a process approval management method provided by an embodiment of the present invention, which may specifically include the following steps:
[0119] Step 201: Pre-construct a preset set of approval nodes, wherein the preset set of approval nodes includes at least: node identifier and node association parameter fields;
[0120] Step 202: Pre-configure the list of node parameters to be assigned and the corresponding insertion rules, wherein the list of node parameters to be assigned includes: node identifier to be assigned and node approver, and the insertion rules include: predecessor node identifier and insertion order priority;
[0121] Step 203: Pre-build the parameter copy configuration table, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier;
[0122] Step 204: Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request;
[0123] Step 205: Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number;
[0124] Step 206: Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks.
[0125] Step 207: Filter the task node that is last in the sorting results and determine the task node that is last in the sorting results as the current node to be approved;
[0126] Step 208: Determine the node information of the current node to be approved based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information;
[0127] Step 209: Based on the current approval path information corresponding to the current node to be approved, select at least one subsequent task associated with the current node to be approved from the preset set of approval nodes;
[0128] Step 210: Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set;
[0129] Step 211: When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task;
[0130] Step 212: Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval nodes;
[0131] Step 213: Extract at least one successor task and its corresponding node identifier for the current node to be approved;
[0132] Step 214: Traverse the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table;
[0133] Step 215: Filter at least one target successor task whose node identifier exists in the source node identifier of the parameter copy configuration table;
[0134] Step 216: Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved;
[0135] Step 217: Construct an approval progress list based on the current parameter set and the at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting;
[0136] Step 218: Traverse the approval progress list in reverse order based on the node sorting, and determine whether each node in the approval progress list exists in the list of nodes to be assigned.
[0137] Step 219: When none of the nodes in the approval progress list exist in the node parameter list to be assigned, insert the node to be assigned into the target position of the approval progress list according to the insertion rule to generate the target approval progress list;
[0138] Step 220: Output the target approval progress list as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.
[0139] like Figure 3 As shown in the figure, an embodiment of the present invention provides a process approval management system, which includes:
[0140] Query module 301: used to query at least one historical task in the current process instance, and determine the current node to be approved based on the at least one historical task;
[0141] Determining module 302: used to determine at least one target preset approval node corresponding to at least one subsequent task of the current approval node based on a pre-constructed preset approval node set;
[0142] Parameter copy module 303: is used to select parameters to be copied from the at least one subsequent task and copy them to the current parameter set corresponding to the current node to be approved, according to the configuration rules of the parameter copy configuration table;
[0143] Approval Management Module 304: Used to construct an approval progress list based on the current parameter set and the at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting.
[0144] like Figure 3 As shown, the query module 301 is used to perform:
[0145] Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request;
[0146] Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number;
[0147] Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks.
[0148] The task node that ranks last in the sorting results is selected and identified as the current node to be approved.
[0149] based on Figure 3 The example shown is a workflow approval management system, such as... Figure 4 As shown, prior to the query module 301, a pre-construction module 305 is further included;
[0150] The pre-construction module 305 is used to pre-construct a preset approval node set, wherein the preset approval node set includes at least: node identifier and node association parameter field;
[0151] The determining module 302 is used to perform:
[0152] The node information of the current node to be approved is determined based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information;
[0153] Based on the current approval path information corresponding to the current node to be approved, at least one subsequent task associated with the current node to be approved is selected from the preset set of approval nodes;
[0154] Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set;
[0155] When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task;
[0156] Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval node.
[0157] like Figure 4 As shown, the parameter copy module 303 is used to perform:
[0158] The parameter copy configuration table is pre-built, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier;
[0159] Extract at least one successor task and its corresponding node identifier from the current node awaiting approval;
[0160] Iterate through the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table;
[0161] The filter node identifier exists in at least one target successor task in the source node identifier of the parameter copy configuration table;
[0162] Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved.
[0163] based on Figure 4 The example shown is a workflow approval management system, such as... Figure 5 As shown, before the query module 301, a pre-configuration module 306 is further included;
[0164] The pre-configuration module 306 is used to pre-configure the list of node parameters to be assigned and the corresponding insertion rules, wherein the list of node parameters to be assigned includes: node identifier to be assigned and node approver, and the insertion rules include: predecessor node identifier and insertion order priority.
[0165] Following the approval management module 304, the system further includes: an allocation module 307;
[0166] The module to be allocated 307 is used to perform:
[0167] The approval progress list is traversed in reverse order based on the node sorting, and it is determined whether each node in the approval progress list exists in the list of nodes to be assigned.
[0168] When none of the nodes in the approval progress list exist in the node to be assigned parameter list, the node to be assigned is inserted into the target position of the approval progress list according to the insertion rule to generate the target approval progress list;
[0169] The target approval progress list is output as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.
[0170] It is understood that the structures illustrated in the embodiments of the present invention do not constitute a specific limitation on a workflow approval management system. In other embodiments of the present invention, a workflow approval management system may include more or fewer components than illustrated, or combine some components, or split some components, or have different component arrangements. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.
[0171] The information interaction and execution process between the various units in the above-mentioned device are based on the same concept as the method embodiment of the present invention, and the specific details can be found in the description of the method embodiment of the present invention, and will not be repeated here.
[0172] This invention also provides a process approval management system, including: at least one memory and at least one processor;
[0173] At least one memory for storing machine-readable programs;
[0174] At least one processor is used to invoke a machine-readable program to execute a process approval management method according to any embodiment of the present invention.
[0175] This invention also provides a computer-readable medium storing computer instructions, which, when executed by a processor, cause the processor to perform a process approval management method according to any embodiment of this invention.
[0176] Specifically, a system or apparatus equipped with a storage medium may be provided, on which software program code implementing the functions of any of the embodiments described above is stored, and the computer (or CPU or MPU) of the system or apparatus may read and execute the program code stored in the storage medium.
[0177] In this case, the program code read from the storage medium can itself implement the function of any of the above embodiments, and therefore the program code and the storage medium storing the program code constitute part of the present invention.
[0178] Examples of storage media used to provide program code include floppy disks, hard disks, magneto-optical disks, optical disks (such as CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD+RW), magnetic tapes, non-volatile memory cards, and ROMs. Alternatively, program code can be downloaded from a server computer via a communication network.
[0179] Furthermore, it should be clear that not only can the program code read by the computer be executed, but also the operating system or other components operating on the computer can be instructed based on the program code to perform some or all of the actual operations, thereby realizing the function of any of the embodiments described above.
[0180] Furthermore, it is understood that the program code read from the storage medium is written to the memory set in the expansion board inserted into the computer or to the memory set in the expansion unit connected to the computer. Then, based on the instructions of the program code, the CPU or other components installed on the expansion board or expansion unit execute some and all of the actual operations, thereby realizing the function of any of the embodiments described above.
[0181] The various embodiments of the present invention have at least the following beneficial effects:
[0182] 1. In this embodiment of the invention, a process approval management method is provided. The method first queries all historical tasks in the current process instance, accurately locating the current pending approval node through historical tasks, serving as a benchmark for approval progress. Next, based on a pre-built set of preset approval nodes, it determines the target preset pending approval node corresponding to the subsequent tasks following the current pending approval node. Then, according to a parameter copy configuration table, it filters out parameters to be copied from all subsequent tasks and executes parameter transfer according to rules, copying the parameters to be copied to the current parameter set of the current pending approval node. Finally, based on the current parameter set and the target preset approval node, it filters valid approval paths and dynamically constructs a complete approval chain including node identifiers, approver information, and node order. The above process proposes a generalized encapsulation method that can uniformly achieve dynamic acquisition of pending approval nodes and approvers, as well as standardized display of historical approval opinions. It eliminates the need to write dedicated logic for different processes, reducing system code redundancy and logical complexity while improving development efficiency and process management maintainability, thereby significantly improving system reusability.
[0183] 2. In this embodiment of the invention, in order to determine the current node to be approved, the current process instance number is extracted synchronously when the current user's current process instance request is received, so that only key parameters such as the process instance number need to be passed in, and complete approval progress information can be automatically generated. Next, the historical task query interface of the workflow engine is called to accurately query at least one historical task in the current process instance. Activiti, as an enterprise-level workflow engine, supports complex approval modes such as serial and parallel processing and dynamic node allocation. Then, the completion time of each historical task can be determined by the API provided by the Activiti engine, and these historical tasks are sorted in ascending order according to the completion time. Finally, the task node at the bottom of the sorting results is determined as the current node to be approved, which can lay the data foundation for the generation of the subsequent approval progress list.
[0184] 3. In this embodiment of the invention, in order to determine the target preset node to be approved, firstly, a preset set of approval nodes containing node identifiers and node association parameter fields is pre-constructed; then, the node information of the current node to be approved is determined based on the preset set of approval nodes; next, according to the current approval path information contained in the node information of the current node to be approved, all subsequent tasks associated with the current node to be approved are filtered out from the preset set of approval nodes; then, it is determined whether the association parameter fields of all the above-mentioned subsequent tasks exist in the current parameter set, and if they exist, the corresponding initial preset node to be approved is extracted to clarify the approval path after the current node to be approved; finally, the task completion time of each initial preset node to be approved is queried, and the initial preset nodes to be approved with completion times later than the current node to be approved are determined as the target preset node to be approved, so as to lay a data foundation for the construction of the subsequent approval progress list.
[0185] It should be noted that not all steps and modules in the above processes and system structure diagrams are mandatory; some steps or modules can be omitted as needed. The execution order of each step is not fixed and can be adjusted as required. The system structure described in the above embodiments can be a physical structure or a logical structure. That is, some modules may be implemented by the same physical entity, or some modules may be implemented by multiple physical entities, or they may be jointly implemented by certain components in multiple independent devices.
[0186] In the above embodiments, the hardware units can be implemented mechanically or electrically. For example, a hardware unit may include permanent dedicated circuitry or logic (such as a dedicated processor, FPGA, or ASIC) to perform the corresponding operation. The hardware unit may also include programmable logic or circuitry (such as a general-purpose processor or other programmable processor), which can be temporarily configured by software to perform the corresponding operation. The specific implementation method (mechanical, dedicated permanent circuitry, or temporarily configured circuitry) can be determined based on cost and time considerations.
[0187] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.
Claims
1. A process approval management method, characterized in that, The method includes: Query at least one historical task in the current process instance, and determine the current node to be approved based on the at least one historical task; Based on a pre-constructed set of preset approval nodes, at least one target preset approval node is determined for at least one subsequent task of the current node to be approved. According to the configuration rules of the parameter copy configuration table, the parameters to be copied are selected from the at least one subsequent task and copied to the current parameter set corresponding to the current node to be approved; An approval progress list is constructed based on the current parameter set and the at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting.
2. The method according to claim 1, characterized in that, The step of querying at least one historical task in the current process instance and determining the current node to be approved based on the at least one historical task includes: Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request; Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number; Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks. The task node that ranks last in the sorting results is selected and identified as the current node to be approved.
3. The method according to claim 1, characterized in that, Before querying at least one historical task in the current process instance and determining the current node to be approved based on the at least one historical task, the method further includes: A preset set of approval nodes is pre-constructed, wherein the preset set of approval nodes includes at least: node identifier and node association parameter fields; The process of determining at least one target preset approval node corresponding to at least one subsequent task of the current approval node based on a pre-built preset approval node set includes: The node information of the current node to be approved is determined based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information; Based on the current approval path information corresponding to the current node to be approved, at least one subsequent task associated with the current node to be approved is selected from the preset set of approval nodes; Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set; When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task; Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval node.
4. The method according to claim 3, characterized in that, The step of selecting parameters to be copied from at least one subsequent task and copying them to the current parameter set corresponding to the current node awaiting approval, according to the configuration rules of the parameter copy configuration table, includes: The parameter copy configuration table is pre-built, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier; Extract at least one successor task and its corresponding node identifier from the current node awaiting approval; Iterate through the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table; The filter node identifier exists in at least one target successor task in the source node identifier of the parameter copy configuration table; Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved.
5. The method according to any one of claims 1-4, characterized in that, Before querying at least one historical task in the current process instance and determining the current node to be approved based on the at least one historical task, the method further includes: A list of nodes to be assigned and corresponding insertion rules are pre-configured. The list of nodes to be assigned includes: node identifier and node approver. The insertion rules include: predecessor node identifier and insertion order priority. After constructing the approval progress list based on the current parameter set and the at least one target preset approval node, the process further includes: The approval progress list is traversed in reverse order based on the node sorting, and it is determined whether each node in the approval progress list exists in the list of nodes to be assigned. When none of the nodes in the approval progress list exist in the node to be assigned parameter list, the node to be assigned is inserted into the target position of the approval progress list according to the insertion rule to generate the target approval progress list; The target approval progress list is output as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.
6. A workflow approval management system, characterized in that, The system includes: Query module: used to query at least one historical task in the current process instance, and determine the current node to be approved based on the at least one historical task; Determination module: used to determine at least one target preset approval node corresponding to at least one subsequent task of the current approval node based on a pre-built preset approval node set; Parameter copy module: used to select parameters to be copied from the at least one subsequent task and copy them to the current parameter set corresponding to the current node to be approved, according to the configuration rules of the parameter copy configuration table; Approval Management Module: Used to construct an approval progress list based on the current parameter set and the at least one target preset approval node, wherein the approval progress list includes: node identifier, approver information and node sorting.
7. The system according to claim 6, characterized in that, The query module is used to execute: Receive the current user's current process instance request and obtain the current process instance number corresponding to the current process instance request; Call the workflow engine's historical task query interface to query at least one historical task in the current process instance based on the current process instance number; Determine the task completion time of each of the historical tasks, and sort the at least one historical task in ascending order based on the task completion time of each of the historical tasks. The task node that ranks last in the sorting results is selected and identified as the current node to be approved.
8. The system according to claim 6, characterized in that, Prior to the query module, a pre-construction module is further included; The pre-built module is used to pre-build a set of preset approval nodes, wherein the set of preset approval nodes includes at least: node identifier and node association parameter fields; The determining module is used to perform: The node information of the current node to be approved is determined based on the preset set of approval nodes, wherein the node information includes: current node identifier, task completion time, and current approval path information; Based on the current approval path information corresponding to the current node to be approved, at least one subsequent task associated with the current node to be approved is selected from the preset set of approval nodes; Determine whether the associated parameter field of the at least one subsequent task exists in the current parameter set; When the associated parameter field of the at least one subsequent task exists in the current parameter set, extract at least one initial preset node to be approved corresponding to the at least one subsequent task; Query the task completion time of each of the initial preset pending approval nodes, and determine the initial preset pending approval nodes whose task completion time is later than that of the current pending approval node as the target preset pending approval node.
9. The system according to claim 8, characterized in that, The parameter copy module is used to perform: The parameter copy configuration table is pre-built, wherein the parameter copy configuration table includes: source node identifier, list of parameters to be copied, and target node identifier; Extract at least one successor task and its corresponding node identifier from the current node awaiting approval; Iterate through the at least one successor task to determine whether the node identifier of each successor task exists in the source node identifier of the parameter copy configuration table; The filter node identifier exists in at least one target successor task in the source node identifier of the parameter copy configuration table; Based on the list of parameters to be copied in the parameter copy configuration table, extract the parameter data corresponding to the at least one target successor task and copy it to the current parameter set corresponding to the current node to be approved.
10. The system according to any one of claims 6-9, characterized in that, Prior to the query module, a pre-configuration module is further included; The pre-configuration module is used to pre-configure the list of node parameters to be assigned and the corresponding insertion rules. The list of node parameters to be assigned includes: node identifier and node approver. The insertion rules include: predecessor node identifier and insertion order priority. Following the approval management module, the system further includes: a module for assignment. The module to be assigned is used to execute: The approval progress list is traversed in reverse order based on the node sorting, and it is determined whether each node in the approval progress list exists in the list of nodes to be assigned. When none of the nodes in the approval progress list exist in the node to be assigned parameter list, the node to be assigned is inserted into the target position of the approval progress list according to the insertion rule to generate the target approval progress list; The target approval progress list is output as a standardized approval progress view, wherein the standardized approval progress view includes: the node identifier, the approver information, the node sorting, and the nodes to be assigned.