阅读说明：本技术 一种业务流程的调度方法及系统 (Scheduling method and system of business process ) 是由 孔令达 赵兵 许海清 赵英杰 陈昊 徐萌 梁晓兵 冯云 李智虎 曹永峰 李保丰 于 2021-08-09 设计创作，主要内容包括：本发明公开了一种业务流程的调度方法及系统,包括：将业务流程构造为“节点+网络”形式的第一网络模型,并基于面向对象方法确定每个节点的节点信息；根据业务流程和节点信息连接所述第一网络模型中的节点,以确定第二网络模型,并基于所述第二网络模型确定节点网络矩阵和边矩阵；基于所述节点网络矩阵和边矩阵进行待办业务的业务流程的调度。本发明通过将传统的业务流程线性化思维转变为网络化思维,能够实现原子化的节点添加、业务数据流向配置,更具灵活性。(The invention discloses a method and a system for scheduling a business process, wherein the method comprises the following steps: constructing a business process into a first network model in a node + network form, and determining node information of each node based on an object-oriented method; connecting nodes in the first network model according to the service process and the node information to determine a second network model, and determining a node network matrix and an edge matrix based on the second network model; and scheduling the service flow of the service to be handled based on the node network matrix and the edge matrix. The invention can realize the addition of the atomized nodes and the flow direction configuration of the service data by converting the traditional service flow linearization thinking into the networking thinking, and has more flexibility.)

1. A method for scheduling a business process, the method comprising:

constructing a business process into a first network model in a node + network form, and determining node information of each node based on an object-oriented method;

connecting nodes in the first network model according to the service process and the node information to determine a second network model, and determining a node network matrix and an edge matrix based on the second network model;

and scheduling the service flow of the service to be handled based on the node network matrix and the edge matrix.

2. The method of claim 1, wherein the node information comprises: attribute information, service information, and event information.

3. The method of claim 1, wherein the network matrix of nodes is M_n×n(ii) a Wherein n is the total number of nodes involved in the service process; if the element M in the matrix_p,qIf 1, the p node points to the q node, and a direct service data association exists between p and q; if the element M in the matrix_p,qAnd if the value is 0, the p node is not associated with the q node, and no direct business data association exists between the p node and the q node.

4. The method of claim 3, wherein the edge matrix is E_s×t(ii) a Wherein s is the number of edges in the second network model, and t is the number of attributes of the edges; the attributes of the edge include: the starting node number Source of the edge, the Target node number Target of the edge, the Weight of the edge and the number ID of the edge.

5. The method according to claim 4, wherein the scheduling of the service flow of the pending service based on the node network matrix and the edge matrix comprises:

step 1, determining a service starting node of a service flow according to the service to be handled;

step 2, according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed;

and step 3, performing quantity convergence on the searched target nodes which are allowed to jump, and finishing the scheduling of the business process of the business to be handled according to a convergence result.

6. The method according to claim 5, wherein the converging the number of the searched target nodes allowing the jump, and completing the scheduling of the business process of the to-do business according to the converged result comprises:

step 31, inquiring the event information of each target node allowing jumping, removing the nodes of which the event state is a first preset state, and finishing the first convergence;

step 32, when the unique remaining target node allowing the jump is determined according to the convergence result, determining the unique remaining target node allowing the jump as the starting node of the next link, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed;

step 33, when the remaining jump-allowed target nodes are determined to be not unique according to the convergence result, performing second convergence, sequencing the remaining jump-allowed target nodes according to the weight, determining a starting node of a next link according to the sequencing result, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed;

wherein if the node network matrix M is obtained according to the node_n×nAnd if the target node allowing the jump does not exist, directly ending the business process.

7. The method of claim 6, wherein determining the starting node of the next link according to the sorting result comprises:

when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link;

and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

8. A system for scheduling a business process, the system comprising:

the network model construction unit is used for constructing the business process into a first network model in a node + network form and determining node information of each node based on an object-oriented system;

the matrix determining unit is used for connecting nodes in the first network model according to the service process and the node information to determine a second network model, and determining a node network matrix and an edge matrix based on the second network model;

and the service flow scheduling unit is used for scheduling the service flow of the service to be handled based on the node network matrix and the edge matrix.

9. The system of claim 8, wherein the node information comprises: attribute information, service information, and event information.

10. The system of claim 8, wherein the network matrix of nodes is M_n×n(ii) a Wherein n is the total number of nodes involved in the service process; if the element M in the matrix_p,qIf 1, the p node points to the q node, and a direct service data association exists between p and q; if the element M in the matrix_p,qAnd if the value is 0, the p node is not associated with the q node, and no direct business data association exists between the p node and the q node.

