CN112036751A - Method and device for identifying process key operation nodes - Google Patents

Method and device for identifying process key operation nodes Download PDF

Info

Publication number
CN112036751A
CN112036751A CN202010903983.5A CN202010903983A CN112036751A CN 112036751 A CN112036751 A CN 112036751A CN 202010903983 A CN202010903983 A CN 202010903983A CN 112036751 A CN112036751 A CN 112036751A
Authority
CN
China
Prior art keywords
key
nodes
node
identifying
job
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010903983.5A
Other languages
Chinese (zh)
Other versions
CN112036751B (en
Inventor
董佳烨
孙百仪
杨似彤
张鹏
陈亚坤
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bank of China Ltd
Original Assignee
Bank of China Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bank of China Ltd filed Critical Bank of China Ltd
Priority to CN202010903983.5A priority Critical patent/CN112036751B/en
Publication of CN112036751A publication Critical patent/CN112036751A/en
Application granted granted Critical
Publication of CN112036751B publication Critical patent/CN112036751B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0633—Workflow analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/02—Banking, e.g. interest calculation or account maintenance
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Accounting & Taxation (AREA)
  • Educational Administration (AREA)
  • Technology Law (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application provides a method and a device for identifying a flow key operation node, comprising the following steps: acquiring a key path in a work flow from collected historical operation data of the work; identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table; and sequentially outputting the screened key operation nodes according to the number of the key operation nodes preset by the user. The method and the device can monitor the operation time of the operation in real time, can identify the key operation nodes influencing the operation flow operation time while acquiring the corresponding operation time, and reduce the error probability compared with manual operation.

Description

Method and device for identifying process key operation nodes
Technical Field
The present application belongs to the technical field of system operation and maintenance, and in particular, to a method and an apparatus for identifying a process key operation node.
Background
With the increasingly powerful business functions of financial systems, especially bank core systems, the number of jobs is increasing, and the work flow is also becoming more and more complex. Therefore, how to complete the complex workflow within the limited core batch processing time window becomes a big challenge for the financial system.
Meanwhile, since frequently and largely changing the operation flow is a high-risk operation, it is the key point of the system operation and maintenance work to realize the maximum optimization of the operation flow by fine-tuning the operation route, and the bottleneck of the key path in the optimized operation flow is to identify the key node in the key path.
Disclosure of Invention
The application provides a method and a device for identifying a flow key operation node, which are used for at least solving the problem of risk caused by frequent and large change of operation flows in a bank system at present.
According to one aspect of the application, a method for identifying a flow key operation node is provided, which includes:
acquiring a key path in a work flow from collected historical operation data of the work;
identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table;
and sequentially outputting the screened key operation nodes according to the number of the key operation nodes preset by the user.
In an embodiment, the method for identifying a flow key job node further includes:
and predicting the recent operation time trend of the operation according to the collected operation historical operation data and the latest operation data.
In one embodiment, identifying and screening the key job node from all nodes of the key path according to a pre-generated business relation table includes:
all nodes in the key path are arranged in descending order according to the recent operation time trend of the operation;
judging whether the operation nodes have a service relation with the previous operation nodes in descending order according to a pre-generated service relation table;
if no business relation exists, the operation node is marked as a key operation node.
In one embodiment, the step of generating the business relationship table includes:
extracting service process information according to the function of each operation in the daily operation process;
and summarizing and arranging the extracted business process information into a business relation table.
According to another aspect of the present application, there is also provided an apparatus for identifying a flow key job node, including:
the key path acquisition unit is used for acquiring a key path in the operation flow from the collected operation historical operation data;
the key operation node identification unit is used for identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table;
and the key operation node output unit is used for sequentially outputting the screened key operation nodes according to the number of key operation nodes preset by the user.
In one embodiment, the apparatus for identifying a flow-critical operation node further includes:
and the operation time trend prediction unit is used for predicting the recent operation time trend of the operation according to the collected operation historical operation data and the latest operation data.
In one embodiment, the key job node identification unit includes:
the node arrangement module is used for carrying out descending order arrangement on all nodes in the key path according to the recent operation time trend of the operation;
the inquiry screening module is used for judging whether the operation nodes have a service relation with the previous operation nodes in descending order arrangement according to a pre-generated service relation table;
and the marking module is used for marking the operation node as a key operation node if no operation relation exists.
In one embodiment, the step of generating the business relationship table includes:
extracting service process information according to the function of each operation in the daily operation process;
and summarizing and arranging the extracted business process information into a business relation table.
At present, identification of key nodes in the operation process mainly depends on technical personnel to carry out manual judgment, and the path is optimized after identification to adjust the operation process, but the mode is low in operation efficiency, high in cost and easy to make mistakes.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of an identification method for a process key operation node according to the present application.
Fig. 2 is a flowchart of a method for identifying and screening key job nodes in the embodiment of the present application.
Fig. 3 is a step of generating a business relation table in this embodiment of the application.
Fig. 4 is a block diagram of a structure of an apparatus for identifying a flow key job node according to the present application.
Fig. 5 is a block diagram of a structure of a key job node identification unit in the embodiment of the present application.
Fig. 6 is a specific implementation of an electronic device in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Based on the requirements in the background art and various defects existing in the current manual judgment of key operation nodes, the application provides a key operation node judgment method to replace manual operation, and as shown in fig. 1, the method for identifying the flow key operation nodes comprises the following steps:
s101: and acquiring a critical path in the operation flow from the collected operation historical operation data.
Operation historical operation data is collected, various operation flows can be extracted from the operation historical operation data, and key paths of the operation flows are obtained from the operation flows.
S102: and identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table.
In an embodiment, the method for identifying a flow key job node further includes:
and predicting the recent operation time trend of the operation according to the collected operation historical operation data and the latest operation data.
In one embodiment, the recent running time trend of the job can be calculated by collecting the latest job running data and combining the historical running data of the job. And extracting the business relation table from the operation historical operation data, and judging whether all nodes in the key path are key operation nodes or not according to the business relation among the nodes recorded on the business relation table.
S103: and sequentially outputting the screened key operation nodes according to the number of the key operation nodes preset by the user.
And outputting all the key operation nodes according to the number of the key operation nodes configured by the user.
In an embodiment, the identifying and screening the key job node from all nodes of the key path according to the pre-generated service relationship table, as shown in fig. 2, includes:
s201: and all nodes in the critical path are arranged in descending order according to the recent running time trend of the operation.
In one embodiment, assume that n job nodes in the acquired critical path are: j. the design is a square1→J2→…→Jn. Acquiring the running time of the job according to the recent running time trend of the job, and arranging the running time of the job in descending order according to the time { J(1),J(2),…,J(n)At run time J, where(1)≥J(2)≥…≥J(n)。
S202: and judging whether the operation nodes have a service relationship with the previous operation nodes in descending order according to a pre-generated service relationship table.
S203: if no business relation exists, the operation node is marked as a key operation node.
In one embodiment, operation J is determined(1)Whether the preceding job in the critical path is the sum job J(1)There is a business relationship; if not, the operation is the key operation node; if there is a business relation, sequentially judging operation J(2)And until all the jobs are judged to be finished or the number of the key job nodes reaches the user configuration. For example, the business relationship of the job is:
operation 1- > operation 2, operation 1- > operation 3, operation 3- > operation 4, operation 2- > operation 5, operation 4- > operation 5, operation 5- > operation 6, operation 6- > operation 7, and operation 7- > operation 8.
The arrangement is as follows according to the descending order of the operation running time: work 4, work 2, work 6, work 7, work 5, work 3, work 1, and work 8.
Then judging whether the operation node is a key operation node:
operation 4: the critical path relay job is job 3, and job 3 has a business relationship with job 4, which is not a critical job node;
operation 2: the key path relay operation is operation 1, and operation 1 and operation 2 have a business relationship, and the operation is not a key operation node;
operation 6: the critical path relay job is job 5, and job 5 has a business relationship with job 6, which is not a critical job node;
operation 7: the critical path relay job is job 6, and job 6 has a business relationship with job 7, which is not a critical job node;
operation 5: the critical path relay job is job 4, and job 4 has no business relationship with job 5, which is the critical job node.
In an embodiment, as shown in fig. 3, the generating step of the business relation table includes:
s301: and extracting the business process information according to the function of each operation in the daily operation process.
S302: and summarizing and arranging the extracted business process information into a business relation table.
The business relationship is a strict contextual relationship when two jobs process data or complete corresponding business functions.
In a specific embodiment, job 1 functions to load bank account interest rate, job 2 functions to calculate bank account interest, and job 3 functions to issue bank interest statement, then three jobs will have strict business context, job 1 must be executed before job 2, and job 2 must be executed before job 3; for example, the job 4 function is to charge the card annual fee, the job 5 function is to charge the account maintenance fee, and who has not much requirement first and then, and this example is a job without business relationship.
The business relationships are maintained in a table, which stores the patterns:
serial number Forwarding business operations Subsequent business operation
1 Operation 1 Operation 2
2 Operation 2 Operation 3
In this way, the complex operation business relation table of the core bank system can be established.
Based on the same inventive concept, the embodiment of the present application further provides an apparatus for identifying a flow key operation node, which can be used to implement the method described in the above embodiment, as described in the following embodiment. Because the principle of solving the problems of the identification device of the process key operation node is similar to the identification method of the process key operation node, the implementation of the identification device of the process key operation node can refer to the implementation of the identification method of the process key operation node, and repeated details are not repeated. As used hereinafter, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. While the system described in the embodiments below is preferably implemented in software, implementations in hardware, or a combination of software and hardware are also possible and contemplated.
As shown in fig. 4, the present application further provides an apparatus for identifying a flow key operation node, including:
a critical path obtaining unit 401, configured to obtain a critical path in a job flow from the collected job history operation data;
a key operation node identification unit 402, configured to identify and screen key operation nodes from all nodes of the key path according to a pre-generated service relationship table;
and a key job node output unit 403, configured to sequentially output the screened key job nodes according to the number of key job nodes configured in advance by the user.
In one embodiment, the apparatus for identifying a flow-critical operation node further includes:
and the operation time trend prediction unit is used for predicting the recent operation time trend of the operation according to the collected operation historical operation data and the latest operation data.
In one embodiment, as shown in fig. 5, the key job node identification unit 402 includes:
the node arrangement module 501 is configured to perform descending order arrangement on all nodes in the critical path according to the recent operation time trend of the job;
the query screening module 502 is configured to determine whether a service relationship exists between the operation node and a previous operation node in the descending order arrangement according to a pre-generated service relationship table;
and a marking module 503, configured to mark the job node as a key job node if there is no job relation.
In one embodiment, the step of generating the business relationship table includes:
extracting service process information according to the function of each operation in the daily operation process;
and summarizing and arranging the extracted business process information into a business relation table.
Compared with the existing mode of manually judging key operation nodes, the method at least has the following advantages:
1. the automation degree is high.
The identification process is automatically completed by a program without manual intervention, so that the manpower resource is saved.
2. The flexibility and the reusability are strong.
The flexible configuration of the user is supported, and the system can be used in different environments and different platforms by one key.
3. The risk is controllable.
And supporting a user to configure the number of key nodes and controlling the risk within an acceptable range.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principle and the implementation mode of the invention are explained by applying specific embodiments in the invention, and the description of the embodiments is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
An embodiment of the present application further provides a specific implementation manner of an electronic device, which is capable of implementing all steps in the method in the foregoing embodiment, and referring to fig. 6, the electronic device specifically includes the following contents:
a processor (processor)601, a memory 602, a communication Interface 603, a bus 604, and a non-volatile memory 605;
the processor 601, the memory 602, and the communication interface 603 complete mutual communication through the bus 604;
the processor 601 is configured to call the computer programs in the memory 602 and the nonvolatile memory 605, and when the processor executes the computer programs, the processor implements all the steps in the method in the foregoing embodiments, for example, when the processor executes the computer programs, the processor implements the following steps:
s101: and acquiring a critical path in the operation flow from the collected operation historical operation data.
S102: and identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table.
S103: and sequentially outputting the screened key operation nodes according to the number of the key operation nodes preset by the user.
Embodiments of the present application also provide a computer-readable storage medium capable of implementing all the steps of the method in the above embodiments, where the computer-readable storage medium stores thereon a computer program, and the computer program when executed by a processor implements all the steps of the method in the above embodiments, for example, the processor implements the following steps when executing the computer program:
s101: and acquiring a critical path in the operation flow from the collected operation historical operation data.
S102: and identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table.
S103: and sequentially outputting the screened key operation nodes according to the number of the key operation nodes preset by the user.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the hardware + program class embodiment, since it is substantially similar to the method embodiment, the description is simple, and the relevant points can be referred to the partial description of the method embodiment. Although embodiments of the present description provide method steps as described in embodiments or flowcharts, more or fewer steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or end product executes, it may execute sequentially or in parallel (e.g., parallel processors or multi-threaded environments, or even distributed data processing environments) according to the method shown in the embodiment or the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded. For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, in implementing the embodiments of the present description, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of multiple sub-modules or sub-units, and the like. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein. The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of an embodiment of the specification.
In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction. The above description is only an example of the embodiments of the present disclosure, and is not intended to limit the embodiments of the present disclosure. Various modifications and variations to the embodiments described herein will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present specification should be included in the scope of the claims of the embodiments of the present specification.

Claims (10)

1. A method for identifying a flow key operation node is characterized by comprising the following steps:
acquiring a key path in a work flow from collected historical operation data of the work;
identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table;
and sequentially outputting the screened key operation nodes according to the number of key operation nodes preset by the user.
2. The method for identifying a process-critical operation node as claimed in claim 1, further comprising:
and predicting the recent operation time trend of the operation according to the collected operation historical operation data and the latest operation data.
3. The method for identifying nodes of process key jobs according to claim 2, wherein the identifying and screening key job nodes from all nodes of the key path according to a pre-generated business relationship table comprises:
all nodes in the key path are arranged in a descending order according to the recent operation time trend of the operation;
judging whether the operation nodes have a service relation with the previous operation nodes in descending order according to a pre-generated service relation table;
if no business relation exists, the operation node is marked as a key operation node.
4. The method for identifying a process key job node as claimed in claim 1, wherein the step of generating the business relationship table comprises:
extracting service process information according to the function of each operation in the daily operation process;
and summarizing and sorting the extracted business process information into the business relation table.
5. An apparatus for identifying a process-critical operation node, comprising:
the key path acquisition unit is used for acquiring a key path in the operation flow from the collected operation historical operation data;
the key operation node identification unit is used for identifying and screening key operation nodes from all nodes of the key path according to a pre-generated service relation table;
and the key operation node output unit is used for sequentially outputting the screened key operation nodes according to the number of key operation nodes preset by the user.
6. The apparatus for identifying a process-critical operation node as claimed in claim 5, further comprising:
and the operation time trend prediction unit is used for predicting the recent operation time trend of the operation according to the collected operation historical operation data and the latest operation data.
7. The apparatus for identifying a process key job node according to claim 6, wherein the key job node identifying unit includes:
the node arrangement module is used for arranging all the nodes in the key path in a descending order according to the recent operation time trend of the operation;
the inquiry screening module is used for judging whether the operation nodes have a service relation with the previous operation nodes in descending order arrangement according to a pre-generated service relation table;
and the marking module is used for marking the operation node as a key operation node if no operation relation exists.
8. The apparatus for identifying a process-critical operation node according to claim 5, wherein the step of generating the business relationship table includes:
extracting service process information according to the function of each operation in the daily operation process;
and summarizing and sorting the extracted business process information into the business relation table.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method for identifying a process-critical operation node according to any one of claims 1 to 4 when executing the program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out a method for identifying a process-critical operation node according to any one of claims 1 to 4.
CN202010903983.5A 2020-09-01 2020-09-01 Method and device for identifying key operation nodes of process Active CN112036751B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010903983.5A CN112036751B (en) 2020-09-01 2020-09-01 Method and device for identifying key operation nodes of process

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010903983.5A CN112036751B (en) 2020-09-01 2020-09-01 Method and device for identifying key operation nodes of process

Publications (2)

Publication Number Publication Date
CN112036751A true CN112036751A (en) 2020-12-04
CN112036751B CN112036751B (en) 2023-08-22

Family

ID=73590684

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010903983.5A Active CN112036751B (en) 2020-09-01 2020-09-01 Method and device for identifying key operation nodes of process

Country Status (1)

Country Link
CN (1) CN112036751B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109840248A (en) * 2019-01-25 2019-06-04 中国银行股份有限公司 A kind of work flow optimization method, device and storage medium
CN111310998A (en) * 2020-02-13 2020-06-19 中国工商银行股份有限公司 Method and device for generating critical path, electronic equipment and medium
CN111598382A (en) * 2020-04-01 2020-08-28 深圳壹账通智能科技有限公司 Service chain data checking method and device based on block chain, storage medium and electronic equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109840248A (en) * 2019-01-25 2019-06-04 中国银行股份有限公司 A kind of work flow optimization method, device and storage medium
CN111310998A (en) * 2020-02-13 2020-06-19 中国工商银行股份有限公司 Method and device for generating critical path, electronic equipment and medium
CN111598382A (en) * 2020-04-01 2020-08-28 深圳壹账通智能科技有限公司 Service chain data checking method and device based on block chain, storage medium and electronic equipment

Also Published As

Publication number Publication date
CN112036751B (en) 2023-08-22

Similar Documents

Publication Publication Date Title
US9864634B2 (en) Enhancing initial resource allocation management to provide robust reconfiguration
CN109615138B (en) Operation flow optimizing method and device
CN114153580A (en) Cross-multi-cluster work scheduling method and device
CN103473076A (en) Issuing method and issuing system for code version
CN110493806A (en) Mobile network complains source tracing method and device
CN104504495A (en) Operation and maintenance abnormity processing method, device and equipment
CN114911615B (en) Intelligent prediction scheduling method and application during micro-service running
CN115860451A (en) Flow operation method and device, electronic equipment and storage medium
US20100077382A1 (en) Computer-readable recording medium string a bug detection support program, similar structure identification information list output program, bug detection support apparatus, and bug detection support method
CN113205299B (en) Method, device and storage medium for generating order picking task list
CN114186697A (en) Method and device for generating and applying deep learning model based on deep learning framework
CN104967532A (en) TOC technology operation and maintenance system and application method
CN109829639A (en) Service item monitoring method and device
CN101777994B (en) Configuration method and system of telecommunication equipment
CN108595178A (en) A kind of collecting method, device and equipment based on hook
CN105446812A (en) Multitask scheduling configuration method
CN111078560B (en) Test method and device based on flow pruning, electronic equipment and storage medium
KR102081975B1 (en) Apparatus and Method for Managing Mechanical completion state
CN112036751A (en) Method and device for identifying process key operation nodes
CN111193631B (en) Information processing method, system, and computer-readable storage medium
JP2015079445A (en) Project management device, project management method, and project management program
US9489288B1 (en) System, method, and computer program for automating activities associated with a testing project
CN113986495A (en) Task execution method, device, equipment and storage medium
Molka et al. Dotted Chart and Control-Flow Analysis for a Loan Application Process.
JP2011044030A (en) System and method for supporting work, and program

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant