Optimized endorsement method and system for business process form, terminal and medium

Abstract

The invention provides an optimized endorsement method and system for business process forms, and the method comprises the steps: obtaining a corresponding endorsement process for each business process form; according to the endorsement process, providing a corresponding endorsement optimization strategy to endorsement the business process form; wherein the corresponding endorsement optimization strategy is provided, which comprises the following steps of: formulating a parallel endorsement link for countersigning and / or signing according to an endorsement process, and constructing an endorsement path containing the parallel endorsement link; de-duplication processing is carried out on other repeated sign-off links and / or low-order sign-off links in the sign-off path; and carrying out shortest path search on the signature path after de-duplication processing, and taking the obtained shortest path as a final signature path. According to the method, the operation efficiency of the endorsement process is greatly improved, the problem of low efficiency in the traditional approval process is effectively solved, the response speed of business operation is remarkably improved, and the method has wide application prospects and popularization value.

Description

Technical Field

[0001] The present invention relates to the field of computers, enterprise process management and intelligent office technology, and in particular to an optimized signing and approval method, system, terminal and medium for business process forms. Background Art

[0002] In modern enterprise management, the approval of process forms is an important part of ensuring efficient business operations. With the popularization of information technology, systematic form approval has become a basic function of enterprise information systems. However, the traditional approval process usually adopts a serial design, and the approval efficiency is low. At the same time, the traditional approval process is often cumbersome and inefficient due to the participation of multiple departments and multi-level approvals, resulting in delayed decision-making and reduced work efficiency. Especially in complex projects, problems such as repeated approvals and serial waiting are particularly prominent, seriously affecting the operational efficiency and response speed of the enterprise. The traditional approval process is like Figure 1 shown. Summary of the invention

[0003] In view of the above-mentioned deficiencies in the prior art, the present invention provides a method, system, terminal and medium for optimizing the signing and approval of business process forms.

[0004] According to one aspect of the present invention, a method for optimizing approval of a business process form is provided, comprising:

[0005] For each business process form, obtain the corresponding approval process;

[0006] According to the approval process, provide corresponding approval optimization strategy to approve the business process form;

[0007] Wherein, providing corresponding approval optimization strategies includes:

[0008] According to the approval process, formulate parallel approval links for counter-approval and / or approval, and build an approval path that includes the parallel approval links;

[0009] Deduplication processing is performed on other repeated approval links and / or low-order approval links in the approval path;

[0010] The shortest path search is performed on the sign-off path after deduplication processing, and the obtained shortest path is used as the final sign-off path.

[0011] According to another aspect of the present invention, there is provided an optimized approval system for business process forms, comprising:

[0012] The approval process configuration module is used to obtain the corresponding approval process for each business process form;

[0013] An approval process optimization module, which is used to provide corresponding approval optimization strategies to approve the business process form according to the approval process;

[0014] The approval process optimization module includes:

[0015] A parallel sign-off process formulation unit, which is used to formulate a parallel sign-off process for counter-signing and / or signing according to the sign-off process, and to construct a sign-off path including the parallel sign-off process;

[0016] A link deduplication unit, the unit being used to perform deduplication processing on other repeated sign-off links and / or low-order sign-off links in the sign-off path;

[0017] The approval path optimization unit is used to search for the shortest path of the approval path after deduplication processing, and use the obtained shortest path as the final approval path.

[0018] According to a third aspect of the present invention, there is provided a computer terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, can be used to execute the method described above in the present invention, or to run the system described above in the present invention.

[0019] According to a fourth aspect of the present invention, there is provided a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, can be used to execute the method described above in the present invention, or to run the system described above in the present invention.

[0020] Due to the adoption of the above technical solution, the present invention has at least one of the following beneficial effects compared with the prior art:

[0021] The optimized approval method, system, terminal and medium for business process forms provided by the present invention greatly improve the operating efficiency of the approval process through the above technical scheme, effectively solve the problem of low efficiency in the traditional approval process, and provide enterprises with a set of efficient and flexible process management solutions, which not only optimizes the approval experience, but also significantly improves the response speed of business operations, and has broad application prospects and promotion value.

[0022] The present invention introduces the comprehensive calculation of the approval path weight. By setting the path weight between the approval nodes, the weight value is dynamically calculated based on the historical response time average of the approver, the current task load, the role adaptability and other factors, which improves the scientificity and rationality of the path selection and ensures the selection of the optimal approval path; avoids the concentration of tasks on high-load nodes and balances the utilization of system resources; speeds up the node response speed in the approval process and improves the overall process efficiency. It solves the problem of single path selection and easy bottleneck in the traditional process, shortens the approval time and optimizes resource allocation.

[0023] The present invention dynamically updates the approval path weights, dynamically adjusts the path weights according to the real-time status of the nodes (task load, online status, etc.), ensures that the weights are consistent with the actual situation, improves the real-time and accuracy of path selection, and responds to changes in node status in the approval process, improving timeliness. It solves the problem of inflexible traditional static weight design and improves the process adaptation capability in complex approval scenarios.