11. The system of claim 10, wherein the edge matrix is E_s×t(ii) a Wherein s is the number of edges in the second network model, and t is the number of attributes of the edges; the attributes of the edge include: the starting node number Source of the edge, the Target node number Target of the edge, the Weight of the edge and the number ID of the edge.

12. The system according to claim 11, wherein the service process scheduling unit performs scheduling of a service process of a service to be handled based on the node network matrix and the edge matrix, and includes:

a service starting node obtaining module, configured to determine a service starting node of a service flow according to the service to be handled;

a target node searching and determining module for searching and determining the target node according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed;

and the quantity convergence module is used for carrying out quantity convergence on the searched target nodes which are allowed to jump and finishing the scheduling of the business process of the business to be handled according to a convergence result.

13. The system according to claim 12, wherein the quantity convergence module performs quantity convergence on the searched jump-allowed target nodes, and completes the scheduling of the service flow of the pending service according to a convergence result, including:

the first convergence submodule is used for inquiring the event information of each target node allowing the jump, removing the nodes of which the event state is a first preset state and finishing the first convergence; (ii) a

The updating submodule is used for determining that the only residual target node allowing the jump is the starting node of the next link when the only residual target node allowing the jump is determined according to the convergence result, and entering the first convergence submodule for recalculation until the scheduling of the service flow of the service to be handled is completed;

the second convergence submodule is used for carrying out second convergence when the remaining target nodes which are allowed to jump are determined to be not unique according to the convergence result, sequencing the remaining target nodes which are allowed to jump according to the weight, determining the starting node of the next link according to the sequencing result, and entering the first convergence submodule for recalculation until the scheduling of the service flow of the service to be handled is completed;

wherein if the node network matrix M is obtained according to the node_n×nAnd if the target node allowing the jump does not exist, directly ending the business process.

14. The system of claim 13, wherein the second convergence submodule, for determining the starting node of the next link according to the sorting result, comprises:

when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link;

and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

Technical Field

The present invention relates to the technical field of business process processing, and more particularly, to a method and a system for scheduling a business process.

Background

The boundary between the digital world and the physical world is gradually ablated, and the service flow and the workflow gradually develop to a human-in-loop mode. How to deal with the relationship between human and machine in the 'human-in-loop' system is a problem which needs urgent attention to perfect usability, friendliness and safety.

The prior experience shows that: in the system development and maintenance stage, no matter the demand side or the construction side, it is often difficult to comb and cover the business process comprehensively, the software crisis of repeated supplement and modification often occurs, and the design of the business process lacks flexibility and expandability, so that huge manpower and financial cost are wasted.

The existing information system development mode has the defects of unclear demand expression and low efficiency. In this way of thinking, the process is solidified in the system, and the business cannot conveniently and rapidly change the business process along with the change of business environment, and the change of the business environment causes the business to have to rapidly adjust the business to respond. Real-time enterprises will swiftly use the latest information to actively eliminate the inefficient delays that arise at the management and execution level in their critical business processes.

The object-oriented idea is to construct a software system from objects (i.e., objects) that are present in the real world in an object-oriented manner, to use the natural human thinking manner as much as possible in the system construction, to emphasize problems that are thought directly centering on objects in a problem domain (the real world), to recognize the problems, and to express these objects as objects in the system in an abstract manner as basic constituent units of the system based on the essential characteristics of these objects. This allows the system to map the problem domain directly, preserving the natural look of the things and their interrelationships in the problem domain.

Therefore, the world should be understood in terms of its natural appearance, the real world being reflected directly by the objects and their interrelationships. The system built up in this way can meet the original aspect of the real world.

In the face of the human-machine system of the human-in-the-loop, a set of effective theoretical model and implementation means are urgently needed. And a strict logic model is utilized to form a man-machine system flow scheduling method which is easy to design, adjust, maintain and upgrade.

Disclosure of Invention

The invention provides a method and a system for scheduling a business process, which aim to solve the problem of how to efficiently schedule the business process.

In order to solve the above problem, according to an aspect of the present invention, there is provided a method for scheduling a business process, the method including:

constructing a business process into a first network model in a node + network form, and determining node information of each node based on an object-oriented method;

connecting nodes in the first network model according to the service process and the node information to determine a second network model, and determining a node network matrix and an edge matrix based on the second network model;

and scheduling the service flow of the service to be handled based on the node network matrix and the edge matrix.

