Enterprise business process map-based end-to-end process run-through method and device

By calculating the process similarity method, efficient matching and integration of end-to-end processes in the enterprise business process map is achieved, and the problem of process design dependence on experience and familiarity in the existing technology is solved, and the objectivity and accuracy of the process is improved. , identify and optimize problems in the process and improve overall efficiency.

CN118967037APending Publication Date: 2024-11-15SHENYANG AIRCRAFT DESIGN INST AVIATION IND CORP OF CHINA
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202411051166.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-01
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The existing enterprise business process system cannot explicitly describe the entire process from demand proposal to satisfaction of stakeholders, resulting in limited efficiency and accuracy of end-to-end process integration, and rely on the experience of process designers and the enterprise's entire process map. Familiarity.

Method used

Using top-down value flow deconstruction and bottom-up process element matching methods, efficiently match the company's existing business processes by calculating the similarity of the process stage, completing the end-to-end process integration, and positioning imperfections in the process system content.

Benefits of technology

It improves the efficiency of end-to-end processes, makes them more objective and accurate, can identify breakpoints and bottlenecks in the process, promotes the improvement of overall process efficiency, and achieves global optimization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118967037A_ABST
    Figure CN118967037A_ABST
Patent Text Reader

Abstract

The invention belongs to the field of process design, and relates to an end-to-end process run-through method and device based on an enterprise business process map. The method comprises the following steps: S1, acquiring a plurality of process stages split according to an end-to-end process run-through requirement; s2, calculating a first similarity between a starting condition A1 of a process stage and a starting condition B1 of a to-be-matched process; s3, when the first similarity exceeds a set value, calculating a second similarity between an end condition A2 of the process stage and an end condition B2 of the to-be-matched process; s4, when a mean value of the first similarity and the second similarity exceeds a set value, determining that the to-be-matched process can be used for assembling an end-to-end process run-through requirement; and S5, when all the to-be-matched processes cannot be matched with the process stage, splitting the process stage to obtain a plurality of new process stages, and then matching the new process stages with the to-be-matched processes. According to the method, the end-to-end process connection efficiency is improved, and connection is more objective and accurate.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of process design, and in particular relates to an end-to-end process connection method and device based on an enterprise business process map. Background Art

[0002] The construction of an enterprise's business process system usually reflects business capabilities and functions through a vertical undertaking strategy, solves the problem of full business coverage, forms a business process system that can reflect the overall picture of the enterprise's business, and becomes a carrier for the attribution of enterprise responsibilities and the integration of elements. However, such a process is relatively static and cannot explicitly describe the entire process from the proposal to the satisfaction of stakeholders' needs, and cannot be put into operation and application. Therefore, the concept of "end-to-end" process is introduced. By forming an end-to-end process based on the combination of the enterprise's existing business processes, the value stream can be connected according to the following steps.

[0003] (1) According to the management objectives and business scope of the end-to-end process and in accordance with the PDCA principle, split the end-to-end process stages;

[0004] (2) List the inputs, outputs and main logical relationships between businesses;

[0005] (3) Combine the end-to-end process stages based on the results of the first and second steps to form a business scenario diagram;

[0006] (4) According to the second step, based on the process map, the final level process that constitutes each business scenario is selected to form a list of business processes that constitute the end-to-end process;

[0007] (5) When executing step 4, the processes that cannot be selected in the process map are marked as "not selected" in the composition list;

[0008] (6) According to step 5, improve the process and add it to the process list;

[0009] (7) Complete the end-to-end process.

[0010] The deconstruction of the end-to-end process phase in step 3 of the above end-to-end process penetration is a gradually refined process. The specific degree of refinement depends entirely on the experience and judgment of the process designer. If the decomposition is too coarse or too fine, it will not be able to adapt to the existing business processes of the enterprise. In addition, the selection of the process to be assembled based on the process map in step 4 depends entirely on the process designer's familiarity with the enterprise's global process map. The above problems will have a certain impact on the efficiency and accuracy of the end-to-end process penetration. Summary of the invention

[0011] In order to solve the above problems, the present application provides an end-to-end process connection method and device based on the enterprise business process map. By combining the top-down value stream deconstruction and the bottom-up process element matching method, the existing business processes of the enterprise can be matched efficiently and accurately, and the end-to-end process connection can be completed. At the same time, the imperfect content in the existing process system can be located, providing a basis for enterprise process optimization.

[0012] The first aspect of the present application provides an end-to-end process connection method based on an enterprise business process map, which mainly includes:

[0013] Step S1, obtaining multiple process stages divided by the end-to-end process connection requirements, each process stage having a start condition A1 and an end condition A2;

[0014] Step S2: for each process stage and each process to be matched in the enterprise business process map database, calculate the first similarity between the start condition A1 of the process stage and the start condition B1 of the process to be matched;

[0015] Step S3: when the first similarity exceeds a set value, calculate a second similarity between the end condition A2 of the process stage and the end condition B2 of the process to be matched;

[0016] Step S4: when the average of the first similarity and the second similarity exceeds a set value, determining that the process to be matched can be used to assemble an end-to-end process connection requirement;

[0017] Step S5: When all the to-be-matched processes in the enterprise business process map database cannot match the process stage, the process stage is split to obtain multiple new process stages, which are then matched with the to-be-matched processes in the enterprise business process map database.

[0018] Preferably, step S2 further comprises:

[0019] Step S21, constructing a matrix D with N rows and M columns, where N is the length of the start condition B1 of the process to be matched plus one, and M is the length of the start condition A1 of the process stage plus one;

[0020] Step S22, the first row of the matrix is ​​assigned a value of 0, 1, 2 ... N, and the first column is assigned a value of 0, 1, 2 ... M;

[0021] Step S23: Assign values ​​to other elements D[i,j] in the matrix D according to the formula:

[0022] D[i,j]=min(D[i-1,j]+1,D[i,j-1]+1,D[i-1,j-1]+temp);

[0023] Wherein, min is the minimum value function. When the i-1th character in the starting condition B1 is consistent with the j-1th character in the starting condition A1, temp = 0, otherwise temp = 1;

[0024] Step S24, calculate the distance Dis(A1-B1)=D[i+1,j+1] between the start condition A1 of the process stage and the start condition B1 of the process to be matched;

[0025] Step S25, calculating the first similarity sim1=1-Dis(A1-B1) / max(N-1,M-1) between the start condition A1 of the process stage and the start condition B1 of the process to be matched, wherein max is a maximum value function.

[0026] Preferably, the set value is not less than 60%.

[0027] The second aspect of the present application provides an end-to-end process connection device based on an enterprise business process map, which mainly includes:

[0028] The process stage acquisition module is used to acquire multiple process stages split by the end-to-end process penetration requirements, each of which has a start condition A1 and an end condition A2;

[0029] A first similarity calculation module is used to calculate the first similarity between the start condition A1 of the process stage and the start condition B1 of the process to be matched for each process stage and each process to be matched in the enterprise business process map database;

[0030] A second similarity calculation module, used for calculating a second similarity between the end condition A2 of the process stage and the end condition B2 of the process to be matched when the first similarity exceeds a set value;

[0031] A process assembly module, configured to determine that the process to be matched can be used to assemble an end-to-end process connection requirement when the average of the first similarity and the second similarity exceeds a set value;

[0032] The process stage splitting module is used to split the process stage when all the to-be-matched processes in the enterprise business process map database cannot match the process stage, so as to obtain multiple new process stages, and then match them with the to-be-matched processes in the enterprise business process map database.

[0033] Preferably, the first similarity calculation module includes:

[0034] A matrix construction unit, used to construct a matrix D with N rows and M columns, where N is the length of the start condition B1 of the process to be matched plus one, and M is the length of the start condition A1 of the process stage plus one;

[0035] The matrix initial assignment unit is used to assign the first row of the matrix to 0, 1, 2...N, and the first column to 0, 1, 2...M;

[0036] The matrix secondary assignment unit is used to assign values ​​to other elements D[i,j] in the matrix D according to the formula:

[0037] D[i,j]=min(D[i-1,j]+1,D[i,j-1]+1,D[i-1,j-1]+temp);

[0038] Wherein, min is the minimum value function. When the i-1th character in the starting condition B1 is consistent with the j-1th character in the starting condition A1, temp = 0, otherwise temp = 1;

[0039] A condition distance calculation unit, used to calculate the distance Dis(A1-B1)=D[i+1,j+1] between the start condition A1 of the process stage and the start condition B1 of the process to be matched;

[0040] The first similarity calculation unit is used to calculate the first similarity sim1=1-Dis(A1-B1) / max(N-1,M-1) between the start condition A1 of the process stage and the start condition B1 of the process to be matched, where max is a maximum value function.

[0041] Preferably, the set value is not less than 60%.

[0042] This application improves the efficiency of the end-to-end process and makes it more objective and accurate. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] Figure 1 It is a flowchart of a preferred embodiment of the end-to-end process connection method based on the enterprise business process map of the present application.

[0044] Figure 2 It is a schematic diagram of the matrix D with initial assignment.

[0045] Figure 3 This is a schematic diagram of the matrix D obtained by the final calculation. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical scheme and advantages of the implementation of this application clearer, the technical scheme in the implementation of this application will be described in more detail in combination with the drawings in the implementation of this application. In the drawings, the same or similar reference numerals throughout represent the same or similar elements or elements with the same or similar functions. The described implementation is a part of the implementation of this application, not all of the implementations. The implementation described below with reference to the drawings is exemplary and is intended to be used to explain this application, and cannot be understood as a limitation on this application. Based on the implementation in this application, all other implementations obtained by ordinary technicians in this field without making creative work are within the scope of protection of this application. The implementation of this application is described in detail below in combination with the drawings.

[0047] The first aspect of the present application provides an end-to-end process connection method based on an enterprise business process map, such as Figure 1 As shown, it mainly includes:

[0048] Step S1, obtaining multiple process stages split by the end-to-end process connection requirements, each process stage having a start condition A1 and an end condition A2.

[0049] This step is based on the traditional PDCA principle. According to the management objectives and business scope of the end-to-end process, the end-to-end process stages are split to form multiple process stages, and then the start condition A1 and end condition A2 of each process stage are extracted. For example, an enterprise has a need for the end-to-end process of "new employee onboarding management". The goal is to achieve standardized management of new employee onboarding by completely designing the full-cycle management process from new employee onboarding to new employee employment. One of the process stages of this end-to-end process is "new employee onboarding training management". The start condition A1 of this process stage is "onboarding procedures completed", and the end condition A2 is "onboarding training completed".

[0050] Step S2: For each process stage and each process to be matched in the enterprise business process map database, calculate the first similarity between the start condition A1 of the process stage and the start condition B1 of the process to be matched.

[0051] The enterprise business process map database stores multiple detailed business processes solidified by the enterprise. The purpose of this application is to find the process stage that matches the above-mentioned "new employee onboarding training management" from the enterprise business process map database, so that the existing process in the database can be used to replace the process stage, thereby assembling the entire "new employee onboarding management" end-to-end process design requirements.

[0052] This step first calls the mybatyis framework to query the business process map database to obtain all business processes, encapsulates the business processes into a business process pool, that is, retains the start and end conditions of each business process, and then continuously takes out each business process from the business process pool as the process to be matched with the process stage of step S1.

[0053] Assuming that when the "new employee training process" is matched from the enterprise business process map database, the starting condition B1 of the process is "completion of onboarding procedures", then step S2 is used to calculate the first similarity between the starting condition A1 and the starting condition B1.

[0054] In some optional implementations, step S2 further includes:

[0055] Step S21 , construct a matrix D with N rows and M columns, where N is the length of the start condition B1 of the process to be matched plus one, and M is the length of the start condition A1 of the process stage plus one.

[0056] In this step, the length refers to the length of the string, such as bits, bytes or double words. Here, taking Chinese as an example, the length is the number of words in the condition. For example, when the starting condition A1 of the above process stage is "onboarding procedures completed", its length is 8, then M = 9; similarly, when the starting condition B1 of the above process to be matched is "onboarding procedures completed", its length is 8, then N = 9. Thus, a 9*9 matrix D is constructed, such as Figure 2 shown.

[0057] Step S22: The first row of the matrix is ​​assigned a value of 0, 1, 2 ... N, and the first column is assigned a value of 0, 1, 2 ... M. Figure 2 As shown, a schematic diagram of the matrix D with initial assignment is given.

[0058] Step S23: Assign values ​​to other elements D[i,j] in the matrix D according to the formula:

[0059] D[i,j]=min(D[i-1,j]+1,D[i,j-1]+1,D[i-1,j-1]+temp);

[0060] Among them, min is the minimum value function. When the i-1th character in the starting condition B1 is consistent with the j-1th character in the starting condition A1, temp=0, otherwise temp=1.

[0061] Taking the calculation of D[2,2] as an example, then:

[0062] D[2,2] = min(D[1,2] + 1, D[2,1] + 1, D[1,1] + temp) = min(2, 2, 0). Here, the first character of the start condition A1 of this process stage and the characters of the start condition B1 of the process to be matched are both "in", so temp = 0.

[0063] After calculation, the final matrix D is as Figure 3 shown.

[0064] Step S24: Calculate the distance Dis(A1 - B1) between the start condition A1 of the process stage and the start condition B1 of the process to be matched, where Dis(A1 - B1) = D[i + 1, j + 1].

[0065] In this step, the distance Dis(A1 - B1) is actually the value of the bottom - rightmost element of the matrix D. From the assignment formula of D[i, j], it can be seen that when the (i - 1) - th character in the start condition B1 is different from the (j - 1) - th character in the start condition A1, temp is incremented by one. Cumulatively, finally, the maximum accumulation occurs at D[i + 1, j + 1], that is, referring to Figure 3 , it can be seen that the last character of the start condition B1 is different from the last character of the start condition A1. Here, the cumulative calculation gives D[9, 9] = 1. If there are two different characters between the start condition B1 and the start condition A1, then 2 will be accumulated at D[9, 9] of the matrix, that is, D[9, 9] = 2. This formula indicates the difference between the start condition A1 and the start condition B1 strings, that is, the number of conversions required for the start condition A1 string to become the start condition B1 string.

[0066] Step S25: Calculate the first similarity sim1 between the start condition A1 of the process stage and the start condition B1 of the process to be matched, where sim1 = 1 - Dis(A1 - B1) / max(N - 1, M - 1), and max is the maximum - value function.

[0067] In this embodiment, the lengths of the two strings are both 8, so sim1 = 1 - 1 / 8 = 87.5%.

[0068] Step S3: When the first similarity exceeds the set value, calculate the second similarity between the end condition A2 of the process stage and the end condition B2 of the process to be matched.

[0069] The calculation method of the second similarity is the same as that of the first similarity, so it will not be elaborated here.

[0070] Step S4: When the average value of the first similarity and the second similarity exceeds the set value, determine that the process to be matched can be used to assemble the end - to - end process through - connection requirements.

[0071] It can be seen from step S3 and step S4 that the present application pays more attention to the similarity of the starting conditions. When the similarity of the starting conditions meets the requirements, the similarity of the ending conditions is compared, and the similarity weight of the starting conditions is high, that is, when the starting conditions meet the similarity, the ending conditions can be approximately similar. In some optional implementations, the set value is not less than 60%, for example, it can be 60%, or it can be 70%. Taking 60% as an example, the first similarity sim1 calculated above = 87.5%>60%, and therefore, the second similarity sim2 actually meets the requirements as long as it exceeds 32.5%.

[0072] Step S5: When all the to-be-matched processes in the enterprise business process map database cannot match the process stage, the process stage is split to obtain multiple new process stages, which are then matched with the to-be-matched processes in the enterprise business process map database.