[0024] The present invention introduces multi-feature weighted priority, integrates multiple node features (historical approval response time average, role suitability, etc.), establishes weighted priority, and ensures more intelligent task allocation through multi-feature weighting; flexibly adjusts weights for different task types to meet diverse business needs. It solves the problem of single node selection and no consideration of comprehensive features in the traditional approval process, improves approval efficiency, and enhances support for complex business scenarios.

[0025] The present invention calculates weights based on historical data, uses historical approval time and task numbers, establishes statistical models, and dynamically adjusts the weights between nodes, effectively utilizing historical data, improving the accuracy of the weight model, and realizing the transition from experience-driven to data-driven. It solves the problem of relying on manual experience or fixed rules in traditional processes and enhances the intelligence and adaptability of the system.

[0026] The present invention introduces a flexible process configuration management mechanism, supports dynamic configuration of approval processes and rules, meets the diverse needs of enterprises, enhances the flexibility and configurability of approval processes, and supports personalized customization of processes in complex scenarios. It solves the problem that traditional processes are fixed and cannot adapt to changes quickly, and provides enterprises with more efficient and flexible process management tools. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Other features, objects and advantages of the present invention will become more apparent from the detailed description of non-limiting embodiments made with reference to the following drawings:

[0028] Figure 1 This is the traditional approval flow chart.

[0029] Figure 2The present invention is a workflow diagram of an optimized signing and approval method for business process forms in one embodiment of the present invention.

[0030] Figure 3 The figure is a schematic diagram of the components of an optimized approval system for business process forms in one embodiment of the present invention.

[0031] Figure 4 This is a working architecture diagram of an optimized approval system for business process forms in a preferred embodiment of the present invention.

[0032] Figure 5 The flowchart of the parallelization strategy of sign-off based on counter-signing in a preferred embodiment of the present invention is shown in FIG.

[0033] Figure 6 4 is a flow chart of a sign-off parallelization strategy based on or in a preferred embodiment of the present invention.

[0034] Figure 7 The flowchart of the approval parallelization strategy based on countersignature+or-signature in a preferred embodiment of the present invention.

[0035] Figure 8 The present invention is a flowchart of a deduplication mechanism for signing and approving in a preferred embodiment of the present invention.

[0036] Fig. 9 This is a flow chart of a low-order bypass mechanism in a preferred embodiment of the present invention.

[0037] Fig.10 The figure is a schematic diagram of an approval path in a preferred embodiment of the present invention.

[0038] Fig.11 It is a schematic diagram of a complete approval path in a preferred embodiment of the present invention. DETAILED DESCRIPTION

[0039] The following is a detailed description of the embodiments of the present invention: This embodiment is implemented on the premise of the technical solution of the present invention, and a detailed implementation method and a specific operation process are given. It should be pointed out that for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.

[0040] The existing form approval process usually has problems such as decision delay and low work efficiency, which seriously affects the operational efficiency and response speed of the enterprise. In view of the above problems, an embodiment of the present invention provides an optimized approval method for business process forms. The method optimizes the approval process and adopts process parallelization, deduplication optimization and other technologies to effectively improve the circulation speed of forms between multiple departments and the speed of form approval, thereby improving the approval efficiency.

[0041] Specifically, Figure 2As shown, the optimized signing and approval method for a business process form provided in this embodiment may include the following operations:

[0042] S1, for each business process form, obtain the corresponding approval process;

[0043] S2: According to the approval process, provide corresponding approval optimization strategies to approve the business process forms;

[0044] Among them, the corresponding approval optimization strategies are provided, including:

[0045] S21, according to the approval process, formulate a parallel approval link for counter-approval and / or approval, and construct an approval path including the parallel approval link;

[0046] S22, performing deduplication processing on other repeated sign-off links and / or low-order sign-off links in the sign-off path;

[0047] S23, searching for the shortest path for the approval path after deduplication processing, and taking the obtained shortest path as the final approval path.

[0048] In some preferred implementations, the above S21, formulating a parallelized approval process for counter-signing, may further include the following operations:

[0049] S211, pre-allocating approval business for all approval nodes at the same level, and pushing the approval content to the corresponding approval nodes at the same level at the same time, so as to obtain a parallel approval link in which multiple nodes at the same level sign and approve at the same time;

[0050] S212, using the following judgment rules to perform parallel judgment to determine whether multiple nodes at the same level have completed the approval:

[0051]

[0052] In some preferred implementations, the above S21, formulating a parallelized sign-off process for or signing, may further include the following operations:

[0053] S21i, for any approval node at the same level, push the approval content to the approval node to obtain or sign the parallel approval link;

[0054] S21ii, use the following judgment rules to perform or sign parallel judgment to determine whether any link at the same level has been signed and approved:

[0055]

[0056] In some preferred implementations, the above S21, formulating a parallelized approval process for counter-signing and / or signing, may further include the following operations:

[0057] When any approval business has multiple parallel approval links and each link has multiple optional approval nodes, a priority-driven dynamic distribution algorithm is used to dynamically set the priority of each approval node, and when initiating or signing a task, the approval content is pushed to the approval node with the highest priority. When initiating a joint signing task, the approval business is pushed to multiple approval nodes at the same time, and the approval nodes with priority processing are marked to obtain parallel approval links for joint signing and or signing.