Preferably, the node information includes: attribute information, service information, and event information.

Preferably, wherein the node network matrix is M_n×n(ii) a Wherein n is the total number of nodes involved in the service process; if the element M in the matrix_p,q1 means that the p node points to the q node, between p and qDirect business data association exists; if the element M in the matrix_p,qAnd if the value is 0, the p node is not associated with the q node, and no direct business data association exists between the p node and the q node.

Preferably, wherein the edge matrix is E_s×t(ii) a Wherein s is the number of edges in the second network model, and t is the number of attributes of the edges; the attributes of the edge include: the starting node number Source of the edge, the Target node number Target of the edge, the Weight of the edge and the number ID of the edge.

Preferably, the scheduling of the service flow of the to-be-handled service based on the node network matrix and the edge matrix includes:

step 1, determining a service starting node of a service flow according to the service to be handled;

step 2, according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed;

and step 3, performing quantity convergence on the searched target nodes which are allowed to jump, and finishing the scheduling of the business process of the business to be handled according to a convergence result.

Preferably, the converging the number of the searched target nodes allowing the jump, and completing the scheduling of the service flow of the to-be-handled service according to a convergence result includes:

step 31, inquiring the event information of each target node allowing jumping, removing the nodes of which the event state is a first preset state, and finishing the first convergence;

step 32, when the unique remaining target node allowing the jump is determined according to the convergence result, determining the unique remaining target node allowing the jump as the starting node of the next link, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed;

step 33, when the remaining jump-allowed target nodes are determined to be not unique according to the convergence result, performing second convergence, sequencing the remaining jump-allowed target nodes according to the weight, determining a starting node of a next link according to the sequencing result, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed;

wherein if the node network matrix M is obtained according to the node_n×nAnd if the target node allowing the jump does not exist, directly ending the business process.

Preferably, the determining a starting node of a next link according to the sorting result includes:

when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link;

and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

According to another aspect of the present invention, there is provided a scheduling system of a business process, the system including:

the network model construction unit is used for constructing the business process into a first network model in a node + network form and determining node information of each node based on an object-oriented system;

the matrix determining unit is used for connecting nodes in the first network model according to the service process and the node information to determine a second network model, and determining a node network matrix and an edge matrix based on the second network model;

and the service flow scheduling unit is used for scheduling the service flow of the service to be handled based on the node network matrix and the edge matrix.

Preferably, the node information includes: attribute information, service information, and event information.

Preferably, wherein the node network matrix is M_n×n(ii) a Wherein n is the total number of nodes involved in the service process; if the element M in the matrix_p,qIf 1, the p node points to the q node, and a direct service data association exists between p and q; if the element M in the matrix_p,q＝0，It means that the p node has no association relation with the q node, and there is no direct business data association between p and q.

Preferably, wherein the edge matrix is E_s×t(ii) a Wherein s is the number of edges in the second network model, and t is the number of attributes of the edges; the attributes of the edge include: the starting node number Source of the edge, the Target node number Target of the edge, the Weight of the edge and the number ID of the edge.

Preferably, the service process scheduling unit performs scheduling of the service process of the service to be handled based on the node network matrix and the edge matrix, and includes:

a service starting node obtaining module, configured to determine a service starting node of a service flow according to the service to be handled;

a target node searching and determining module for searching and determining the target node according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed;

and the quantity convergence module is used for carrying out quantity convergence on the searched target nodes which are allowed to jump and finishing the scheduling of the business process of the business to be handled according to a convergence result.

Preferably, the quantity convergence module performs quantity convergence on the searched target node allowing the jump, and completes the scheduling of the service flow of the to-be-handled service according to a convergence result, including:

the first convergence submodule is used for inquiring the event information of each target node allowing the jump, removing the nodes of which the event state is a first preset state and finishing the first convergence; (ii) a

The updating submodule is used for determining that the only residual target node allowing the jump is the starting node of the next link when the only residual target node allowing the jump is determined according to the convergence result, and entering the first convergence submodule for recalculation until the scheduling of the service flow of the service to be handled is completed;

the second convergence submodule is used for carrying out second convergence when the remaining target nodes which are allowed to jump are determined to be not unique according to the convergence result, sequencing the remaining target nodes which are allowed to jump according to the weight, determining the starting node of the next link according to the sequencing result, and entering the first convergence submodule for recalculation until the scheduling of the service flow of the service to be handled is completed;

wherein if the node network matrix M is obtained according to the node_n×nAnd if the target node allowing the jump does not exist, directly ending the business process.