[0073] Through the above steps S2 to S4, the to-be-matched processes that match each process stage can be selected from the database, and multiple to-be-matched processes can be assembled into an end-to-end process "New Employee Onboarding Management". If no suitable process is found for a certain process stage after traversing all the to-be-matched processes in the database, it means that the database is missing the relevant process, and the process stage can be split and deconstructed again. If each stage contains only one role, the matching process ends. It means that the matching process has indeed not been found in the business process pool or database, and the relevant information can be added to the list of to-be-perfected processes as the basis for subsequent process map optimization, otherwise go to step S1 and repeat the matching process.

[0074] The process of matching the application process can be achieved through a program. On the one hand, it can greatly improve the efficiency of end-to-end process penetration. On the other hand, it abandons the traditional working method of relying on the experience of process designers to carry out end-to-end process penetration, making the penetration more objective and accurate. At the same time, in the process of process matching and penetration, it can clearly identify the "breakpoints" and "blocking points" in the company's existing process system, and expose hidden process design problems. With the optimization and improvement of the process, it can continuously promote the improvement of overall process efficiency, enter a virtuous circle, and achieve global optimization.

[0075] The second aspect of the present application provides an end-to-end process connection device based on an enterprise business process map corresponding to the above method, mainly comprising:

[0076] The process stage acquisition module is used to acquire multiple process stages split by the end-to-end process penetration requirements, each of which has a start condition A1 and an end condition A2;

[0077] A first similarity calculation module is used to calculate the first similarity between the start condition A1 of the process stage and the start condition B1 of the process to be matched for each process stage and each process to be matched in the enterprise business process map database;

[0078] A second similarity calculation module, used for calculating a second similarity between the end condition A2 of the process stage and the end condition B2 of the process to be matched when the first similarity exceeds a set value;

[0079] A process assembly module, configured to determine that the process to be matched can be used to assemble an end-to-end process connection requirement when the average of the first similarity and the second similarity exceeds a set value;

[0080] The process stage splitting module is used to split the process stage when all the to-be-matched processes in the enterprise business process map database cannot match the process stage, so as to obtain multiple new process stages, and then match them with the to-be-matched processes in the enterprise business process map database.

[0081] In some optional implementations, the first similarity calculation module includes:

[0082] A matrix construction unit, used to construct a matrix D with N rows and M columns, where N is the length of the start condition B1 of the process to be matched plus one, and M is the length of the start condition A1 of the process stage plus one;

[0083] The matrix initial assignment unit is used to assign the first row of the matrix to 0, 1, 2...N, and the first column to 0, 1, 2...M;

[0084] The matrix secondary assignment unit is used to assign values ​​to other elements D[i,j] in the matrix D according to the formula:

[0085] D[i,j]=min(D[i-1,j]+1,D[i,j-1]+1,D[i-1,j-1]+temp);

[0086] Wherein, min is the minimum value function. When the i-1th character in the starting condition B1 is consistent with the j-1th character in the starting condition A1, temp = 0, otherwise temp = 1;

[0087] A condition distance calculation unit, used to calculate the distance Dis(A1-B1)=D[i+1,j+1] between the start condition A1 of the process stage and the start condition B1 of the process to be matched;

[0088] The first similarity calculation unit is used to calculate the first similarity sim1=1-Dis(A1-B1) / max(N-1,M-1) between the start condition A1 of the process stage and the start condition B1 of the process to be matched, where max is a maximum value function.

[0089] In some optional implementations, the set value is not less than 60%.

[0090] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. An end-to-end process connection method based on an enterprise business process map, characterized in that: include: Step S1, obtaining multiple process stages divided by the end-to-end process connection requirements, each process stage having a start condition A1 and an end condition A2; Step S2: for each process stage and each process to be matched in the enterprise business process map database, calculate the first similarity between the start condition A1 of the process stage and the start condition B1 of the process to be matched; Step S3: when the first similarity exceeds a set value, calculate a second similarity between the end condition A2 of the process stage and the end condition B2 of the process to be matched; Step S4: when the average of the first similarity and the second similarity exceeds a set value, determining that the process to be matched can be used to assemble an end-to-end process connection requirement; Step S5: When all the to-be-matched processes in the enterprise business process map database cannot match the process stage, the process stage is split to obtain multiple new process stages, which are then matched with the to-be-matched processes in the enterprise business process map database.

2. The end-to-end process connection method based on the enterprise business process map according to claim 1, characterized in that: Step S2 further comprises: Step S21, constructing a matrix D with N rows and M columns, where N is the length of the start condition B1 of the process to be matched plus one, and M is the length of the start condition A1 of the process stage plus one; Step S22, the first row of the matrix is ​​assigned a value of 0, 1, 2 ... N, and the first column is assigned a value of 0, 1, 2 ... M; Step S23: Assign values ​​to other elements D[i,j] in the matrix D according to the formula: D[i,j]=min(D[i-1,j]+1,D[i,j-1]+1,D[i-1,j-1]+temp); Wherein, min is the minimum value function. When the i-1th character in the starting condition B1 is consistent with the j-1th character in the starting condition A1, temp = 0, otherwise temp = 1; Step S24, calculate the distance Dis(A1-B1)=D[i+1,j+1] between the start condition A1 of the process stage and the start condition B1 of the process to be matched; Step S25, calculating the first similarity sim1=1-Dis(A1-B1) / max(N-1,M-1) between the start condition A1 of the process stage and the start condition B1 of the process to be matched, wherein max is a maximum value function.

3. The end-to-end process connection method based on the enterprise business process map according to claim 1, characterized in that: The set value is not less than 60%.

4. An end-to-end process connection device based on an enterprise business process map, characterized in that: include: The process stage acquisition module is used to acquire multiple process stages split by the end-to-end process penetration requirements, each of which has a start condition A1 and an end condition A2; A first similarity calculation module is used to calculate the first similarity between the start condition A1 of the process stage and the start condition B1 of the process to be matched for each process stage and each process to be matched in the enterprise business process map database; A second similarity calculation module, used for calculating a second similarity between the end condition A2 of the process stage and the end condition B2 of the process to be matched when the first similarity exceeds a set value; A process assembly module, configured to determine that the process to be matched can be used to assemble an end-to-end process connection requirement when the average of the first similarity and the second similarity exceeds a set value; The process stage splitting module is used to split the process stage when all the to-be-matched processes in the enterprise business process map database cannot match the process stage, so as to obtain multiple new process stages, and then match them with the to-be-matched processes in the enterprise business process map database.

5. The end-to-end process connection device based on the enterprise business process map according to claim 4, characterized in that: The first similarity calculation module includes: A matrix construction unit, used to construct a matrix D with N rows and M columns, where N is the length of the start condition B1 of the process to be matched plus one, and M is the length of the start condition A1 of the process stage plus one; The matrix initial assignment unit is used to assign the first row of the matrix to 0, 1, 2...N, and the first column to 0, 1, 2...M; The matrix secondary assignment unit is used to assign values ​​to other elements D[i,j] in the matrix D according to the formula: D[i,j]=min(D[i-1,j]+1,D[i,j-1]+1,D[i-1,j-1]+temp); Wherein, min is the minimum value function. When the i-1th character in the starting condition B1 is consistent with the j-1th character in the starting condition A1, temp = 0, otherwise temp = 1; A condition distance calculation unit, used to calculate the distance Dis(A1-B1)=D[i+1,j+1] between the start condition A1 of the process stage and the start condition B1 of the process to be matched; The first similarity calculation unit is used to calculate the first similarity sim1=1-Dis(A1-B1) / max(N-1,M-1) between the start condition A1 of the process stage and the start condition B1 of the process to be matched, where max is a maximum value function.

6. The end-to-end process connection device based on the enterprise business process map according to claim 4, characterized in that: The set value is not less than 60%.

Citation Information

Cited By

  • Yacht industry full life cycle management system and method based on intelligent platform

    CN120106234A

  • Yacht industry full life cycle management system and method based on smart platform

    CN120106234B