[0058] When developing the parallel sign-off process for countersignature and / or co-signature, the allocation rules are determined by the business logic, which may include:

[0059] Fixed configuration: specify the list of approvers in the process definition;

[0060] Dynamic allocation: dynamically query the approver based on business data (such as department head, designated approver field);

[0061] Conditional branching: filter different approver groups by conditions;

[0062] Notification method:

[0063] System message: send message reminders through the existing workflow system;

[0064] To-do task list: When the approver logs into the system, he or she can see the tasks assigned to him or her for review and approval.

[0065] In some preferred implementations, the priority-driven dynamic distribution algorithm may further include the following operations:

[0066] S21I, define the approval task queue T = {t1, t2, ..., t n}, where each approval task t i All have the following properties:

[0067] Priority P i (Range: low priority 1 → high priority 10);

[0068] Urgency E i (Boolean value: 1 for urgent, 0 for non-urgent);

[0069] Deadline D i ;

[0070] S21II, define the approval node set A = {a1, a2, ..., a m}, where each approval node a j All have the following properties:

[0071] Historical response time average Rj ;

[0072] Current task load L j ;

[0073] Online Status j (Boolean value: 1 if online, 0 if offline);

[0074] Role Compatibility M ij (Indicates that for approval tasks t i , the correlation between the approval node and the approval task, range: 0→1);

[0075] in:

[0076] Historical response time average R j , represents the average response time required by the node in the past task processing process; when calculating the priority, the node with shorter response time can be given a higher priority to speed up the overall approval process;

[0077] Current task load L j , which indicates the number of approval tasks currently being processed by the node or the occupancy rate of processing capacity; when calculating the priority, nodes with lower task loads are more likely to be selected first to maintain a balanced distribution of tasks;

[0078] Online Status j , indicating whether the node is currently available; the online status is the basic condition for task allocation, usually expressed as a Boolean value: 1 for online, 0 for offline; when calculating the priority, offline nodes are automatically excluded from task allocation, and the online status provides a hard constraint for the task priority, ensuring that tasks are only allocated to available nodes;

[0079] Role Compatibility M ij , reflects the matching degree between the current task i and the node role j, which is usually calculated by similarity scoring, experience weight, etc. The higher the adaptability, the more likely the node is to be competent for the task, and the higher the processing efficiency and quality; when calculating the priority, tasks are assigned to nodes with higher role adaptability first, which improves the accuracy and efficiency of the approval process;

[0080] S21III, based on the approval task and approval task queue, uses the following formula to calculate the task priority And dynamically adjust task priorities, including:

[0081]

[0082] Where W1 is the weight of the urgent task, and the default value is generally 5; W2 is the influence coefficient of the deadline, and the default value is generally 0.1; T now is the current time;

[0083] Based on the above, we can see that the higher the urgency of the task and the shorter the deadline, the higher the task priority.

[0084] In some preferred implementations, the above S22, deduplication processing of other repeated approval links in the approval path, may further include the following operations:

[0085] S221, the following judgment is made on each approval link in the approval path:

[0086] (People to be approved∈{approved list}) = 1

[0087] S222, when it is determined that the current approval link is a repeated approval link, the approval link is automatically skipped to achieve deduplication processing of the repeated approval links.

[0088] In some preferred implementations, the above S22, deduplication processing of other low-order sign-off links in the sign-off path, may further include the following operations:

[0089] S22i, make the following judgments on each sign-off link in the sign-off path:

[0090] (Direct supervisor of the person to be approved∈{approved list}) = 1

[0091] S22ii, when it is determined that the current sign-off link is a low-order sign-off link, the sign-off link is automatically skipped to achieve deduplication processing of the low-order sign-off link.

[0092] In some preferred implementations, the above S23, searching for the shortest path for the approval path after deduplication processing, and taking the obtained shortest path as the final approval path, may further include the following operations:

[0093] S231, for each approval path, its data structure includes a front node, a rear node, and an average approval time as the path weight between the front node and the rear node; wherein the average approval time is obtained by the average of the historical total approval time statistics or the total number of tasks; further, for example, the average approval time = total approval time / total number of tasks; wherein the total approval time is the sum of the time spent on all tasks flowing between two nodes, and the total number of tasks refers to the number of times the approval tasks flow between two nodes;

[0094] S232, based on each approval path, construct multiple complete approval paths having a weighted directed graph structure; each complete approval path includes an approval starting point, an approval end point, and one or more approval nodes sequentially located between the approval starting point and the approval end point;

[0095] S233, using a path search algorithm, converts the approval optimization problem of the approval business into a shortest path search problem of a weighted directed graph, that is, obtaining a path with the minimum total weight;

[0096] The path search algorithm may further include the following operations:

[0097] S2331, initialize the distance from the starting point to all approval nodes to infinity, and the starting point distance to 0;

[0098] S2332, using a priority queue to maintain approval nodes that have not been visited;

[0099] S2333, a complete approval path is segmented, a path weight calculation strategy is defined for each path segment, and the path weight is dynamically updated; wherein the path weight w ij It is expressed as follows:

[0100] w ij =w ij,base +α·f(t)+β·g(c)

[0101] In the formula, w ij,base represents the static basic weight, which is used to reflect the standard flow time between approval nodes; f(t) represents the time-related function, which is used to measure the real-time nature of approval; g(c) represents the complexity-related function, which is used to measure the processing complexity; α, β represent the adjustable weight coefficients;

[0102] S2334, repeat the above dynamic update steps, update the weight of each path segment until the end point, output the total weight of the path, and obtain the path with the minimum total weight.

[0103] In some preferred implementations, the above S2332 may further include the following operations:

[0104] Priority queue is a special queue in which elements are sorted by priority. In the approval process, priority queue can be used to dynamically maintain nodes to be accessed and determine the next node to be processed based on the priority of the node. Furthermore, the maintenance process includes:

[0105] Initialize the priority queue and create an empty priority queue;

[0106] Add all unvisited approval nodes to the queue;

[0107] Calculate the priority for each node based on task requirements;

[0108] During task processing, the queue is adjusted dynamically.

[0109] In some preferred implementations, the above S2334 may further include the following operations:

[0110] When obtaining the path with the minimum total weight, multiple factors are considered, including static basic weight, time correlation, and processing complexity correlation. Therefore, it not only considers the total processing complexity of the path, but also integrates other factors. It is the optimal path under multi-factor optimization, and quantifies the overall quality of path selection by evaluating the comprehensive processing capabilities of all nodes and edges on the path.

[0111] By calculating the path weights and optimizing the final path, the multi-factor problem of the approval path is transformed into a quantifiable shortest path problem;

[0112] w ij,base : Reflects static path information, such as standard flow time, and indicates the logical distance between nodes.

[0113] f(t): Dynamic time function that measures the priority of real-time performance (e.g. urgent tasks need to be processed faster).

[0114] g(c): complexity-related function, reflecting the processing complexity on the path.

[0115] In some preferred implementations, the above S2, before signing and approving the business process form, may further include any one or more of the following:

[0116] -Before signing and approving the business process form, an asynchronous pre-processing method is used to verify and calculate the pre-conditions for each approval business;

[0117] -Set reminder time for each approval node to ensure task completion;

[0118] - Before signing and approving the business process form, automatically check the completeness and standardization of the approval business.

[0119] In some preferred implementations, the verification and calculation of the preconditions for each approval business may further include:

[0120] Preconditions include: data integrity check, business rule verification, and authority and role verification; among which:

[0121] Data integrity check, used to ensure that the application form or submitted approval data is complete, such as applicant information, project budget, and related attachments;

[0122] Business rule verification is used to check whether business rules or policies are met, such as whether the approval amount exceeds the budget range and whether the time is within the validity period;

[0123] Permission and role verification is used to verify whether the applicant or current approver has the permissions required to handle this task, whether they are involved in the project, etc.

[0124] Verification and calculation, including: rule matching, database query, formula calculation and data aggregation; among which:

[0125] Rule matching: use custom process configuration files to perform basic rule matching on approval data;

[0126] Database query, by querying the database, verify whether the related data exists and whether the conditions are met;

[0127] Formula calculation: execute formulas or algorithms according to business needs; for example, calculate whether the remaining amount of project funds is sufficient to support the application amount;

[0128] Data aggregation is used to perform statistical calculations on related task data; for example, cumulative amounts, number of related tasks, etc.

[0129] Through verification and calculation, we can determine whether the preconditions are met and whether we can enter the approval process:

[0130] If the verification and calculation fails, that is, certain conditions are not met, a specific error message or prompt will be returned, such as "the approval amount exceeds the budget range" or "the attachment is incomplete", the approver has no authority, etc., and a further form adjustment reminder will be given: such as adjusting the application amount according to the budget calculation results, etc.

[0131] In some preferred implementations, the above-mentioned setting of a reminder time for each approval node may further include:

[0132] By setting a fixed time interval, a reminder method combining real-time reminders with fixed-time reminders is implemented for approval nodes;

[0133] Set dynamic reminders based on approval data.

[0134] In some preferred implementations, the above-mentioned automatic inspection of the integrity and standardization of the approval business may further include any one or more of the following:

[0135] - Verify the approval content of the approval business through preset fixed rules;

[0136] - Through dynamically generated dynamic rules, the approval process of the approval business can be verified. The approval process of the approval business can also be automatically generated based on the generated dynamic rules and the approval nodes can be automatically allocated.

[0137] Furthermore, the above dynamic rules can be dynamically generated by coordinating the settings of the low-code platform, specifically:

[0138] The low-code platform is highly configurable and has drag-and-drop development tools that enable rapid construction and management of dynamic rules. The following are specific support methods:

[0139] 1. Rule configuration interface:

[0140] Visual process designer: The low-code platform can provide a graphical interface where users can define the rules required for approval through operations such as dragging and dropping and setting conditions.