Preferably, the determining, by the second convergence submodule, the starting node of the next link according to the sorting result includes:

when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link;

and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

The invention provides a service flow scheduling method and a system, wherein a service flow is constructed in a form of a complex network model of 'node + network', node information of nodes is defined based on an object-oriented method, a network model is used for connecting nodes in the service flow, a node network matrix and an edge matrix are determined, and the flow of the service flow is restrained by using the edge matrix.

Drawings

A more complete understanding of exemplary embodiments of the present invention may be had by reference to the following drawings in which:

FIG. 1 is a flow chart of a method 100 for scheduling a business process according to an embodiment of the present invention;

FIG. 2 is a flow diagram of network model based scheduling according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of a scheduling system 300 for business processes according to an embodiment of the present invention.

Detailed Description

The exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, however, the present invention may be embodied in many different forms and is not limited to the embodiments described herein, which are provided for complete and complete disclosure of the present invention and to fully convey the scope of the present invention to those skilled in the art. The terminology used in the exemplary embodiments illustrated in the accompanying drawings is not intended to be limiting of the invention. In the drawings, the same units/elements are denoted by the same reference numerals.

Unless otherwise defined, terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Further, it will be understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense.

Fig. 1 is a flowchart of a scheduling method 100 for a business process according to an embodiment of the present invention. As shown in FIG. 1, the invention constructs the service flow as a complex network model of 'node + network', defines node information of the node based on an object-oriented method, uses the network model to connect the nodes in the service flow, determines a node network matrix and an edge matrix, and uses the edge matrix to constrain the flow of the service flow. The method 100 for scheduling a service flow provided by the embodiment of the present invention includes:

step 101, constructing a business process into a first network model in a node + network form, and determining node information of each node based on an object-oriented method.

Preferably, the node information includes: attribute information, service information, and event information.

In the invention, a business process is constructed into a complex network model in a node + network form, and the attribute, method and event information of the node are defined based on an object-oriented method. Defining the attribute, service and event of the node based on an object-oriented method, comprising the following steps: the functions of the nodes are described as object-oriented digital structures, and the specific classification method comprises the following steps: "attribute + service + event". Further, the functional type of the node is described using the JSON data exchange format.

And 102, connecting nodes in the first network model according to the service process and the node information to determine a second network model, and determining a node network matrix and an edge matrix based on the second network model.

Preferably, wherein the node network matrix is M_n×n(ii) a Wherein n is the total number of nodes involved in the service process; if the element M in the matrix_p,qIf 1, the p node points to the q node, and a direct service data association exists between p and q; if the element M in the matrix_p,qAnd if the value is 0, the p node is not associated with the q node, and no direct business data association exists between the p node and the q node.

Preferably, wherein the edge matrix is E_s×t(ii) a Wherein s is the number of edges in the second network model, and t is the number of attributes of the edges; the attributes of the edge include: the starting node number Source of the edge, the Target node number Target of the edge, the Weight of the edge and the number ID of the edge.

In the invention, the nodes in the business process are connected by using a network model, comprising the following steps: constructing a network matrix M_n×nN in the matrix is a flow point related in the service flow; initializing M to the matrix_n×n0; if the element M in the matrix_p,q1, the p node points to the q node; if the element M in the matrix_p,qAnd 0, the p node is not associated with the q node, that is, no direct traffic data association exists between p and q.

In the invention, the flow of the business process is restricted by using the edge matrix, which comprises the following steps: constructing the edge matrix E_s×tAnd s in the matrix is the number of 'edges' in the complex network, and the matrix has t as 4 columns, namely a starting node number Source of the edge, a Target node number Target of the edge, a Weight of the edge and an ID number of the edge.

And 103, scheduling the service flow of the to-be-handled service based on the node network matrix and the edge matrix.

Preferably, the scheduling of the service flow of the to-be-handled service based on the node network matrix and the edge matrix includes:

step 1, determining a service starting node of a service flow according to the service to be handled;

step 2, according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed;

and step 3, performing quantity convergence on the searched target nodes which are allowed to jump, and finishing the scheduling of the business process of the business to be handled according to a convergence result.

Preferably, the converging the number of the searched target nodes allowing the jump, and completing the scheduling of the service flow of the to-be-handled service according to a convergence result includes:

step 31, inquiring the event information of each target node allowing jumping, removing the nodes of which the event state is a first preset state, and finishing the first convergence;

step 32, when the unique remaining target node allowing the jump is determined according to the convergence result, determining the unique remaining target node allowing the jump as the starting node of the next link, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed;

