Optimization method for enterprise OA collaborative workflow
By real-time monitoring and analysis of approval amounts and dynamically adjusting the approval path, the problem of the approval task in the enterprise OA system cannot be switched to advanced processes when the approval amount exceeds the threshold, improving the accuracy and efficiency of the approval process, reducing business risks and operations cost.
Patent Information
- Application Number
- CN202411246463.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-06
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2044-09-06
AI Technical Summary
In the enterprise OA system, when the approval amount exceeds a specific threshold, the system fails to monitor and update the status accurately in real time, resulting in the approval task being unable to correctly switch to advanced processes, resulting in delays in approval progress and increased business risks.
By monitoring the approval amount in real time, obtaining and analyzing the condition information, evaluating whether it is necessary to switch the approval task from the regular process to the advanced process, and dynamically adjust the approval path during the switching process, making switching decisions based on the task priority and path complexity index, generating Process optimization management report.
It improves the accuracy and timeliness of process switching, reduces approval delays and misallocation, improves the overall efficiency of approval tasks, and reduces business risks and operational costs.
Smart Images

Figure CN118761745B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of workflow collaboration, and in particular to a method for optimizing an enterprise OA collaborative workflow. Background Art
[0002] Collaborative workflow refers to the process in which multiple departments or teams in an enterprise complete business activities around a common goal through orderly division of labor, information sharing and task collaboration. The purpose of collaborative workflow is to improve the efficiency of cross-departmental collaboration and ensure smooth information flow, thereby achieving more efficient teamwork. Optimizing collaborative workflow is to eliminate redundant links, reduce human intervention, and improve the level of automation to cope with process complexity and reduce time and resource waste. Applying optimization to the enterprise OA system can further standardize and automate process operations, improve the overall operational efficiency, response speed and employee work experience of the enterprise.
[0003] Existing optimization technologies applied to enterprise OA collaborative workflows mainly improve work efficiency through process combing and reengineering, intelligent approval, automated task allocation, data-driven decision-making, user experience optimization, and multi-platform integration. First, through business process analysis, redundant steps are removed and standardized and templated processes are designed so that different teams can operate consistently and efficiently. Then, with the help of rule engines and AI technology, automated approval and intelligent task allocation can reduce manual intervention and optimize resource allocation. Real-time data monitoring and analysis help identify process bottlenecks and continuously improve processes by adjusting key links. At the same time, the optimized UI design simplifies user operations, combined with mobile office support and instant messaging tool integration, allowing employees to collaborate efficiently anytime, anywhere. Ultimately, these technologies work together to form an integrated process optimization system that comprehensively improves the efficiency and flexibility of enterprise OA systems in management collaboration.
[0004] The prior art has the following deficiencies:
[0005] In the enterprise OA system, when the approval amount exceeds a certain threshold, it is necessary to switch from the regular approval process to the advanced approval process. The approval task may not be correctly switched to the advanced process. This is because the system fails to monitor and accurately update the status in real time at the condition judgment node, resulting in the approval status being stuck in the original regular process path when the process is switched. The existing technology cannot transfer the approval task to the correct advanced process in time, which causes the approval process to stagnate and the approval task to be unable to be distributed to the senior approvers in time. This will eventually lead to delays in the approval progress of high-value projects, approval decision errors, increased business risks, and additional process correction and operating costs, affecting the overall operational efficiency and business continuity of the enterprise.
[0006] The above information disclosed in this Background section is only for enhancement of understanding of the background of the present disclosure and therefore it may contain information that does not constitute the prior art that is already known to one of ordinary skill in the art. Summary of the invention
[0007] The purpose of the present invention is to provide a method for optimizing the collaborative workflow of OA in an enterprise to solve the problems in the above-mentioned background technology.
[0008] In order to achieve the above object, the present invention provides the following technical solution: a method for optimizing the collaborative workflow of OA in an enterprise, specifically comprising the following steps:
[0009] In the approval process of the enterprise OA system, real-time monitoring is performed to determine whether the approval amount in the approval task exceeds the set threshold, and if the threshold is exceeded, condition information is obtained for switching the approval task from the regular approval process to the advanced approval process;
[0010] Analyze the acquired condition information, evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process, and decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation result;
[0011] Switch the approval task from the regular approval process to the advanced approval process based on the evaluation results, and dynamically adjust the approval path during the switching process;
[0012] Determine the optimal approval path for each process switch of approval tasks, and adjust the task priority in the advanced approval process based on the switch management measures of the path;
[0013] By monitoring and recording the execution data of the adjusted approval task process, a process optimization management report is generated and provided to system administrators and business decision makers.
[0014] Preferably, the acquired condition information is analyzed to evaluate whether it is necessary to switch the approval task from the conventional approval process to the advanced approval process, and whether it is necessary to perform the process switching operation of the approval task according to the evaluation result, which specifically includes the following steps:
[0015] Preprocessing the acquired condition information for switching the approval task from the regular approval process to the advanced approval process;
[0016] extracting performance measurement information and path topology information from the preprocessed condition information;
[0017] Analyze the performance measurement information and path topology information in the extracted preprocessed condition information to generate a task priority adjustment coefficient and a path complexity index respectively;
[0018] The generated task priority adjustment coefficient and path complexity index are used to construct a switching evaluation model to generate a switching evaluation coefficient. The generated switching evaluation coefficient is compared with the pre-set switching evaluation coefficient threshold. Based on the comparison result, it is evaluated whether it is necessary to switch the approval task from the regular approval process to the advanced approval process. Based on the evaluation result, it is decided whether it is necessary to execute the process switching operation of the approval task.
[0019] Preferably, the logic for obtaining the task priority adjustment coefficient and the path complexity index is as follows:
[0020] Extract the performance measurement information from the preprocessed condition information, including the approval amount, approval time and task completion rate of several approval tasks in the historical time period, and mark them as and Indicates that in the historical period The approval amount when approving the approval task. Indicates that in the historical period The approval time for the approval task. Indicates that in the historical period The task completion rate when approving the approval task, , is a positive integer;
[0021] Calculate the task priority adjustment coefficient. The specific calculation formula is as follows:
[0022]
[0023] In the formula, is the task priority adjustment factor;
[0024] Extract the path topology information from the preprocessed condition information, including the number of approval nodes, the number of approver levels, and the number of approval order dependencies in the approval path when the approval task is approved several times in the historical time period, and mark them as and Indicates that in the historical period The number of approval nodes in the approval path when approving the approval task. Indicates that in the historical period The number of approver levels in the approval path when approving the approval task. Indicates that in the historical period The number of approval order dependencies in the approval path when approving the approval task. , is a positive integer;
[0025] Calculate the path complexity index. The specific calculation formula is as follows:
[0026]
[0027] In the formula, is the path complexity index.
[0028] Preferably, the generated task priority adjustment coefficient and path complexity index Construct a switching evaluation model and generate a switching evaluation coefficient through weighted summation , and the generated switching evaluation coefficient With the preset switching evaluation coefficient threshold Perform a comparison and evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process based on the comparison results. And decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation results. The specific comparison analysis is as follows:
[0029] like If there is no need to switch the approval task from the regular approval process to the advanced approval process, there is no need to perform the process switching operation of the approval task;
[0030] like If you need to switch the approval task from the regular approval process to the advanced approval process, you need to perform the process switching operation of the approval task.
[0031] Preferably, the approval task is switched from the regular approval process to the advanced approval process according to the evaluation result, and the approval path is dynamically adjusted during the switching process, specifically including: when the evaluation result is that the approval task needs to be switched from the regular approval process to the advanced approval process, the process switching operation of the approval task is executed; during the switching process, the approval path is dynamically adjusted, including rearranging the order of approval nodes, determining the execution order between nodes, allocating approval roles according to the permissions corresponding to the nodes, and adjusting the path dependencies.
[0032] Preferably, for each process switch of the approval task, the optimal approval path is determined, and based on the switching management measures of the path, the task priority in the advanced approval process is adjusted, which specifically includes the following steps:
[0033] Extract the path complexity information and task execution efficiency information of all approval paths during the process switching of each approval task, and perform preprocessing after extraction;
[0034] Analyze the path complexity information and task execution efficiency information of all pre-processed approval paths, and generate the path adaptability coefficient and task matching index of each approval path respectively;
[0035] A path selection evaluation model is constructed using the path adaptability coefficient and task matching index of each approval path generated, a path selection evaluation coefficient of each approval path is generated, and the path selection evaluation coefficient of each approval path generated is compared with a preset path selection evaluation coefficient threshold, and each approval path is divided into a preferred approval path and a non-preferred approval path according to the comparison result;
[0036] The path selection evaluation coefficients of all approval paths classified as preferred approval paths are set in order of size to determine the optimal approval path;
[0037] Based on the determined optimal approval path, adjust the task priority in the advanced approval process, including rearranging the order of approval nodes, determining the execution order between nodes, assigning approval roles with corresponding permissions, and adjusting path dependencies.
[0038] Preferably, the logic for obtaining the path adaptability coefficient and task matching index of each approval path is as follows:
[0039] Extract the path complexity information of all approval paths during the process switching of each approval task, including the number of nodes, average approval time and approval pass rate in each approval path during the process switching of several approval tasks in the historical time period, and mark them as and Indicates the historical period The second approval task is the first The number of nodes in the approval path, Indicates the historical period The second approval task is the first The average approval time in the approval path, Indicates the historical period The second approval task is the first The approval pass rate in the approval path, , and All are positive integers;
[0040] Calculate the path adaptability coefficient of each approval path. The specific calculation formula is as follows:
[0041]
[0042] In the formula, Indicates The path adaptability coefficient of the approval path;
[0043] Extract the task execution efficiency information of all approval paths during the process switching of each approval task, including the task processing time, task delay rate and approval role processing efficiency of each approval path during the process switching of several approval tasks in the historical time period, and mark them as and Indicates the historical period The second approval task is the first The processing time of tasks in the approval path, Indicates the historical period The second approval task is the first The task delay rate in the approval path, Indicates the historical period The second approval task is the first The efficiency of approval role processing in each approval path, , positive integer;
[0044] Calculate the task matching index of each approval path. The specific calculation formula is as follows:
[0045]
[0046] In the formula, For the The task matching index of the approval path.
[0047] Preferably, the path adaptability coefficient of each approval path generated Task Match Index Construct a path selection evaluation model and generate the path selection evaluation coefficients of each approval path through weighted summation , and the path selection evaluation coefficients of each approval path generated The preset path selection evaluation coefficient threshold Compare and divide each approval path into preferred approval path and non-preferred approval path according to the comparison results. The specific division process is as follows:
[0048] like , dividing the approval path into a preferred approval path;
[0049] like , classify the approval path as a non-preferred approval path.
[0050] Preferably, the path selection evaluation coefficients of all approval paths classified as preferred approval paths Build the collection in order of size ,gather , The approval path corresponding to the maximum value of the path selection evaluation coefficient among all the approval paths divided into preferred approval paths is taken as the optimal approval path.
[0051] In the above technical solution, the technical effects and advantages provided by the present invention are:
[0052] 1. The present invention can trigger path switching in time when conditions change by real-time monitoring of the approval amount and determining whether it exceeds a preset threshold. The present invention describes in detail the specific steps of obtaining condition information and evaluating path switching, especially by preprocessing and analyzing condition information to generate task priority adjustment coefficients and path complexity indexes, thereby constructing a switching evaluation model. This process ensures that the system can make decisions dynamically based on actual conditions, avoids the problem of approval delays caused by untimely status updates, and fundamentally improves the accuracy and timeliness of process switching. This technical effect not only optimizes path selection, but also solves the problem that approval tasks cannot be smoothly transitioned under critical conditions.
[0053] 2. During the path switching process, the present invention realizes the dynamic adjustment of the approval process by rearranging the order of approval nodes, adjusting the dependencies between nodes, and allocating appropriate permissions. At the same time, for each process switch, the present invention further introduces a path selection evaluation model to determine the optimal path through the path adaptability coefficient and the task matching index, and sorts and selects according to the path selection evaluation coefficient. This path selection method based on quantitative analysis not only improves the scientificity and reliability of decision-making, but also ensures that the system can select the path that best suits the current task from multiple candidate paths, thereby reducing approval delays, reducing erroneous allocations, and improving the overall efficiency of approval tasks.
[0054] 3. The present invention also generates a process optimization management report by monitoring and recording the adjusted approval task process data, thereby providing data-based decision support for system administrators and business decision makers. The report includes an analysis of the actual execution effect of the approval process after adjustment, such as key indicators such as process execution efficiency, path switching success rate, and task completion time. With the help of these analysis results, managers can better evaluate the actual effect of process optimization, and make further adjustments and optimizations to form a closed-loop management system. This data-based continuous optimization not only improves the intelligence of the system, but also ensures that the approval process remains efficient, stable, and controllable in dynamic changes, effectively reducing business risks and operating costs. BRIEF DESCRIPTION OF THE DRAWINGS
[0055] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.
[0056] Figure 1 It is a flow chart of the present invention applied to the method for optimizing the collaborative workflow of enterprise OA. DETAILED DESCRIPTION
[0057] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these example embodiments are provided so that the description of the present disclosure will be more comprehensive and complete, and the concept of the example embodiments will be fully conveyed to those skilled in the art.
[0058] The present invention provides Figure 1 The method for optimizing the collaborative workflow of OA in an enterprise shown in the figure specifically includes the following steps:
[0059] In the approval process of the enterprise OA system, real-time monitoring is performed to determine whether the approval amount in the approval task exceeds the set threshold, and if the threshold is exceeded, condition information is obtained for switching the approval task from the regular approval process to the advanced approval process;
[0060] Methods and specific implementations for real-time monitoring of whether the approval amount in the approval task exceeds the set threshold: In the enterprise OA system, real-time monitoring of whether the approval amount in the approval task exceeds the set threshold can be achieved in the following ways: First, the system continuously monitors the data fields related to the amount in each approval task by setting a conditional trigger based on the rule engine. When the approval task enters the approval process, the system automatically captures and reads the amount field value and compares it with the preset threshold. In specific implementation, the system will regularly poll the running approval tasks or use an event-driven monitoring mechanism. Whenever an approval task enters or the amount field changes, the system automatically checks the current amount value. At the same time, the system can use data stream processing technology (such as technology based on message queues or stream processing frameworks) to process and analyze the incoming amount data in real time to ensure that each approval amount can be compared with the set threshold in real time. When it is detected that the amount exceeds the threshold, the process switching condition judgment module is triggered to provide a basis for subsequent process adjustments. This process can be configured with parameterized threshold ranges, so that the system can flexibly adjust the judgment conditions to meet the needs of different business scenarios.
[0061] When the threshold is exceeded, the method and specific acquisition and condition information content of obtaining the condition information for switching the approval task from the regular approval process to the advanced approval process: After detecting that the amount exceeds the set threshold, the system needs to obtain the condition information for process switching, which usually includes the priority of the approval task, the business type involved in the task, the level of authority of the approver, the historical data of the task (such as the processing results of similar amount items in the past), the process path dependency, etc. In specific implementation, the system will retrieve the above condition information from the database through the data collection and rule judgment module. First, the system will extract the historical processing data related to the current approval task through the business rule engine, and calculate the priority and path dependency coefficient of the task based on these data; secondly, the system will query the business type involved in the task and the approval stage of the current task to determine whether it is necessary to enter a more advanced approval path. At the same time, the system will determine the necessity of switching based on the level of authority of the approver and the criticality of the relevant business. The process of obtaining condition information is usually achieved through a series of rule matching, data query and calculation operations. These operations can be automatically completed in the background database. After the system completes the extraction and analysis of condition information, it will generate an evaluation report or path adjustment suggestions to provide a basis for subsequent process switching decisions. This method ensures that the system can make comprehensive judgments based on multi-dimensional conditions when executing process switching, thereby improving the accuracy and rationality of switching decisions.
[0062] Analyze the acquired condition information, evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process, and decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation result;
[0063] In this embodiment, the acquired condition information is analyzed to evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process, and whether it is necessary to perform the process switching operation of the approval task according to the evaluation result, which specifically includes the following steps:
[0064] Preprocessing the acquired condition information for switching the approval task from the regular approval process to the advanced approval process;
[0065] The purpose of preprocessing conditional information is to ensure the accuracy, consistency and efficiency of calculation in the subsequent analysis and evaluation process. In complex enterprise OA systems, the conditional information obtained for switching approval task processes usually contains multiple data types and sources, which may be redundant, noisy or inconsistent in format. If preprocessing is not performed, the data analysis results may be inaccurate, thus affecting the process switching decision. Preprocessing mainly includes the following aspects: First, data cleaning is performed to remove duplicate, erroneous or invalid conditional information, such as incorrectly formatted data, null values or illogical entries; second, data normalization is performed to convert data from different sources or different scales into a unified scale to ensure that all types of data are comparable during the calculation process, such as standardizing values in different ranges to between 0 and 1; third, data aggregation is performed to merge scattered data items into more meaningful comprehensive indicators based on context or business logic, such as aggregating the same approval task data recorded multiple times into an average or sum; finally, abnormal data points that may affect the analysis results are identified and processed through anomaly detection algorithms, such as extreme values or mutation data. These preprocessing steps can be automatically completed through the rule engine and data processing modules configured in the software, making the processed data cleaner, more standardized and consistent, ensuring that evaluation parameters can be generated efficiently and accurately in subsequent analysis and reliable process switching decisions can be made.
[0066] extracting performance measurement information and path topology information from the preprocessed condition information;
[0067] Extracting performance measurement information and path topology information from preprocessed condition information can be achieved through specific software modules and data mining technologies. First, the system uses algorithms based on feature selection and classification to classify the preprocessed data, identifying numerical data related to performance measurement (such as approval amount, approval time, task completion rate, etc.) and structured data related to path topology (such as approval nodes, hierarchical relationships, path length, etc.). Next, the system matches and maps specific fields in the condition information with performance measurement information and path topology information by establishing a data mapping model. For example, using keyword matching or regular expression recognition methods, fields related to "amount", "time", "node", etc. are extracted from the preprocessed data. Then, through the aggregation analysis function, the statistical features of these fields are further extracted to generate a comprehensive information set. Finally, the system groups and marks the extracted data for easy calling and calculation in subsequent steps.
[0068] Performance measurement information refers to a series of quantitative data that reflects the performance of the approval task. These data usually include the approval amount, approval time, task completion rate, etc. The approval amount can reveal the financial importance of the task, the approval time reflects the efficiency of the process, and the task completion rate is used to measure the success rate of the task in historical data. This information is an important basis for evaluating the priority of tasks and can help the system decide whether to switch tasks from the regular approval process to the advanced approval process. Path topology information describes the structure and complexity of the approval process, including the length of the approval path (that is, the number of nodes passed), the level of approvers involved in the path (such as the level span from ordinary approvers to senior management), and the number of dependencies in the path (such as the approval result of a node depends on the result of another node). Path topology information is used to evaluate the complexity of the process, thereby helping the system identify whether process switching is needed when the complexity is high. This information is extracted and analyzed through technical means such as data structuring, topological analysis, and association mining, and is an important data basis for process optimization and decision-making.
[0069] Analyze the performance measurement information and path topology information in the extracted preprocessed condition information to generate a task priority adjustment coefficient and a path complexity index respectively;
[0070] The generated task priority adjustment coefficient and path complexity index are used to construct a switching evaluation model to generate a switching evaluation coefficient. The generated switching evaluation coefficient is compared with the pre-set switching evaluation coefficient threshold. Based on the comparison result, it is evaluated whether it is necessary to switch the approval task from the regular approval process to the advanced approval process. Based on the evaluation result, it is decided whether it is necessary to execute the process switching operation of the approval task.
[0071] The pre-set switching evaluation coefficient threshold can be determined by combining historical data analysis, model training and business needs analysis. First, the system will collect and organize data on a large number of historical approval tasks, including cases of how tasks are switched from regular approval processes to advanced approval processes under different conditions. Through machine learning algorithms such as cluster analysis and regression analysis, the system can find the rules between switching conditions and successful decisions in these data and generate a preliminary evaluation threshold range. Then, the system will simulate the switching effects under different thresholds through simulation and experiments, and adjust and optimize the evaluation threshold to achieve the best effect while ensuring efficient switching and reducing unnecessary switching. In addition to the data-driven approach, it can also be optimized in combination with actual business needs, such as human intervention or parameter fine-tuning based on factors such as corporate risk preferences, the importance of approval tasks, and project priorities, and finally determine an optimal threshold that meets the business scenario. Throughout the process, the system will provide threshold setting and optimization operations through the configuration interface and rule engine to ensure that the threshold can continue to reflect real business needs in dynamic adjustment and improve the intelligence level of process optimization.
[0072] In this embodiment, the logic for obtaining the task priority adjustment coefficient and the path complexity index is as follows:
[0073] Extract the performance measurement information from the preprocessed condition information, including the approval amount, approval time and task completion rate of several approval tasks in the historical time period, and mark them as and Indicates that in the historical period The approval amount when approving the approval task. Indicates that in the historical period The approval time for the approval task. Indicates that in the historical period The task completion rate when approving the approval task, , is a positive integer;
[0074] Extracting performance measurement information from pre-processed condition information can be achieved through data mining and data screening. The specific steps include: First, the system classifies and screens the approval task data stored in the historical time period, and identifies the fields related to the approval amount, approval time, and task completion rate. Through database query and data filtering algorithms, the system extracts multiple historical records that meet the conditions from the massive data. Next, the system uses feature extraction algorithms to further analyze and integrate these historical data, and classifies the numerical data related to the approval amount, approval time, and task completion rate into the performance measurement information set. For example, the system can extract the amount data (such as 10,000 yuan), the time spent on approval (such as the number of hours), and the task completion status (such as the completion rate percentage) of each approval task from the database by setting screening conditions. After the extraction is completed, the system standardizes and cleans the data to ensure the consistency and accuracy of the data. Finally, these processed performance measurement information will be packaged and stored for subsequent evaluation of the task priority adjustment coefficient.
[0075] Calculate the task priority adjustment coefficient. The specific calculation formula is as follows:
[0076]
[0077] In the formula, is the task priority adjustment factor;
[0078] In the calculation of the task priority adjustment coefficient, Indicates The cube root of the approval amount in the approval task. The cube root processing method can balance the impact of the amount data on the priority, avoiding the extreme impact of too large or too small amounts on the calculation results. The cube root operation not only reduces the excessive weight of large-amount tasks in the calculation, but also avoids the excessive compression of small-amount tasks on the overall priority, making the calculation results more stable and reasonable. Indicates The natural logarithm of the approval time of the approval task. The natural logarithm processing is used to amplify the role of time factors in priority evaluation, especially when the time is long, its impact is more significant. At the same time, the operation of adding 1 ensures that there will be no mathematical errors when the approval time is zero. This processing method allows tasks that take a long time to be more fully considered in priority evaluation. Indicates The inverse of the completion rate of the approval task. By calculating the inverse of the completion rate, tasks with low completion rates can be prioritized. Tasks with low completion rates usually mean greater potential risks or problems, so they need to be given higher priority in process optimization. This approach ensures that the historical performance of tasks can be fully considered when evaluating task priorities.
[0079] The size of the task priority adjustment coefficient directly reflects the urgency and importance of the approval task. When the coefficient is large, it means that the approval amount in the historical approval task is high, the approval time is long, or the task completion rate is low, which means that the task has a high risk or business criticality and needs to be handled with priority. In this case, the system is more inclined to switch the task from the regular approval process to the advanced approval process to ensure that important tasks can receive higher priority review and decision support. On the contrary, when the task priority adjustment coefficient is small, it indicates that the importance of the task is relatively low and it can be maintained in the regular approval process without switching to a more complex process.
[0080] Extract the path topology information from the preprocessed condition information, including the number of approval nodes, the number of approver levels, and the number of approval order dependencies in the approval path when the approval task is approved several times in the historical time period, and mark them as and Indicates that in the historical period The number of approval nodes in the approval path when approving the approval task. Indicates that in the historical period The number of approver levels in the approval path when approving the approval task. Indicates that in the historical period The number of approval order dependencies in the approval path when approving the approval task. , is a positive integer;
[0081] Extracting the path topology information from the preprocessed condition information can be achieved through path parsing and structured data extraction. The specific steps include: First, the system analyzes the approval process data in the historical time period through the path parsing algorithm to identify the approval nodes, the levels of the involved approvers, and the sequential dependencies between the nodes in each approval task. The system first extracts the log data related to the approval path from the database, records the node sequence of each approval task, and counts the number of approval nodes passed. At the same time, the system parses the approver role hierarchy to determine the number of approver levels corresponding to each node. Next, the system analyzes the dependencies between the nodes and identifies the path dependencies that require the approval of a certain node before entering the next node. The system parses these sequential dependencies through a graph structure or a process linked list and counts the number of dependencies. The parsed data will be standardized and packaged into a path topology information set for subsequent calculation of the path complexity index. This process relies on database query, graph structure parsing, and data analysis technology to achieve automatic extraction and structured processing of path topology information.
[0082] Calculate the path complexity index. The specific calculation formula is as follows:
[0083]
[0084] In the formula, is the path complexity index.
[0085] In the calculation of the path complexity index, Indicates The sum of the squares of the number of approval nodes and the number of approval role levels in the approval path. The calculation of the sum of squares amplifies the impact of the number of nodes and the number of role levels, so that the number of nodes and approval role levels involved in the path are fully reflected in the complexity assessment. Through the square operation, the contribution of path length and level complexity to the overall complexity of the process can be better reflected. Indicates The number of path dependencies in the approval path is incremented by 1. The increment is to avoid calculation errors when the number of dependencies is zero. At the same time, this operation ensures that the existence of dependencies can be properly reflected in the complexity calculation. The more path dependencies there are, the more complex the decision path of the process is, so it needs to be given a greater weight when evaluating path complexity. Indicates The natural logarithm of the product of the number of approval nodes and the number of approval role levels in the approval path. This processing method is used to amplify the nonlinear impact of the path structure, especially when the number of nodes and the number of levels are high at the same time, the complexity will increase significantly. The addition of 1 is also to prevent calculation errors caused by the product being zero. Through logarithmic operations, the hierarchy and structure of complex paths are more intuitively reflected in the complexity index.
[0086] The size of the path complexity index reflects the structural complexity of the approval process. When the index is larger, it means that the approval path contains more nodes, a higher number of approver levels, or more complex dependencies, which means that the process may be difficult to handle effectively in the regular approval path, so it is necessary to switch to an advanced approval process to adapt to complex process management needs. In this case, switching processes helps avoid bottlenecks or delays in complex paths. On the contrary, when the path complexity index is smaller, it indicates that the approval process is relatively simple and can be effectively completed in the regular process without switching to an advanced process.
[0087] In this embodiment, the generated task priority adjustment coefficient and path complexity index Construct a switching evaluation model and generate a switching evaluation coefficient through weighted summation , and the generated switching evaluation coefficient With the preset switching evaluation coefficient threshold Perform a comparison and evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process based on the comparison results. And decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation results. The specific comparison analysis is as follows:
[0088] like If there is no need to switch the approval task from the regular approval process to the advanced approval process, there is no need to perform the process switching operation of the approval task;
[0089] This means that the urgency of the approval task and the complexity of the process have not reached the standard for switching to the advanced approval process, indicating that the importance of the task is relatively low or the process is relatively simple. In this case, the task continues to be processed in the regular approval process, which can ensure the rational allocation of resources and avoid unnecessary process upgrades. For enterprises, this helps to maintain the efficient operation of the approval process, avoid the advanced approval process being occupied by unnecessary task switching, and improve the overall approval efficiency. Specifically, the system will continue to process the task according to the regular approval path and will not trigger the process switching operation, thereby saving time and labor costs for advanced processes.
[0090] like If you need to switch the approval task from the regular approval process to the advanced approval process, you need to perform the process switching operation of the approval task.
[0091] This means that the priority of the approval task or the complexity of the process has reached the standard that requires switching to the advanced approval process, which usually means that the task is of high importance or the process is more complex. In this case, the task will be switched to the advanced approval process for processing to ensure that it can obtain higher-level approval resources and more thorough review. This decision helps companies avoid delays or errors in the processing of critical tasks, while ensuring that complex processes are carried out in the appropriate path and reducing unnecessary business risks. The specific operation is that the system will trigger the task switch, transfer the approval task from the regular process to the advanced approval path, and update the approval path configuration of the task to ensure that subsequent approval links can be smoothly connected.
[0092] The generated task priority adjustment factor and path complexity index The process of building a switching evaluation model can be achieved through weighted summation, so as to comprehensively consider the urgency of the task and the complexity of the approval path to obtain the switching evaluation coefficient. The specific implementation method is as follows: First, the system sets the weight coefficient according to different business scenarios and actual needs. and ,in Represents the task priority adjustment coefficient The weight of Represents the path complexity index Usually, and The setting of is adjusted according to the enterprise's operating strategy, risk appetite and resource allocation strategy. For example, if the enterprise pays more attention to the importance and urgency of the task, If you are more concerned about the complexity of the approval path and possible process bottlenecks, then Next, the system performs a weighted summation of the two parameters according to the following formula: In this model, the purpose of weighted summation is to quantify the two dimensions of task priority and path complexity in a unified manner to generate a switching evaluation coefficient that comprehensively reflects the characteristics of tasks and paths. and , the system can flexibly adapt to different business needs and scenarios, and realize intelligent and dynamic process switching decisions. It will be compared with the preset switching evaluation coefficient threshold to determine whether process switching is necessary, thereby ensuring that the enterprise balances efficiency and risk in process optimization.
[0093] Switch the approval task from the regular approval process to the advanced approval process based on the evaluation results, and dynamically adjust the approval path during the switching process;
[0094] In this embodiment, the approval task is switched from the regular approval process to the advanced approval process according to the evaluation result, and the approval path is dynamically adjusted during the switching process, specifically including: when the evaluation result is that the approval task needs to be switched from the regular approval process to the advanced approval process, the process switching operation of the approval task is executed; during the switching process, the approval path is dynamically adjusted, including rearranging the order of approval nodes, determining the execution order between nodes, allocating approval roles according to the permissions corresponding to the nodes, and adjusting the path dependencies.
[0095] The process switching operation of executing approval tasks can be achieved through dynamic process reconstruction and path update mechanism. First, after the evaluation results trigger the process switching, the system will remove the approval task from the current regular approval process and relocate it to the advanced approval process according to the results of the switching evaluation model. The specific operations include: the system calls the pre-configured process path library to retrieve and load the approval path corresponding to the advanced approval process. Subsequently, the system will migrate the status, historical processing records and related data of the current approval task to the new process path to ensure that the task information is not lost during the switching process and the process connection is correct. This process is automatically completed through the task transfer module in the background. The system will reallocate tasks according to the process definition rules and dynamically update the approval path configuration of the task so that the task can continue to be executed in the new process path. In addition, the system will ensure the seamless connection of the task node information and approval progress after the switch through real-time monitoring to achieve a smooth transition of the process.
[0096] During the process switching, the rearrangement of the approval node order, determination of the node execution order, allocation of approval roles and adjustment of path dependencies are mainly achieved through the path optimization algorithm and the permission mapping mechanism. The system will first use the topological sorting algorithm or the priority-based node sorting algorithm to reorder the approval nodes in the current path according to the complexity of the advanced approval process and the urgency of the task, so as to ensure that the key nodes are processed first in the process. Then, the system determines the execution order between nodes through the logical judgment mechanism, and adjusts the order and execution conditions of the nodes according to the dependencies between nodes and the business logic of the task to avoid circular dependencies or deadlock problems in the path. In order to ensure the execution effect of the nodes, the system will automatically match the node permissions, and select the approval roles with corresponding permissions from the permission database according to the node functions and task requirements for allocation. Finally, the system will adjust the dependencies in the path according to the rearranged node order and execution conditions, so that the connection between the previous and next nodes is more logical and coherent, which not only optimizes the process execution efficiency, but also ensures the smooth switching of approval tasks between different paths, avoiding delays or repeated processing problems caused by unreasonable paths.
[0097] Determine the optimal approval path for each process switch of approval tasks, and adjust the task priority in the advanced approval process based on the switch management measures of the path;
[0098] In this embodiment, for each process switch of the approval task, the optimal approval path is determined, and the task priority in the advanced approval process is adjusted based on the switching management measures of the path, which specifically includes the following steps:
[0099] Extract the path complexity information and task execution efficiency information of all approval paths during the process switching of each approval task, and perform preprocessing after extraction;
[0100] During the process switching, the system can extract the path complexity information and task execution efficiency information of all approval paths through the path analysis module and data mining tools. First, the system will automatically parse each path in the approval process, extract the actual number of approval nodes contained in the path, the dependencies between the nodes, and the average approval time and historical approval pass rate of each node. These data are usually stored in the log database of the enterprise OA system. The system extracts the complexity and efficiency data related to each path by querying information sources such as historical approval records, approval path configuration files, and task execution logs. In order to ensure the real-time and accuracy of the data, the system will use data synchronization and update mechanisms to ensure that the extracted data reflects the current business situation. The extracted data is packaged into two categories: "path complexity information" and "task execution efficiency information" for subsequent evaluation and analysis.
[0101] The purpose of preprocessing the extracted path complexity information and task execution efficiency information is to ensure the integrity, accuracy and consistency of the data, thereby improving the reliability of subsequent evaluation and analysis. In actual operation, the extracted data may have redundancy, errors or inconsistencies, such as duplicate records, null values, inconsistent formats, etc. If these problems are not processed, they will lead to inaccurate evaluation results and affect the correctness of path selection. The preprocessing steps usually include the following aspects: first, data cleaning is performed to remove duplicate records, erroneous data and null values; second, data standardization is performed to convert data of different scales (such as time, quantity, percentage, etc.) into a unified standard format to ensure comparability in subsequent calculations; then, outlier detection and correction are performed to identify and process possible extreme values or unreasonable data; finally, data aggregation is performed to merge scattered records into representative statistical values, such as mean or median. The preprocessed data is clearer and more structured, providing a solid foundation for the accurate calculation of the subsequent path evaluation model.
[0102] Analyze the path complexity information and task execution efficiency information of all pre-processed approval paths, and generate the path adaptability coefficient and task matching index of each approval path respectively;
[0103] A path selection evaluation model is constructed using the path adaptability coefficient and task matching index of each approval path generated, a path selection evaluation coefficient of each approval path is generated, and the path selection evaluation coefficient of each approval path generated is compared with a preset path selection evaluation coefficient threshold, and each approval path is divided into a preferred approval path and a non-preferred approval path according to the comparison result;
[0104] The preset path selection evaluation coefficient threshold can be determined by combining historical data analysis and model optimization. The specific implementation method is as follows: First, the system will collect and analyze the data of a large number of historical approval tasks, including key performance indicators such as the success rate, processing time, and delay of tasks on different approval paths. Through machine learning algorithms, such as regression analysis or cluster analysis, the system can identify the relationship between different path evaluation coefficients and task success rates, thereby preliminarily determining the optimal evaluation coefficient range for various types of tasks under different paths. Next, the system will evaluate the path selection results under different thresholds through simulation and emulation, optimize and fine-tune the thresholds to ensure the accuracy and effectiveness of path selection under different business scenarios. Finally, the system will manually review and regularly update the thresholds after model optimization in combination with actual business needs and risk management strategies to ensure that they are always consistent with the company's operating goals and strategies. The entire process is implemented through the data analysis module, model training module, and parameter configuration interface in the software, so that the path selection evaluation coefficient threshold can dynamically adapt to different scenarios and business changes.
[0105] The path selection evaluation coefficients of all approval paths classified as preferred approval paths are set in order of size to determine the optimal approval path;
[0106] Based on the determined optimal approval path, adjust the task priority in the advanced approval process, including rearranging the order of approval nodes, determining the execution order between nodes, assigning approval roles with corresponding permissions, and adjusting path dependencies.
[0107] In this embodiment, the logic for obtaining the path adaptability coefficient and task matching index of each approval path is as follows:
[0108] Extract the path complexity information of all approval paths during the process switching of each approval task, including the number of nodes, average approval time and approval pass rate in each approval path during the process switching of several approval tasks in the historical time period, and mark them as and Indicates the historical period The second approval task is the first The number of nodes in the approval path, Indicates the historical period The second approval task is the first The average approval time in the approval path, Indicates the historical period The second approval task is the first The approval pass rate in the approval path, , and are all positive integers;
[0109] Extracting the path complexity information of all approval paths during the process switching of approval tasks can be mainly achieved through the data recording and analysis module in the approval process management system. Specifically, the system automatically analyzes and filters the process data in the historical approval log to extract the key quantitative data of each approval path, such as the number of nodes, average approval time, and approval pass rate. First, the system will parse the nodes of different approval paths, count the actual number of nodes contained in each path, and record the average execution time of the nodes. Then, the system calculates the average approval pass rate of all nodes in each path by querying historical data, usually expressed as a percentage. In order to ensure the accuracy of the data, the system will apply data cleaning and outlier detection algorithms to standardize and optimize the extracted data, and finally form structured path complexity information.
[0110] Calculate the path adaptability coefficient of each approval path. The specific calculation formula is as follows:
[0111]
[0112] In the formula, Indicates The path adaptability coefficient of the approval path;
[0113] The size of the path adaptability coefficient reflects the balance between the complexity and execution efficiency of each approval path. The larger the coefficient, the more complex and adaptable the path is in terms of the number of nodes, approval time, approval pass rate, etc., which means that the path performs better when processing more complex tasks. When selecting a specific approval path, a path with a higher path adaptability coefficient is more suitable for processing approval tasks with high task complexity and many dependencies, because its structure can better cope with complex approval scenarios and ensure the smooth operation of the process. Therefore, in the path selection process, the system will give priority to paths with larger path adaptability coefficients to ensure robustness in critical task processing.
[0114] Extract the task execution efficiency information of all approval paths during the process switching of each approval task, including the task processing time, task delay rate and approval role processing efficiency of each approval path during the process switching of several approval tasks in the historical time period, and mark them as and Indicates the historical period The second approval task is the first The processing time of tasks in the approval path, Indicates the historical period The second approval task is the first The task delay rate in the approval path, Indicates the historical period The second approval task is the first The efficiency of approval role processing in each approval path, , positive integer;
[0115] Extracting the task execution efficiency information of all approval paths during the process switching of approval tasks can be mainly achieved through historical task data analysis and role performance tracking modules. The system first extracts the processing time of each approval task in each approval path from the task execution log, including the processing start time and end time of each node, and calculates the processing time by calculating the time difference. Then, the system calculates the delay rate of the task by analyzing the delay in task execution, such as whether the task exceeds the preset processing time limit. For the processing efficiency of the approval role, the system quantifies the task processing speed and decision accuracy of the approval role in different paths in the historical data, usually measured by the average response time and completion quality of the approval role in processing similar tasks. The extracted data is cleaned and normalized to form standardized task execution efficiency information for subsequent path evaluation and optimization operations. The whole process is automatically implemented in the software through data analysis and task performance modules to ensure the real-time and accuracy of information.
[0116] Calculate the task matching index of each approval path. The specific calculation formula is as follows:
[0117]
[0118] In the formula, For the The task matching index of the approval path.
[0119] The size of the task matching index reflects the historical performance and adaptability of each approval path when handling a specific task. The larger the index, the lower the delay rate and the higher the processing efficiency of the path when handling similar tasks in the past, indicating that the path is highly matched with the needs of the current task. When selecting a specific approval path, a path with a higher task matching index means that the path has a higher success rate and efficiency when handling similar tasks. Therefore, the system will give priority to paths with a higher task matching index to ensure that the current task can be completed quickly and accurately, improving approval efficiency and consistency in task processing.
[0120] In this embodiment, the path adaptability coefficients of each approval path generated are Task Match Index Construct a path selection evaluation model and generate the path selection evaluation coefficients of each approval path through weighted summation , and the path selection evaluation coefficients of each approval path generated The preset path selection evaluation coefficient threshold Compare and divide each approval path into preferred approval path and non-preferred approval path according to the comparison results. The specific division process is as follows:
[0121] like , dividing the approval path into a preferred approval path;
[0122] This means that the approval path has met the expected standards in terms of path adaptability and task matching, and has performed well. In this case, the path is classified as a preferred approval path and becomes one of the optimal path candidates. This means that the path has the best conditions and efficient execution capabilities to handle the current approval task, and can maximize the efficiency and accuracy of the process. The impact is that the system will give priority to these preferred approval paths, improve the reliability of decision-making and the success rate of tasks in subsequent path selection, and ensure that approval tasks are completed quickly on the appropriate path.
[0123] like , classify the approval path as a non-preferred approval path.
[0124] This means that the approval path does not meet the expected standards in terms of path adaptability or task matching, and there are deficiencies. In this case, the path is classified as a non-preferred approval path and is excluded from the optimal path selection. This indicates that the path may face the risk of inefficiency, delays or errors when processing the current task, and its structure and performance cannot guarantee the smooth progress of the approval task. The impact is that these paths will no longer be considered as candidate paths, thereby reducing the possibility of process stagnation or failure due to the selection of an unsuitable path during the approval process, and improving the robustness and reliability of the entire approval system.
[0125] In this embodiment, the path selection evaluation coefficients of all approval paths classified as preferred approval paths are Build the collection in order of size ,gather , The approval path corresponding to the maximum value of the path selection evaluation coefficient among all the approval paths divided into preferred approval paths is taken as the optimal approval path.
[0126] The purpose of this is to accurately select the approval path that best suits the current task from among many preferred approval paths by using the size of the path selection evaluation coefficient. The preferred approval path is screened based on the path adaptability coefficient and the task matching index. Among these preferred paths, the path with the largest path selection evaluation coefficient often has higher efficiency, stability and adaptability, and is therefore superior in handling complex tasks, ensuring smooth approval processes, and reducing delays and errors. By sorting these preferred paths by evaluation coefficient, the system can more intuitively determine which path is most suitable for performing tasks in the current scenario. This not only improves the accuracy and reliability of process decisions, but also avoids the subjectivity and uncertainty of manual path selection, thereby ensuring that the system can adaptively select the best path when faced with a variety of approval tasks, maximizing approval efficiency, minimizing business risks, and optimizing resource utilization.
[0127] By monitoring and recording the execution data of the adjusted approval task process, a process optimization management report is generated and provided to system administrators and business decision makers.
[0128] The system can collect various key data in the process of approval task execution in real time through the integrated process monitoring module. These data include task processing time, approval pass rate of each node, task delay, execution efficiency change after path selection, etc. The monitoring module uses log tracking, data collection and sensor technology to automatically capture various operation details in the approval process and record and store key data in real time. These data can be aggregated into the data warehouse, and after cleaning, filtering and standardization, a structured data set is formed to ensure the accuracy and reliability of subsequent analysis.
[0129] After collecting and organizing the execution data, the system will further process the data through the data analysis module. Specific operations include multi-dimensional analysis of bottlenecks, delay nodes, efficiency improvements after path adjustment, etc. in process execution. The system can use data visualization technology to present the analysis results in the form of charts, trend lines and indicator summaries. The generated process optimization management report usually includes approval task completion rate, approval efficiency changes, task processing time distribution, process adjustment effect evaluation and other content. The report can be automatically generated and provided in the form of PDF, Excel or online dashboard for easy reference by system administrators and business decision makers. The system can also provide custom reporting functions, allowing administrators to select data dimensions and analysis angles according to specific needs and customize personalized reports.
[0130] The purpose of generating process optimization management reports is to provide data-driven decision support for system administrators and business decision makers. By recording and analyzing the adjusted approval process execution data, administrators can intuitively see the changes before and after the process adjustment, understand the operating efficiency of the current process, discover potential problems and optimize them in a timely manner. This data-based analysis can effectively help decision makers evaluate the effect of process improvement, identify inefficient links in the process, and formulate more accurate optimization strategies, thereby improving overall approval efficiency and process compliance. In addition, by generating reports regularly, it can help companies form a visual performance evaluation system, promote the continuous optimization of business processes, and ensure that companies maintain their competitive advantage in a dynamic environment.
[0131] The above formulas are all dimensionless and numerical calculations. The formula is a formula for the most recent real situation obtained by collecting a large amount of data and performing software simulation. The preset parameters in the formula are set by technicians in this field according to actual conditions.
[0132] The above embodiments can be implemented in whole or in part by software, hardware, firmware or any other combination. When implemented by software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center by wired or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that contains one or more available media sets. The available medium can be a magnetic medium (for example, a floppy disk, a hard disk, a tape), an optical medium (for example, a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state hard disk.
[0133] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0134] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0135] In the several embodiments provided in the present application, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0136] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0137] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0138] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
Claims
1. The method for optimizing the collaborative workflow of OA in an enterprise is characterized by: The specific steps include: In the approval process of the enterprise OA system, real-time monitoring is performed to determine whether the approval amount in the approval task exceeds the set threshold, and if the threshold is exceeded, condition information is obtained for switching the approval task from the regular approval process to the advanced approval process; Analyze the acquired condition information, evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process, and decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation result; Switch the approval task from the regular approval process to the advanced approval process based on the evaluation results, and dynamically adjust the approval path during the switching process; Determine the optimal approval path for each process switch of approval tasks, and adjust the task priority in the advanced approval process based on the switch management measures of the path; For each process switch of approval tasks, determine the optimal approval path, and adjust the task priority in the advanced approval process based on the switch management measures of the path. The specific steps include: Extract the path complexity information and task execution efficiency information of all approval paths during the process switching of each approval task, and perform preprocessing after extraction; Analyze the path complexity information and task execution efficiency information of all pre-processed approval paths, and generate the path adaptability coefficient and task matching index of each approval path respectively; The logic for obtaining the path adaptability coefficient and task matching index of each approval path is as follows: Extract the path complexity information of all approval paths during the process switching of each approval task, including the number of nodes, average approval time and approval pass rate in each approval path during the process switching of several approval tasks in the historical time period, and mark them as and Indicates the number of nodes in the nth approval path during the process switching of the mth approval task in the historical time period. It represents the average approval time of the mth approval task in the nth approval path during the process switching in the historical time period. It represents the approval pass rate of the m-th approval task in the n-th approval path during the process switching in the historical time period, m = 1, 2, 3, ..., h, n = 1, 2, 3, ..., d, h and d are both positive integers; Calculate the path adaptability coefficient of each approval path. The specific calculation formula is as follows: Where PAC n represents the path adaptability coefficient of the nth approval path; Extract the task execution efficiency information of all approval paths during the process switching of each approval task, including the task processing time, task delay rate and approval role processing efficiency of each approval path during the process switching of several approval tasks in the historical time period, and mark them as and Indicates the task processing time of the u-th approval task in the n-th approval path during the process switching process in the historical time period. It represents the task delay rate of the nth approval path during the process switching of the uth approval task in the historical time period. It represents the processing efficiency of the approval role in the nth approval path during the process switching of the uth approval task in the historical time period, u = 1, 2, 3, ..., p, where p is a positive integer; Calculate the task matching index of each approval path. The specific calculation formula is as follows: Where, TMI n is the task matching index of the nth approval path; A path selection evaluation model is constructed using the path adaptability coefficient and task matching index of each approval path generated, a path selection evaluation coefficient of each approval path is generated, and the path selection evaluation coefficient of each approval path generated is compared with a preset path selection evaluation coefficient threshold, and each approval path is divided into a preferred approval path and a non-preferred approval path according to the comparison result; The path selection evaluation coefficients of all approval paths classified as preferred approval paths are set in order of size to determine the optimal approval path; Based on the determined optimal approval path, adjust the task priority in the advanced approval process, including rearranging the order of approval nodes, determining the execution order between nodes, assigning approval roles with corresponding permissions, and adjusting path dependencies; By monitoring and recording the execution data of the adjusted approval task process, a process optimization management report is generated and provided to system administrators and business decision makers.
2. The method for optimizing enterprise OA collaborative workflow according to claim 1 is characterized in that: Analyze the acquired condition information to evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process, and decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation result. Specifically, the following steps are included: Preprocessing the acquired condition information for switching the approval task from the regular approval process to the advanced approval process; extracting performance measurement information and path topology information from the preprocessed condition information; Analyze the performance measurement information and path topology information in the extracted preprocessed condition information to generate a task priority adjustment coefficient and a path complexity index respectively; The generated task priority adjustment coefficient and path complexity index are used to construct a switching evaluation model to generate a switching evaluation coefficient. The generated switching evaluation coefficient is compared with the pre-set switching evaluation coefficient threshold. Based on the comparison result, it is evaluated whether it is necessary to switch the approval task from the regular approval process to the advanced approval process. Based on the evaluation result, it is decided whether it is necessary to execute the process switching operation of the approval task.
3. The method for optimizing enterprise OA collaborative workflow according to claim 2 is characterized in that: The logic for obtaining the task priority adjustment coefficient and the path complexity index is as follows: Extract the performance measurement information from the preprocessed condition information, including the approval amount, approval time and task completion rate of several approval tasks in the historical time period, and mark them as A i , T i and C i , A i Indicates the approval amount of the approval task for the i-th time in the historical time period, T i Indicates the approval time of the i-th approval task in the historical time period, C i It represents the task completion rate when the approval task is approved for the i-th time in the historical time period, i = 1, 2, 3, ..., g, g is a positive integer; Calculate the task priority adjustment coefficient. The specific calculation formula is as follows: In the formula, TPAC is the task priority adjustment coefficient; Extract the path topology information from the preprocessed condition information, including the number of approval nodes, the number of approver levels, and the number of approval order dependencies in the approval path when the approval task is approved several times in the historical time period, and mark them as N j , R j and D j , N j R represents the number of approval nodes in the approval path when the approval task is approved for the jth time in the historical time period. j Indicates the number of approver levels in the approval path when the approval task is approved for the jth time in the historical time period, D j represents the number of approval order dependencies in the approval path when the approval task is approved for the jth time in the historical time period, j = 1, 2, 3, ..., k, where k is a positive integer; Calculate the path complexity index. The specific calculation formula is as follows: Where PCI is the path complexity index.
4. The method for optimizing enterprise OA collaborative workflow according to claim 3 is characterized in that: The generated task priority adjustment coefficient TPAC and path complexity index PCI are used to construct a switching evaluation model, and the switching evaluation coefficient SEC is generated by weighted summation. The generated switching evaluation coefficient SEC is compared with the preset switching evaluation coefficient threshold SEC. yuzhi Perform a comparison and evaluate whether it is necessary to switch the approval task from the regular approval process to the advanced approval process based on the comparison results. And decide whether it is necessary to perform the process switching operation of the approval task based on the evaluation results. The specific comparison analysis is as follows: If the SEC <SEC yuzhi If there is no need to switch the approval task from the regular approval process to the advanced approval process, there is no need to perform the process switching operation of the approval task; If SEC ≥ SEC yuzhi If you need to switch the approval task from the regular approval process to the advanced approval process, you need to perform the process switching operation of the approval task.
5. The method for optimizing enterprise OA collaborative workflow according to claim 4 is characterized in that: According to the evaluation results, the approval task is switched from the regular approval process to the advanced approval process, and the approval path is dynamically adjusted during the switching process, specifically including: when the evaluation result is that the approval task needs to be switched from the regular approval process to the advanced approval process, the process switching operation of the approval task is executed; during the switching process, the approval path is dynamically adjusted, including rearranging the order of approval nodes, determining the execution order between nodes, allocating approval roles according to the permissions corresponding to the nodes, and adjusting the path dependencies.
6. The method for optimizing enterprise OA collaborative workflow according to claim 5 is characterized in that: The path adaptability coefficient PAC of each approval path generated n and Task Fit Index TMI n Construct a path selection evaluation model and generate the path selection evaluation coefficient PSEC of each approval path through weighted summation n , and the path selection evaluation coefficient PSEC of each approval path generated n and the preset path selection evaluation coefficient threshold PSEC yuzhi Compare and divide each approval path into preferred approval path and non-preferred approval path according to the comparison results. The specific division process is as follows: If PSEC n >PSEC yuzhi , dividing the approval path into a preferred approval path; If PSEC n ≤PSEC yuzhi , classify the approval path as a non-preferred approval path.
7. The method for optimizing enterprise OA collaborative workflow according to claim 6 is characterized in that: The path selection evaluation coefficient PSEC of all approval paths classified as preferred approval paths n Construct a set G in order of size, set G = {PSEC1, PSEC2, PSEC3, PSEC4, ..., PSEC a-1 , PSEC a }, PSEC a ≥PSEC a-1 ≥…≥PSEC4≥PSEC3≥PSEC2≥PSEC1, the approval path corresponding to the maximum value of the path selection evaluation coefficient among all the approval paths divided into preferred approval paths is taken as the optimal approval path.