[0141] Support dynamic variables: Allow users to reference business data (such as the initiator's department, amount threshold) as conditions; the system parses these dynamic variables in real time when the task is triggered.

[0142] 2. Real-time rule generation:

[0143] By combining process context, input parameters or historical data, the low-code platform automatically generates rules that match the current scenario;

[0144] For example:

[0145] If the task amount is greater than RMB 100,000, the department manager and the financial director must sign the bill;

[0146] If the task initiator is from the “Sales Department”, the countersigned task will be assigned to the Sales Director.

[0147] 3. Conditional expressions:

[0148] Common conditional expressions used in dynamic rules usually support the following logic:

[0149] IF-ELSE conditions: For example, IF (amount > 100,000 yuan) THEN (add approver A);

[0150] Custom formulas: support rule calculations for advanced scenarios.

[0151] The dynamic rules generated dynamically by coordinating the settings of the low-code platform have the following advantages:

[0152] Flexibility: Users do not need a technical background and can configure and manage dynamic approval rules through a low-code platform.

[0153] Adaptability: Rules can be adjusted in real time to meet the needs of different scenarios and avoid the limitations of static rules.

[0154] Automation: Through dynamic rules, the task process generation and allocation of approval business is more efficient, reducing manual intervention.

[0155] Based on the same inventive concept, an embodiment of the present invention also provides an optimized approval system for business process forms.

[0156] Specifically, Figure 3 As shown, the optimized approval system for business process forms provided in this embodiment may include the following modules:

[0157] The approval process configuration module is used to obtain the corresponding approval process for each business process form;

[0158] The approval process optimization module is used to provide corresponding approval optimization strategies to approve business process forms according to the approval process;

[0159] Among them, the approval process optimization module further includes:

[0160] A parallel sign-off process formulation unit, which is used to formulate a parallel sign-off process for counter-signing and / or signing according to the sign-off process, and to construct a sign-off path including the parallel sign-off process;

[0161] A link deduplication unit, which is used to perform deduplication processing on other repeated sign-off links and / or low-order sign-off links in the sign-off path;

[0162] The approval path optimization unit is used to search for the shortest path of the approval path after deduplication processing, and use the obtained shortest path as the final approval path.

[0163] In some preferred implementations, the above-mentioned approval process configuration module may further include:

[0164] Provide a visual design interface, through which the approval process corresponding to the business process form is constructed.

[0165] In some preferred embodiments, the above system may further include the following modules:

[0166] Form design module, which provides visual tools for users to flexibly design various business process forms.

[0167] In some preferred embodiments, the above system further includes the following modules:

[0168] A user login module, which is used to obtain the account information of the current login person, verify whether the account information is legal or matches, and enter the system according to the permission information of the current login person; wherein the user login module obtains the account information in any of the following ways:

[0169] - Input the account information you set, which includes user name and user password;

[0170] -By scanning the QR code, related account information is cascaded, and the account information includes the WeChat account.

[0171] In some preferred embodiments, the above system further includes the following modules:

[0172] The communication module is used to send the approval content of the approval business to the corresponding approval node for approval.

[0173] It should be noted that the account information (including but not limited to account device information, account personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0174] It should be further explained that the steps in the method provided by the present invention can be implemented by using the corresponding components in the system, and those skilled in the art can refer to the technical solution of the system to implement the step flow of the method, and can also refer to the technical solution of the method to implement the composition of the system, that is, the embodiments in the system and the embodiments in the method can be understood as preferred examples of each other, which will not be elaborated here.

[0175] The following is a further detailed description of the work to be performed by the functional modules of the optimized approval system for business process forms provided in the above-mentioned embodiment of the present invention.

[0176] like Figure 4 As shown, the optimized approval system for business process forms mainly includes the following modules:

[0177] Form design module: provides visual tools to support users to flexibly design various forms.

[0178] Approval process configuration module: allows users to design specific approval processes through a visual interface. Each business form corresponds to a customized process.

[0179] Approval process optimization module: After the approval process is started, the entire process is analyzed and a variety of approval optimization strategies are used to accelerate the process operation. The shortest path search is then performed as the final approval path.

[0180] The above approval process optimization module adopts a variety of approval optimization strategies, including:

[0181] 1. Parallel optimization strategy for signing and approving based on countersignature, such as Figure 5 As shown, including:

[0182] For the approval departments at the same level, an asynchronous preprocessing module is introduced to verify and calculate the preconditions of each approval task in advance:

[0183] Task pre-allocation: When an approval task is generated, the system completes the task pre-allocation in advance and pushes the task content to the approver.

[0184] Smart reminders and scheduling: Set flexible reminder times for approvers to ensure tasks are completed during their most efficient hours.

[0185] Automatic data verification: Before formal approval, the system automatically checks the integrity and standardization of the document, reducing the manual inspection workload of the approver. Through parallel approval, multiple departments can sign and approve documents at the same time, speeding up the approval efficiency. Parallel approval uses the following judgment algorithm to determine whether the approval is completed:

[0186]

[0187] 2. Sign-off and approval parallelization optimization strategy based on or signature, such as Figure 6 As shown, including:

[0188] If there are multiple people who can sign a document, the parallelization can be accelerated through the mechanism of signing or signing. In the parallelized process of signing or signing, as long as any one of them signs and approves, the approval process can be completed. The parallelized signing and approval of the or signing adopts the following judgment algorithm to determine whether the approval is completed:

[0189]

[0190] 3. Sign-off and approval parallelization optimization strategy based on countersignature + or signature, such as Figure 7 As shown, including:

[0191] When there are multiple parallel departments that need to sign and approve a document, and each department has multiple optional signers, parallel acceleration can be achieved through the mechanism of joint signing + or mixed signing. The priority of the approver is dynamically adjusted based on the approver's historical response time, current workload, geographic location and other factors. The priority is dynamically set to push the task to the approver who responds faster or is more reliable. At the same time, intelligent task distribution, when initiating or signing a task, the system will push the approval task to multiple approvers at the same time, but mark the approver with priority to ensure that the approver with the fastest response completes the process first.

[0192] Among them, the priority-driven dynamic distribution algorithm is as follows:

[0193] Define the approval task queue T = {t1, t2, ..., t n}, each task t i With attributes:

[0194] Priority P i (Range: low priority 1 → high priority 10);

[0195] Urgency E i (Boolean value: 1 for urgent, 0 for non-urgent);

[0196] Deadline D i ;

[0197] Define the approver set A = {a1, a2, ..., a m}, each approver a j With attributes:

[0198] Historical response time average R j ;

[0199] Current task load L j ;

[0200] Online Status j (Boolean value: 1 if online, 0 if offline);

[0201] Role Compatibility M ij (Indicates that for approval tasks t i , the correlation between the approval node and the approval task, range: 0→1);

[0202] Calculate task priority:

[0203] Dynamically adjust task priorities based on the following factors:

[0204]

[0205] Where W1 is the weight of the urgent task, and the default value is generally 5; W2 is the influence coefficient of the deadline, and the default value is generally 0.1; T now is the current time;

[0206] In summary, the more urgent the task and the shorter the deadline, the higher the task priority.

[0207] 4. Approval deduplication mechanism, such as Figure 8 As shown, including:

[0208] During the form circulation process, duplicate approval steps are automatically identified and removed; for example, based on matching logic or rules, by comparing the personnel information and process configuration in the approval record, determine whether the approval is repeated; use the existing process management system to support deduplication functions, such as directly querying whether a user has approved the form. If a form has been approved by the same person in the previous link, the subsequent approval can be automatically skipped to avoid unnecessary duplication of work and time waste. The algorithm for determining whether approval deduplication is needed is as follows:

[0209] (People to be approved∈{approved list}) = 1

[0210] 5. Low-level bypass mechanisms, such as Fig. 9 As shown, including:

[0211] When there are part-time employees in the organizational structure, the approval process may have been completed by the upper-level executives. If a form has been approved by the upper-level senior management in the previous stage, the subsequent approval of similar levels can be automatically skipped if the company's management policy is met. The algorithm for determining whether approval deduplication is needed is as follows:

[0212] (Direct supervisor of the person to be approved∈{approved list}) = 1

[0213] 6. Recommended approval paths, including:

[0214] When encountering a complex approval process with multiple approval paths, the system will make intelligent approval path recommendations to help users find the best approval promoter. The implementation principle is as follows:

[0215] Each approval path can be considered as follows Fig.10 The data structure shown includes the previous node, the next node, and the average approval time (the weight of the path). The average approval time can be calculated by the average of the historical approval time statistics or the number of tasks.

[0216] Based on each approval path, multiple complete approval paths are constructed to form the following weighted directed graph structure, such as Fig.11 shown.

[0217] In the above weighted directed graph structure, there are multiple different paths, which can convert a signature optimization problem into a shortest path search problem of a weighted directed graph. The shortest path can be understood as the path with the smallest total weight among all possible paths. Through the path search algorithm, the shortest path from the signature start point to the signature end point can be quickly calculated. This shortest path is the recommended follow-up path for business processing personnel. The path search algorithm is as follows:

[0218] 1. Dynamic weight update:

[0219] The edge weight w ij The calculation formula includes basic weights and dynamic processing complexity adjustment:

[0220] w ij =w ij,base +α·f(t)+β·g(c)

[0221] In the formula, w ij,base represents the static basic weight, which is used to reflect the standard flow time between approval nodes; f(t) represents the time-related function, which is used to measure the real-time nature of approval, such as the adjustment of waiting time; g(c) represents the complexity-related function, which is used to measure the processing complexity, such as the historical approval efficiency or the current approval volume; α, β represent the adjustable weight coefficients;

[0222] 2. Path priority segmentation

[0223] Divide a complete approval path into segments, and define a path weight calculation strategy for each segment. For example, the total path is divided into 3 segments (starting point - middle 1 - middle 2 - target), and each segment has a weight calculation strategy defined as follows:

[0224] Paragraph 1: Prioritize nodes with short turnover time;

[0225] Paragraph 2: Comprehensive consideration of processing complexity and efficiency;

[0226] Section 3: Dynamically adjust policies to balance approval workflows.

[0227] 3. Core steps include:

[0228] Initialize the distance from the starting point to all nodes to be infinite, and the starting point distance to 0;

[0229] Use a priority queue to maintain nodes that have not been visited yet;

[0230] Dynamically update edge weights and select paths in stages;

[0231] Repeat the update until the end point, and output the path with the minimum total processing complexity.

[0232] It should be noted that the steps in the method provided by the present invention can be implemented by using the corresponding components in the system, and those skilled in the art can refer to the technical solution of the system to implement the step flow of the method, and can also refer to the technical solution of the method to implement the composition of the system, that is, the embodiments in the system and the embodiments in the method can be understood as preferred examples of each other, which will not be elaborated here.

[0233] An embodiment of the present invention further provides a computer terminal, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the processor can be used to execute any one of the above methods of the present invention, or to run any one of the above systems of the present invention.

[0234] Optionally, the memory is used to store programs; the memory may include volatile memory (English: volatile memory), such as random-access memory (English: random-access memory, abbreviated: RAM), such as static random-access memory (English: static random-access memory, abbreviated: SRAM), double data rate synchronous dynamic random access memory (English: Double Data Rate Synchronous Dynamic Random Access Memory, abbreviated: DDR SDRAM), etc.; the memory may also include non-volatile memory (English: non-volatile memory), such as flash memory (English: flash memory). The memory is used to store computer programs (such as applications, functional modules, etc. that implement the above method), computer instructions, etc., and the above computer programs, computer instructions, etc. can be partitioned and stored in one or more memories. And the above computer programs, computer instructions, data, etc. can be called by the processor.

[0235] The processor is used to execute the computer program stored in the memory to implement the various steps of the method or various modules of the system involved in the above embodiments. For details, please refer to the relevant descriptions in the above method and system embodiments.

[0236] The processor and the memory may be independent structures or integrated structures. When the processor and the memory are independent structures, the memory and the processor may be coupled and connected via a bus.

[0237] An embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, it can be used to execute any method of the above embodiments of the present invention, or to run any system of the above embodiments of the present invention.

[0238] Among them, computer-readable media include computer storage media and communication media, wherein the communication media include any media that facilitates the transmission of computer programs from one place to another. The storage medium can be any available medium that can be accessed by a general or special-purpose computer. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a user device. Of course, the processor and the storage medium can also be present in a communication device as discrete components.

[0239] The optimized approval method, system, terminal and medium for business process forms provided by the above-mentioned embodiments of the present invention greatly improve the operating efficiency of the approval process through the above-mentioned technical means, effectively solve the problem of inefficiency in the traditional approval process, and provide enterprises with a set of efficient and flexible process management solutions, which not only optimizes the approval experience, but also significantly improves the response speed of business operations, and has broad application prospects and promotion value.

[0240] The above-mentioned embodiments of the present invention provide an optimized approval method, system, terminal and medium for business process forms. Through path optimization and dynamic weight calculation, the average value of historical approval time or the number of tasks is used as the basis for basic weight calculation, and a dynamic weight update mechanism is introduced to combine the approval path with real-time scenarios (such as time and complexity), thereby realizing data-driven and intelligent decision-making for the approval of business process forms.

[0241] The optimized approval method, system, terminal and medium for business process forms provided by the above-mentioned embodiments of the present invention improve the approval efficiency through path optimization, priority queue, dynamic weight and other technologies; based on data-driven and intelligent algorithms, it solves the problems of inefficiency and resource waste in traditional processes; it provides a flexible and adaptable system configuration function (i.e., dynamic definition or adjustment of approval paths, weight formulas, weight coefficients, etc.). By setting up the configuration, enterprises can flexibly configure approval dynamic rules according to their own needs to adapt to different business scenarios. By constructing multiple complete approval paths and dynamically adjusting path weights, it provides a flexible path configuration capability, provides comprehensive support for enterprise process management, and has wide application and promotion value.

[0242] All matters not covered in the above embodiments of the present invention are well known in the art.

[0243] The above describes the specific embodiments of the present invention. It should be understood that the present invention is not limited to the above specific embodiments, and those skilled in the art may make various modifications or variations within the scope of the claims, which do not affect the essence of the present invention.

Claims

1. A method for optimizing the approval of business process forms, characterized in that: include: For each business process form, obtain the corresponding approval process; According to the approval process, provide corresponding approval optimization strategy to approve the business process form; Wherein, providing corresponding approval optimization strategies includes: According to the approval process, formulate parallel approval links for counter-approval and / or approval, and build an approval path that includes the parallel approval links; Deduplication processing is performed on other repeated approval links and / or low-order approval links in the approval path; The shortest path search is performed on the sign-off path after deduplication processing, and the obtained shortest path is used as the final sign-off path.

2. The optimized approval method for business process forms according to claim 1 is characterized in that: Develop a parallel sign-off process for countersignatures, including: For all approval nodes at the same level, pre-allocate the approval business, and push the approval content to the corresponding approval nodes at the same level at the same time, so as to achieve the parallel approval link of multiple nodes at the same level to sign and approve at the same time; The following judgment rules are used for parallel judgment to determine whether multiple nodes at the same level have completed the approval:

3. The optimized approval method for business process forms according to claim 1 is characterized in that: Develop a parallel sign-off process for or signing, including: For any approval node at the same level, push the approval content to the approval node to obtain or sign the parallel approval link; The following judgment rules are used to conduct parallel judgment to determine whether any link at the same level has been signed and approved:

4. The optimized approval method for business process forms according to claim 1 is characterized in that: Develop a parallel sign-off process for countersignature and / or signature, including: When any approval business has multiple parallel approval links and each link has multiple optional approval nodes, a priority-driven dynamic distribution algorithm is used to dynamically set the priority of each approval node, and when initiating or signing a task, the approval content is pushed to the approval node with the highest priority first. When initiating a joint signing task, the approval business is pushed to multiple approval nodes at the same time, and the approval nodes with priority processing are marked, so as to obtain parallel approval links for joint signing and or signing; The priority-driven dynamic distribution algorithm includes: Define the approval task queue T = {t1, t2, ..., t n }, where each approval task t i All have the following properties: -Own priority P i ; - Urgency E i ; - Deadline D i ; Define the approval node set A = {a1, a2, ..., a m }, where each approval node a j All have the following properties: -Historical response time average R j ; -Current task load L j ; -Online Status j ; -Role Compatibility M ij ; Based on the approval task and the approval node, the task priority is calculated using the following formula: And dynamically adjust task priorities, including: Where W1 is the weight of the urgent task; W2 is the influence coefficient of the deadline; T now is the current time.

5. The optimized approval method for business process forms according to claim 1 is characterized in that: Deduplication of other repeated approval links in the approval path includes: The following judgments are made for each sign-off link in the sign-off path: (People to be approved∈{approved list}) = 1 When the current approval link is determined to be a repeated approval link, the approval link is automatically skipped to achieve deduplication of the repeated approval links; Deduplication is performed on other low-level sign-off links in the sign-off path, including: The following judgments are made for each sign-off link in the sign-off path: (Direct supervisor of the person to be approved∈{approved list}) = 1 When it is determined that the current sign-off link is a low-level sign-off link, the sign-off link is automatically skipped to achieve deduplication processing of the low-level sign-off link.

6. The optimized approval method for business process forms according to claim 1 is characterized in that: Perform a shortest path search on the sign-off path after deduplication processing, and use the obtained shortest path as the final sign-off path, including: For each approval path, its data structure includes a previous node, a next node, and an average approval time as the path weight between the previous node and the next node; wherein the average approval time is obtained by the average of the historical approval time between the two nodes or the number of tasks; Based on each approval path, multiple complete approval paths having a weighted directed graph structure are constructed, wherein each complete approval path includes an approval starting point, an approval end point, and one or more approval nodes sequentially located between the approval starting point and the approval end point; Using a path search algorithm, the approval optimization problem of the approval business is converted into the shortest path search problem in the weighted directed graph structure, that is, obtaining the path with the minimum total weight; Wherein, the path search algorithm includes: The distance from the initial starting point to all approval nodes is infinite, and the starting point distance is 0; Use priority queues to maintain approval nodes that have not been visited; A complete approval path is divided into segments, a path weight calculation strategy is defined for each segment, and the path weight is dynamically updated; wherein the path weight w ij It is expressed as follows: w ij =w ij,base +α·f(t)+β·g(c) In the formula, w ij,base represents the static basic weight, which is used to reflect the standard flow time between approval nodes; f(t) represents the time-related function, which is used to measure the real-time nature of approval; g(c) represents the complexity-related function, which is used to measure the processing complexity; α, β represent the adjustable weight coefficients; Repeat the above dynamic update steps to update the weight of each path segment until the end point, output the total weight of the path, and obtain the path with the minimum total weight.

7. The optimized approval method for business process forms according to any one of claims 1 to 6, further comprising any one or more of the following: -Before signing and approving the business process form, an asynchronous pre-processing method is used to verify and calculate the pre-conditions for each approval business; -Set reminder time for each approval node; - Before signing and approving the business process form, automatically check the completeness and standardization of the approval business.

8. An optimized approval system for business process forms, characterized in that: include: The approval process configuration module is used to obtain the corresponding approval process for each business process form; An approval process optimization module, which is used to provide corresponding approval optimization strategies to approve the business process form according to the approval process; The approval process optimization module includes: A parallel sign-off process formulation unit, which is used to formulate a parallel sign-off process for counter-signing and / or signing according to the sign-off process, and to construct a sign-off path including the parallel sign-off process; A link deduplication unit, the unit being used to perform deduplication processing on other repeated sign-off links and / or low-order sign-off links in the sign-off path; The approval path optimization unit is used to search for the shortest path of the approval path after deduplication processing, and use the obtained shortest path as the final approval path.

9. The optimized approval system for business process forms according to claim 8 is characterized in that: Also includes any one or more of the following: - The approval process configuration module provides a visual design interface, through which the approval process corresponding to the business process form is constructed; - Also includes any one or more of the following modules: Form design module, which provides visual tools for users to design various business process forms.

10. A computer terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, it can be used to perform the method described in any one of claims 1 to 7, or to run the system described in claim 8 or 9.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, it can be used to perform the method described in any one of claims 1 to 7, or to run the system described in claim 8 or 9.

Images