step 33, when the remaining jump-allowed target nodes are determined to be not unique according to the convergence result, performing second convergence, sequencing the remaining jump-allowed target nodes according to the weight, determining a starting node of a next link according to the sequencing result, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed;

wherein if the node network matrix M is obtained according to the node_n×nDetermining that there is no target node allowing jumping, thenAnd directly ending the business process.

Preferably, the determining a starting node of a next link according to the sorting result includes:

when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link;

and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

Referring to fig. 2, in the present invention, when the office automation system uses "a scheduling method of a service flow", a service flow may be initiated from any flow point, a network matrix of nodes is used to constrain a service flow direction, and an edge matrix is used to recommend a next ring node for the service flow.

When the business process starts to flow from a certain node, the system uses the node network matrix to restrict the flow direction of the business process, and uses the edge matrix to recommend the next link node for the business process, and the method comprises the following steps: (1) first using a complex network matrix M_n×nJudging the connection relation between the nodes, if M is_p,qIf the number is 1, the service flow is allowed to proceed to the next step; if M is_n×nIf 0, the service flow is not allowed; (2) the system uses the edge matrix V_s×4Recommending a path of the business flow for the node, screening a row with the vertex in a Source column, and recommending a next link node for the business flow according to the Weight in the Weight column.

Specifically, the scheduling of the service flow of the to-do service based on the node network matrix and the edge matrix of the present invention includes: step 1, determining a service starting node of a service flow according to the service to be handled; step 2, according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed; step 3, carrying out quantity convergence on the searched target nodes which are allowed to jump, and finishing the to-do business according to the convergence resultAnd scheduling business processes.

Preferably, the converging the number of the searched target nodes allowing the jump, and completing the scheduling of the service flow of the to-be-handled service according to a convergence result includes: step 31, inquiring the event information of each target node allowing jumping, removing the nodes of which the event state is a first preset state, and finishing the first convergence; step 32, when the unique remaining target node allowing the jump is determined according to the convergence result, determining the unique remaining target node allowing the jump as the starting node of the next link, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed; step 33, when the remaining jump-allowed target nodes are determined to be not unique according to the convergence result, performing second convergence, sequencing the remaining jump-allowed target nodes according to the weight, determining a starting node of a next link according to the sequencing result, and returning to the step 31 for recalculation until the scheduling of the service flow of the to-be-handled service is completed; wherein if the node network matrix M is obtained according to the node_n×nAnd if the target node allowing the jump does not exist, directly ending the business process. The first preset state refers to a node of which the event state is 'leave' or 'off duty' and the like and cannot be subjected to business process skipping.

Preferably, the determining a starting node of a next link according to the sorting result includes: when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link; and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

The following examples illustrate embodiments of the present invention

An enterprise needs to rent an external unit field frequently to develop publicity activities due to business needs, and needs to execute business process approval activities of prior application and cost control in an office automation system. The invention relates to an office automation system and a business process construction and scheduling system, which use the method provided by the invention to create business processes.

1. Creating a sponsor node model:

2. creating an approver node model

3. Constructing a network matrix of nodes

In the preferred embodiment, it is assumed that there are 4 sponsors and 7 approvers, and there are 11 nodes in the network model, and a node network matrix and an edge matrix are configured for the 11 nodes as follows:

the node network matrix is:

wherein m (1,5) ═ 1; m (2,6) ═ 1; m (3,7) ═ 1; m (4,8) ═ 1; m (5,9) ═ 1; m (6,10) ═ 1; m (7,9) ═ 1; m (8,10) ═ 1; m (8,11) ═ 1; m (9,11) ═ 1; m (10,11) ═ 1. The other element value is 0.

4. Constructing edge matrices

In the preferred embodiment, the data of the edge matrix is shown in table 1:

table 1 edge matrix datasheet

Source	Target	Weight	ID
				1	5	1	1
2	6	1	2
				3	7	1	3
4	8	1	4
				5	9	0.6	5
6	10	0.5	6
				7	9	0.6	7
8	10	0.5	8
				8	11	0.6	9
9	11	1	10
				10	11	1	11

5. Business process scheduling

In the service flow scheduling, when the service flow is initiated from any node, the node network matrix is used to judge the connection relationship between the nodes, and determine the node of the next link of the service flow. For example, in the above edge matrix, the Weight values corresponding to the edges with ID 8 and ID 9 are 0.5 and 0.6, respectively. Thus, when a business process flow is passed to node 8, node 8 is first recommended 11 as the next target in the business process.

