CN105574705A - Priority rule-based workflow transfer mechanism - Google Patents
Priority rule-based workflow transfer mechanism Download PDFInfo
- Publication number
- CN105574705A CN105574705A CN201510821085.4A CN201510821085A CN105574705A CN 105574705 A CN105574705 A CN 105574705A CN 201510821085 A CN201510821085 A CN 201510821085A CN 105574705 A CN105574705 A CN 105574705A
- Authority
- CN
- China
- Prior art keywords
- rule
- priority rule
- workflow
- flow
- main flow
- 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.)
- Pending
Links
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/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a priority rule-based workflow transfer mechanism. A workflow is regarded as a heterogeneous shared computing resource pool; under specific conditions (service resources are enough and concurrent execution of parallel tasks can be ensured), an upper and lower bounds calculation method for a solution is provided by a column generation technology; and the solution is improved by proposing an optimal rule priority rule. The embodiment of the invention provides a workflow transfer mechanism. A main flow is transferred to one link; and rules are counted according to data form information to obtain a result. A few of flows are automatically initiated; and these flows comprise the flows which are concurrently or independently transferred and also comprise priority-associated flows of affecting whether the main flow is transferred to the next link or not. Transferring of the main flow to the next link is effective by clicking a next link button only when execution of the priority flow is finished, so that, on one hand, the safety control complexity and difficulty of an application program can be lowered; and on the other hand, the priority rule can also be fully utilized to control the workflow transfer process.
Description
Technical field
The present invention relates to the technical field of automation under computer utility environment, particularly relate to the business process automatically performed according to priority rule in performance history, document, information or task carried out between different executors transmit and perform.
Background technology
Workflow, concept originates from organization of production and Field of Office Automation, it is the concept proposed for having fixed routine activity in routine work, object is by job analysis is become the good task of definition or role, perform these tasks according to certain rule and process and it monitored, reach increase work efficiency, better control procedure, strengthen the objects such as service, effectively management service flow process to client.The workflow defining that Georgakopoulos provides is: workflow is that a group task has been organized certain business process: the trigger sequence and the trigger condition that define task, each task can be completed by one or more software systems, also can be completed by one or lineup, can also have been cooperated with software systems by one or more people.
Scientific research, activity in production and other a large number of services flow processs are in fact all workflow application, and each flow process is made up of the partial ordering relation between one group of activity and activity usually.Workflow activities needs Resources allocation before performing, and namely between activity and resource, sets up mapping relations.The resource that can complete same activity can be a lot, and resource is normally distributed, how to manage and effectively to use resource to be a major issue.We have carried out reductive analysis to the main flow modeling method that current process modeling field occurred, can put them into 5 large classes: the method for script, the method based on net, rule-based method, logic-based and algebraic method.(1) there is the sentence structure describing control flow check and data stream in script, it provide a kind of simple and clear describing method, be easier to use for experienced deviser.Its major defect is the Formal Semantic lacking flow process itself, and the semanteme of language is mainly for language interpreter.(2) be suitable for the visual modeling of flow process based on the method for netting, generally all using state changes net, and the activity in flow process represents with node, and control flow check limit represents.The subject matter of using state transition net is whether there is formal semanteme, and the visual modeling method of most of working flow products all lacks Formal Semantic.In the status change net with Formal Semantic, making with the most use is exactly Petr net and constitutional diagram.(3) rule-based method, the rule-based method studying at most is at present eca rule.Eca rule has formalization basis, but the visual work amount of eca rule is larger, if be just difficult to management when rule set is larger.(4) method of logic-based is suitable for the dynamic of descriptive system, and wherein sequential logic is a kind of conventional method, and it has good formalization basis, and the attribute of checking Work flow model is more convenient.But the major defect of sequential logic be difficult to realize visual. be not easy to convert to other describing method, the system action describing operation flow is too complicated.(5) method based on algebraically is mainly still confined in theoretic discussion, uses seldom, only have a kind of descriptive language LOTOS of Kernel-based methods algebraically to be used to Workflow Management field in Workflow Management field.The major defect of algebraic method is similar to the method for logic-based, and automatically perform with Formal Verification in show poorer than the method for logic-based, modeling method lack intuitive, indigestion.
System Implementation is based on the benefit brought of workflow circulation mechanism of priority rule: based on priority rule workflow circulation mechanism on the one hand for system manager provide flexibly, operation interface easily, synchronous exchange and the shared feature that can realize data are on the other hand more popular with users, effectively help system can simplify unnecessary flow process, be the direction of future work Flow Technique development.
Summary of the invention
In order to overcome the deficiency of the existing workflow based on priority rule circulation mechanism, the invention provides a kind of workflow circulation mechanism, main flow circulates a link, sets rule inside this link, and rule carries out statistics acquisition result according to dataform information.Automatic initiation several flow process, these flow processs have parallel independence to circulate, and also have and affect the preferential association flow process whether main flow arrives lower link.Main flow will circulate lower link, after must waiting for that preferential flow process is complete, clicks lower link button this time just effectively.Such one side can reduce complexity and the difficulty of application security control, can make full use of again priority rule on the other hand and control workflow circulation process.
The technical solution adopted for the present invention to solve the technical problems is: workflow priority rule is NP-hard problem under normal conditions, heuristic algorithm due to can obtain within a rational working time can accept separate and be widely adopted.Workflow is regarded as an isomery, shared computational resource pond by above-mentioned algorithm.To the application schedules problem that services flows down, under given conditions (Service Source is abundant, can ensure that parallel task performs simultaneously), the priority rule optimization problem of workflow DAG application can regard the DTCTP problem in project scheduling field as.Figure Network Based decomposes, and utilizes column-generation technology to provide the bound computing method of solution, and the suitableeest regular BF rule of proposition is improved this solution.To the workflow priority rule problem that priority rule DAG represents, can based on the off period decomposition algorithm of forward layering TL.
The invention has the beneficial effects as follows, the suitableeest preferential rule can be used for the priority rule optimization problem solving workflow, but due to its resource characteristic only needed for concern activity, good performance can not be obtained, off period is decomposed into movable priority rule according to movable parallel and synchronous characteristic and carrys out Optimizing Flow by hierarchical algorithm, does not consider movable Service Source feature; And activity selects service execution in limiting time window, can produce many unavailable discrete " time fragment ".By definition time priority rule intensity TCS, a movable maximum time priority rule activity number is described; This information is introduced priority rule, devises time priority rule intensity the suitableeest rule BFTCS, for the improvement stage of heuritic approach, progressively improve the performance of initial feasible solution.
Accompanying drawing explanation
Below in conjunction with drawings and Examples, the present invention is further described.
Fig. 1 is the simple work flow diagram that example DAG of the present invention represents.
Fig. 2 is example directed acyclic instance graph of the present invention.
Fig. 3 is the procedure chart of example process of the present invention cooperation.
Fig. 4 is example of the present invention cooperation meta-model figure.
Fig. 5 is example Workflow Management System Architecture figure of the present invention.
Fig. 6 is example critical parts relationship figure of the present invention.
Fig. 7 is design and the graph of a relation that example workflow view of the present invention management and flow services manage main submodule.
Embodiment
In FIG, the workflow illustrated based on priority rule circulates the simple work flow diagram that machine-processed DAG represents.In DAG figure, the activity serial being positioned at same path performs, and its deadline is the execution time sum of all activities, and retrains by priority rule.Therefore, if the service execution that one of them movable selection rank is lower, other activities can select due to off period constraint the service that service class is higher, namely the services selection (being in fact the time devided modulation on each activity) of these activities affects each other, provide following (1) given G=(V thus, E), time priority rule must be positioned on same path.For j, the movable r of forerunner is called the forward direction time priority Rule Activity of j; For r, succeeding activity j is called the backward time priority Rule Activity of r.(2) given G=(V, E), its maximum forward time priority Rule Activity number is called the forward direction time priority rule intensity of r; Given G=(V, E), its maximum backward time priority Rule Activity number is called the backward time priority rule intensity of r; Given G=(V, E), its forward and backward time priority rule intensity sum is called the time priority rule intensity of i.Can find out, movable time priority rule intensity is a kind of quality metric, and for identifying a movable movable number of maximum time priority rule, its value calculates by the reachability matrix of DAG figure.In matrix, the i-th row summation is the backward time priority rule intensity of i; I-th row summation is the forward direction time priority rule intensity of i; I-th row and the i-th row summation are then the time priority rule intensity of i.The time priority rule intensity value (except dummy node) of this activity of numeric representation above node.
Analysis time, the definition of priority rule intensity was known, and a movable time priority rule intensity is larger, and the movable number that this activity affects when services selection is more.Movable 7 have maximum time priority rule intensity (value is 6), if this active priority selects the service of seeervice level lower (working time is longer), then under off period constraint, its time priority rule activity 3, the service that 4,5,6 (except dummy node) can reduce because of slack time or not exist and working time can not be selected longer, these movable required expenses will be higher, and the local optimum performance of algorithm will be affected; Otherwise, if movable 3 (time priority rule intensity is little) service that prioritizing selection seeervice level is lower, it only affects the services selection of activity 7, other activity still has an opportunity to select the lower service of seeervice level to reduce workflow total expenses further, the key factor should considered when namely time priority rule intensity is priority rule design.
Claims (3)
1. based on the workflow circulation mechanism of priority rule, it is characterized in that: the workflow machine-processed main flow that circulates circulates a link, and set rule inside this link, rule carries out statistics acquisition result according to dataform information.Automatic initiation several flow process, these flow processs have parallel independence to circulate, and also have and affect the preferential association flow process whether main flow arrives lower link.Main flow will circulate lower link, after must waiting for that preferential flow process is complete, clicks lower link button this time just effectively.
2. the workflow according to claim 1 machine-processed main flow that circulates circulates a link, rule is set inside this link, rule is carried out statistics according to dataform information and is obtained result, it is characterized in that: workflow is regarded as an isomery, shared computational resource pond.To the application schedules problem that services flows down, under given conditions (Service Source is abundant, can ensure that parallel task performs simultaneously), the priority rule optimization problem of workflow DAG application can regard the DTCTP problem in project scheduling field as.Figure Network Based decomposes, and utilizes column-generation technology to provide the bound computing method of solution, and the suitableeest regular BF rule of proposition is improved this solution.To the workflow priority rule problem that priority rule DAG represents, can based on the off period decomposition algorithm of forward layering TL.
3. automatic initiation several flow process according to claim 1, these flow processs have parallel independent circulation, also have and affect the preferential association flow process whether main flow arrives lower link, main flow will circulate lower link, after must waiting for that preferential flow process is complete, click lower link button this time just effective, feature is: is decomposed into movable priority rule the off period according to movable parallel and synchronous characteristic and carrys out Optimizing Flow, do not consider movable Service Source feature; And activity selects service execution in limiting time window, can produce many unavailable discrete " time fragment ".By definition time priority rule intensity TCS, a movable maximum time priority rule activity number is described; This information is introduced BF rule, devise time priority rule intensity the suitableeest rule BFTCS, for the improvement stage of heuritic approach, progressively improve the performance of initial feasible solution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510821085.4A CN105574705A (en) | 2015-11-24 | 2015-11-24 | Priority rule-based workflow transfer mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510821085.4A CN105574705A (en) | 2015-11-24 | 2015-11-24 | Priority rule-based workflow transfer mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105574705A true CN105574705A (en) | 2016-05-11 |
Family
ID=55884808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510821085.4A Pending CN105574705A (en) | 2015-11-24 | 2015-11-24 | Priority rule-based workflow transfer mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105574705A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107871228A (en) * | 2016-09-27 | 2018-04-03 | 优甸网络科技（上海）有限公司 | Workflow editor based on loose-leaf configuration |
| CN108665222A (en) * | 2017-03-30 | 2018-10-16 | 优甸网络科技（上海）有限公司 | The preferential flow algorithm realized by workflow |
| CN109214763A (en) * | 2017-07-03 | 2019-01-15 | 优甸网络科技（上海）有限公司 | Workflow priority algorithm based on process |
| CN109214626A (en) * | 2017-07-03 | 2019-01-15 | 优甸网络科技（上海）有限公司 | Process loose-leaf configuration mechanism based on editing machine |
| CN109636309A (en) * | 2018-11-01 | 2019-04-16 | 北京慧流科技有限公司 | Task processing method and device, electronic equipment and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1816567A2 (en) * | 2005-12-07 | 2007-08-08 | GM Global Technology Operations, Inc. | Progress tracking method for uptime improvement |
-
2015
- 2015-11-24 CN CN201510821085.4A patent/CN105574705A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1816567A2 (en) * | 2005-12-07 | 2007-08-08 | GM Global Technology Operations, Inc. | Progress tracking method for uptime improvement |
Non-Patent Citations (2)
| Title |
|---|
| 苑迎春等: "基于优先级规则的网格工作流调度", 《电子学报》 * |
| 黄觉明等: "ETL工作流活动优先级的确定及并行实现", 《计算机应用研究》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107871228A (en) * | 2016-09-27 | 2018-04-03 | 优甸网络科技（上海）有限公司 | Workflow editor based on loose-leaf configuration |
| CN108665222A (en) * | 2017-03-30 | 2018-10-16 | 优甸网络科技（上海）有限公司 | The preferential flow algorithm realized by workflow |
| CN109214763A (en) * | 2017-07-03 | 2019-01-15 | 优甸网络科技（上海）有限公司 | Workflow priority algorithm based on process |
| CN109214626A (en) * | 2017-07-03 | 2019-01-15 | 优甸网络科技（上海）有限公司 | Process loose-leaf configuration mechanism based on editing machine |
| CN109636309A (en) * | 2018-11-01 | 2019-04-16 | 北京慧流科技有限公司 | Task processing method and device, electronic equipment and storage medium |
| CN109636309B (en) * | 2018-11-01 | 2021-06-15 | 北京慧流科技有限公司 | Task processing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105574705A (en) | Priority rule-based workflow transfer mechanism | |
| CN105959401B (en) | A kind of manufacturing service supply-demand mode and dynamic dispatching method based on super-network | |
| Shen et al. | Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems | |
| CN101017546A (en) | Method and device for categorical data batch processing | |
| CN110909039A (en) | Big data mining tool and method based on drag type process | |
| CN109299180B (en) | ETL operating system of data warehouse | |
| CN108037919A (en) | A kind of visualization big data workflow configuration method and system based on WEB | |
| CN101271405A (en) | Bidirectional grade gridding resource scheduling method based on QoS restriction | |
| CN108647886B (en) | Scientific computing process management system | |
| CN101582043A (en) | Dynamic task allocation method of heterogeneous computing system | |
| CN111047272A (en) | Project scheduling method and device for multi-language collaborative development | |
| CN110009202A (en) | A kind of intelligent scheduled production program system and method for fertilizer factory | |
| CN105894186A (en) | Workflow circulation mechanism using multiple loose leaves | |
| Zhang et al. | Counterfactual-attention multi-agent reinforcement learning for joint condition-based maintenance and production scheduling | |
| CN109636299A (en) | Node time limit mechanism based on workflow band | |
| Xu | A petri net-based hybrid heuristic scheduling algorithm for flexible manufacturing system | |
| CN109214763A (en) | Workflow priority algorithm based on process | |
| Yang et al. | A novel framework of using petri net to timed service business process modeling | |
| CN109635988A (en) | Workflow preferentially circulates mechanism | |
| CN108665222A (en) | The preferential flow algorithm realized by workflow | |
| CN113779492A (en) | Demand task planning algorithm for agile development | |
| Dias et al. | Improving Many-Task computing in scientific workflows using P2P techniques | |
| Zhang et al. | SMOSA: Spider monkey optimization‐based scheduling algorithm for heterogeneous Hadoop | |
| CN102142104A (en) | Schedule guide type man-machine interaction passive management model | |
| Liu et al. | The research of ant colony and genetic algorithm in grid Task scheduling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160511 |