Fig. 3 is a schematic structural diagram of a scheduling system 300 for business processes according to an embodiment of the present invention. As shown in fig. 3, a scheduling system 300 for a business process according to an embodiment of the present invention includes: a network model construction unit 301, a matrix determination unit 302 and a business process scheduling unit 303.

Preferably, the network model constructing unit 301 is configured to construct the business process into a first network model in a form of "node + network", and determine node information of each node based on an object-oriented system.

Preferably, the node information includes: attribute information, service information, and event information.

Preferably, the matrix determining unit 302 is configured to connect nodes in the first network model according to a service process and node information to determine a second network model, and determine a node network matrix and an edge matrix based on the second network model.

Preferably, wherein the node network matrix is M_n×n(ii) a Wherein n is the total number of nodes involved in the service process; if the element M in the matrix_p,qIf 1, the p node points to the q node, and a direct service data association exists between p and q; if the element M in the matrix_p,qAnd if the value is 0, the p node is not associated with the q node, and no direct business data association exists between the p node and the q node.

Preferably, wherein the edge matrix is E_s×t(ii) a Wherein s is the number of edges in the second network model, and t is the number of attributes of the edges; the attributes of the edge include: the starting node number Source of the edge, the Target node number Target of the edge, the Weight of the edge and the number ID of the edge.

Preferably, the service flow scheduling unit 303 is configured to schedule a service flow of a service to be handled based on the node network matrix and the edge matrix.

Preferably, the service process scheduling unit 303 schedules the service process of the service to be handled based on the node network matrix and the edge matrix, including:

a service starting node obtaining module, configured to determine a service starting node of a service flow according to the service to be handled;

a target node searching and determining module for searching and determining the target node according to the node network matrix M_n×nThe connection relation between the middle nodes restricts the flow direction of the business process and searches for a target node which allows the jump; wherein, if M_p,qIf the value is 1, the service flow is allowed, and the next step is carried out; if M is_n×nIf 0, the service flow is not allowed;

and the quantity convergence module is used for carrying out quantity convergence on the searched target nodes which are allowed to jump and finishing the scheduling of the business process of the business to be handled according to a convergence result.

Preferably, the quantity convergence module performs quantity convergence on the searched target node allowing the jump, and completes the scheduling of the service flow of the to-be-handled service according to a convergence result, including:

the first convergence submodule is used for inquiring the event information of each target node allowing the jump, removing the nodes of which the event state is a first preset state and finishing the first convergence; (ii) a

The updating submodule is used for determining that the only residual target node allowing the jump is the starting node of the next link when the only residual target node allowing the jump is determined according to the convergence result, and entering the first convergence submodule for recalculation until the scheduling of the service flow of the service to be handled is completed;

the second convergence submodule is used for carrying out second convergence when the remaining target nodes which are allowed to jump are determined to be not unique according to the convergence result, sequencing the remaining target nodes which are allowed to jump according to the weight, determining the starting node of the next link according to the sequencing result, and entering the first convergence submodule for recalculation until the scheduling of the service flow of the service to be handled is completed;

wherein if the node network matrix M is obtained according to the node_n×nAnd if the target node allowing the jump does not exist, directly ending the business process.

Preferably, the determining, by the second convergence submodule, the starting node of the next link according to the sorting result includes:

when the sequencing result indicates that the target node with the maximum weight is unique, determining the unique target node with the maximum weight as the initial node of the next link;

and when the sequencing result indicates that the target node with the maximum weight is not unique, randomly determining any node in the target node with the maximum weight as the starting node of the next link.

The scheduling system 300 of the service process according to the embodiment of the present invention corresponds to the scheduling method 100 of the service process according to another embodiment of the present invention, and is not described herein again.

The invention has been described with reference to a few embodiments. However, other embodiments of the invention than the one disclosed above are equally possible within the scope of the invention, as would be apparent to a person skilled in the art from the appended patent claims.

Generally, all terms used in the claims are to be interpreted according to their ordinary meaning in the technical field, unless explicitly defined otherwise herein. All references to "a/an/the [ device, component, etc ]" are to be interpreted openly as referring to at least one instance of said device, component, etc., unless explicitly stated otherwise. The steps of any method disclosed herein do not have to be performed in the exact order disclosed, unless explicitly stated.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application 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 application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. 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.

Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting the same, and although the present invention is described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: modifications and equivalents may be made to the embodiments of the invention without departing from the spirit and scope of the invention, which is to be covered by the claims.