CN105894186A - Workflow circulation mechanism using multiple loose leaves - Google Patents
Workflow circulation mechanism using multiple loose leaves Download PDFInfo
- Publication number
- CN105894186A CN105894186A CN201610194753.XA CN201610194753A CN105894186A CN 105894186 A CN105894186 A CN 105894186A CN 201610194753 A CN201610194753 A CN 201610194753A CN 105894186 A CN105894186 A CN 105894186A
- Authority
- CN
- China
- Prior art keywords
- leaves
- many loose
- workflow
- flow
- preferential
- 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/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
Abstract
Provided is a workflow circulation mechanism using multiple loose leaves. The workflow circulation mechanism regards a workflow as a heterogeneous and shared computing resource pool, transfers and executes documents, information, or tasks between multiple loose leaves according to a circulated and automatically executed operation process in a development process when service resources are enough sufficient and may guarantee to simultaneously execute parallel tasks. The workflow circulation mechanism using multiple loose leaves automatically initiates a plurality of flows some of which are circulated independently and in parallel and some of which are precedence associated flows having influence on whether a main flow reaches a next link. As a result, the workflow circulation mechanism, on one hand, provides a system administrator with a flexible and convenient operation interface, and on the other hand, may achieve synchronous data exchange and shared characteristics welcomed by users, helps a system simplify superfluous flows and is a direction of workflow technological development in the future.
Description
Technical field
The present invention relates to the technical field of automation under computer utility environment, particularly relate in development process automatic according to circulate
The business process performed, transmits document, information or task between many loose-leaves and performs.
Background technology
Workflow, concept originates from organization of production and Field of Office Automation, is for having fixed routine activity in routine work
And propose concept, it is therefore an objective to by becoming to define good task or role by work breakdown, according to certain many loose-leaves and
Process performs these tasks and is monitored it, reaches to improve work efficiency, preferably control process, enhancing to client's
The purposes such as service, effectively management operation flow.The workflow defining that Georgakopoulos is given is: workflow is to appoint one group
Certain business process has been organized in business: defining trigger sequence and the trigger condition of task, each task can be by one
Or multiple software system completes, it is also possible to completed by one or lineup, it is also possible to cooperated with software system by one or more people
Complete.
Scientific research, production activity and other a large number of services flow processs are the most all workflow application, and each flow process is generally by one group
Partial ordering relation composition between activity and activity.Workflow activities needs Resources allocation before performing, and i.e. sets up between activity and resource and reflects
Penetrate relation.The resource that can complete same activity can be a lot, and resource is the most distributed, how to manage and effectively to use resource
It it is a major issue.We have carried out reductive analysis to the main flow modeling method that occurred of current process modeling field, can be
They are divided into 5 big classes: script, method, method based on many loose-leaves, the method for logic-based and algebraic method of based on net.
(1) script is described the sentence structure controlling stream with data stream, it provides a kind of simple and clear description method, for having
It is easier to for the designer of experience use.Its major defect is a lack of the Formal Semantic of flow process itself, the semantic master of language
If for language interpreter.(2) method based on net is suitable for the visual modeling of flow process, the most all uses status change
Net, the activity node in flow process represents, controls stream limit and represents.The subject matter using status change net is the most tangible
The semanteme of formula, the visual modeling method of most of working flow products all lacks Formal Semantic.There is Formal Semantic
In status change net, making with the most use is exactly Petr net and state diagram.(3) methods based on many loose-leaves, study the most at present
Many methods based on many loose-leaves are the many loose-leaves of ECA.It is basic that the many loose-leaves of ECA have formalization, but the visual chemical industry of the many loose-leaves of ECA
Measure bigger, if being just difficult to when many loose-leaves collection is bigger manage.(4) method of logic-based is suitable for the dynamic of descriptive system
State property, wherein sequential logic is a kind of conventional method, and it has good formalization basis, the attribute of checking Work flow model
More convenient.But the major defect of sequential logic is to be difficulty with visualization. it is not easy to be converted into other description method, retouches
The system action stating operation flow is the most complicated.(5) method based on algebraically is the most still confined in theoretic discussion, in workflow
Management domain is used seldom, and the description language LOTOS of a kind of Kernel-based methods algebraically is used for Workflow Management field.Algebraically side
The major defect of method is similar to the method for logic-based, and shows to compare logic-based in terms of execution and Formal Verification automatically
Method worse, modeling method lack intuitive, it is difficult to understand.
System practices the benefit that the workflow circulation mechanism of many loose-leaves is brought: apply the workflow circulation mechanism one of many loose-leaves
Aspect be system manager provide flexible, operate interface easily, be on the other hand capable of the synchronous exchange of data and share
Feature more popular with users, can effectively help system simplify unnecessary flow process, be future work Flow Technique development direction.
Summary of the invention
In order to overcome the deficiency of the workflow circulation mechanism of the many loose-leaves of existing application, the present invention provides a kind of workflow circulation machine
System, main flow circulates a loose-leaf, sets many loose-leaves inside this loose-leaf, and many loose-leaves are united according to dataform information
Meter obtains result.Automatically initiating several flow processs, these flow processs have parallel independent circulation, also have an impact whether main flow arrives lower link
Preferentially associate flow process.Main flow to circulate lower link, it is necessary to after waiting that preferential flow performing completes, and clicks on lower ring this time
Joint button is just effective.So on the one hand, complexity and difficulty that application security controls can be reduced, on the other hand again can be abundant
Preferential many loose-leaves are utilized to control workflow circulation process.
The technical solution adopted for the present invention to solve the technical problems is: apply many loose-leaves workflow circulation be under normal conditions
NP-hard problem, heuristic algorithm is widely adopted owing to can obtain acceptable solution within a rational operation time.Above-mentioned calculation
Workflow is regarded as an isomery, shared calculating resource pool by method.The application schedules problem flowing down services, at specific bar
Under part (Service Source is abundant, can guarantee that parallel task performs simultaneously), preferential many loose-leaves optimization problem of workflow DAG application can
Regard the DTCTP problem in project scheduling field as.Decompose based on network, utilize column-generation technology to provide the bound computational methods of solution,
And this solution is improved by the suitableeest many loose-leaves of many loose-leaves BF of proposition.The workflow preferential many loose-leaves problem representing preferential many loose-leaves DAG, can
With off period decomposition algorithm based on forward layering TL.
The invention has the beneficial effects as follows, apply the workflow of many loose-leaves to circulate, but owing to it is concerned only with the resource characteristic needed for activity,
Can not obtain preferable performance, the off period is decomposed into the preferential of activity according to movable parallel and synchronous characteristic and lives more by hierarchical algorithm
Page carrys out Optimizing Flow, does not considers the Service Source feature of activity；And activity selects service execution in limiting time window, can produce
Many unavailable discrete " time fragment ".By definition time priority many loose-leaves intensity TCS describe one movable maximum time
Between preferential many loose-leaves activity number；This information is introduced preferential many loose-leaves, devises time priority many loose-leaves intensity the suitableeest rule BFTCS,
For the improvement stage of heuritic approach, step up the performance of initial feasible solution.
Accompanying drawing explanation
The present invention is further described with embodiment below in conjunction with the accompanying drawings.
Fig. 1 is present example critical component graph of a relation.
Fig. 2 is present example Workflow Management System Architecture figure.
Fig. 3 is the simple work flow diagram that present example DAG represents.
Fig. 4 is present example cooperation meta-model diagram.
Fig. 5 is the procedure chart of present example flow process cooperation.
Fig. 6 is design and the graph of a relation that the management of present example workflow view and flow services manage main submodule.
Fig. 7 is present example directed acyclic instance graph.
Detailed description of the invention
In figure 3, illustrate based on the simple work flow diagram applying the workflow circulation mechanism DAG of many loose-leaves to represent.At DAG
In figure, the activity serial being positioned at same path performs, and its deadline is the execution time sum of all activities, and by the most
Loose-leaf retrains.Therefore, if one of them movable service execution selecting rank relatively low, other movable meetings retrain meeting due to the off period
Select the service that service class is higher, i.e. the services selection (substantially distributing the time of each activity) of these activities is each other
Impact, thus provides following (1) given G=(V, E), and the many loose-leaves of time priority must be positioned on same path.For j,
The many loose-leaves of forward direction time priority that forerunner activity r is referred to as j are movable；For r, succeeding activity j is referred to as the backward time priority of r
Many loose-leaves are movable.(2) given G=(V, E), the forward direction time that its maximum forward time priority many loose-leaves activity number is referred to as r is excellent
First many loose-leaves intensity；Given G=(V, E), the backward time priority that its maximum backward time priority many loose-leaves activity number is referred to as r is many
Loose-leaf intensity；Given G=(V, E), its forward and backward time priority many loose-leaves intensity sum is referred to as the many loose-leaves of time priority of i
Intensity.It can be seen that time priority many loose-leaves intensity of activity is a kind of quality metric, when mark one movable maximum
Between preferential many loose-leaves activity number, its value can be calculated by the reachability matrix of DAG figure.In matrix, the i-th row summation is the backward of i
Time priority many loose-leaves intensity；I-th row summation is forward direction time priority many loose-leaves intensity of i；I-th row and the i-th row summation are then
Time priority many loose-leaves intensity of i.The time priority many loose-leaves intensity level (except dummy node) of this activity of numeric representation above node.
Analysis time, the definition of preferential many loose-leaves intensity understood, and movable time priority many loose-leaves intensity is the biggest, and this activity exists
During services selection, the movable number of impact is the most.Movable 7 have maximum time preferential many loose-leaves intensity (value is 6), if this activity is excellent
First select the service of seeervice level relatively low (running the time longer), then, under the off period retrains, the many loose-leaves of its time priority are movable
3,4,5,6 (except dummy node) understands the service that the operation time can not be selected because reducing slack time or do not exist longer, and these are movable
Required expense will be higher, and the local optimum performance of algorithm will be affected；Otherwise, if (the many loose-leaves of time priority are strong in activity 3
Spend little) the relatively low service of prioritizing selection seeervice level, it only affects the services selection of activity 7, and other activity still has an opportunity to select service
The relatively low service of level reduces further should when workflow total cost, i.e. time priority many loose-leaves intensity are the designs of priority many loose-leaves
The key factor considered.
Claims (3)
1. apply the workflow circulation mechanism of many loose-leaves, it is characterized in that: according to the business process automatically performed circulated in development process, document, information or task are transmitted between many loose-leaves and performs；Automatically initiating several flow processs, these flow processs have parallel independent circulation, and also have an impact whether main flow arrive lower link preferentially associates flow process；Main flow to circulate lower link, it is necessary to after waiting that preferential flow performing completes, and clicks on lower link button this time just effectively.
According to the business process automatically performed circulated in development process the most according to claim 1, document, information or task transmitted between many loose-leaves and performs, it is characterized in that: workflow is regarded as an isomery, shared calculating resource pool；The application schedules problem flowing down services, under given conditions (Service Source is abundant, can guarantee that parallel task performs simultaneously), preferential many loose-leaves optimization problem of workflow DAG application can regard the DTCTP problem in project scheduling field as；Decompose based on network, utilize column-generation technology to provide the bound computational methods of solution, and this solution is improved by the suitableeest many loose-leaves of many loose-leaves BF of proposition；The workflow preferential many loose-leaves problem representing preferential many loose-leaves DAG, can be based on the off period decomposition algorithm of forward layering TL.
The most according to claim 1 automatically initiate several flow processs, these flow processs have parallel independent circulation, also have an impact whether main flow arrive lower link preferentially associates flow process, main flow to circulate lower link, have to wait for after preferential flow performing completes, clicking on lower link button this time just effective, feature is: preferential many loose-leaves that the off period is decomposed into activity according to movable parallel and synchronous characteristic carry out Optimizing Flow, do not consider the Service Source feature of activity;And activity selects service execution in limiting time window, many unavailable discrete " time fragment " can be produced；By definition time priority many loose-leaves intensity TCS, one preferential many loose-leaves activity number of movable maximum time is described;This information is introduced the many loose-leaves of BF, devises time priority many loose-leaves intensity the suitableeest rule BFTCS, for the improvement stage of heuritic approach, step up the performance of initial feasible solution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610194753.XA CN105894186A (en) | 2016-03-30 | 2016-03-30 | Workflow circulation mechanism using multiple loose leaves |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610194753.XA CN105894186A (en) | 2016-03-30 | 2016-03-30 | Workflow circulation mechanism using multiple loose leaves |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105894186A true CN105894186A (en) | 2016-08-24 |
Family
ID=57014413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610194753.XA Pending CN105894186A (en) | 2016-03-30 | 2016-03-30 | Workflow circulation mechanism using multiple loose leaves |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105894186A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107871228A (en) * | 2016-09-27 | 2018-04-03 | 优甸网络科技（上海）有限公司 | Workflow editor based on loose-leaf configuration |
| CN109214626A (en) * | 2017-07-03 | 2019-01-15 | 优甸网络科技（上海）有限公司 | Process loose-leaf configuration mechanism based on editing machine |
| US11379768B2 (en) * | 2015-03-19 | 2022-07-05 | Kabushiki Kaisha Toshiba | Dialogue data collection system and dialogue data collection supporting apparatus |
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 |
-
2016
- 2016-03-30 CN CN201610194753.XA patent/CN105894186A/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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11379768B2 (en) * | 2015-03-19 | 2022-07-05 | Kabushiki Kaisha Toshiba | Dialogue data collection system and dialogue data collection supporting apparatus |
| CN107871228A (en) * | 2016-09-27 | 2018-04-03 | 优甸网络科技（上海）有限公司 | Workflow editor based on loose-leaf configuration |
| CN109214626A (en) * | 2017-07-03 | 2019-01-15 | 优甸网络科技（上海）有限公司 | Process loose-leaf configuration mechanism based on editing machine |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11429433B2 (en) | Process discovery and automatic robotic scripts generation for distributed computing resources | |
| CN106775632B (en) | High-performance geographic information processing method and system with flexibly-expandable business process | |
| CN105959401B (en) | A kind of manufacturing service supply-demand mode and dynamic dispatching method based on super-network | |
| CN108920261A (en) | A kind of two-stage self-adapting dispatching method suitable for large-scale parallel data processing task | |
| CN100576177C (en) | Bidirectional grade gridding resource scheduling method based on the QoS constraint | |
| CN101017546A (en) | Method and device for categorical data batch processing | |
| CN105574705A (en) | Priority rule-based workflow transfer mechanism | |
| CN103761614A (en) | Project progress management method based on critical chain | |
| CN103838627B (en) | Workflow dispatching method based on workflow throughput maximization | |
| CN109299180B (en) | ETL operating system of data warehouse | |
| CN105894186A (en) | Workflow circulation mechanism using multiple loose leaves | |
| CN104156269B (en) | A kind of method for visualizing of the software and hardware optimal dividing based on Timed Automata | |
| CN111079997A (en) | Modeling and collaborative optimization method | |
| CN114625517A (en) | DAG graph computation distributed big data workflow task scheduling platform | |
| Fernández-Montes et al. | Smart scheduling for saving energy in grid computing | |
| CN109636299A (en) | Node time limit mechanism based on workflow band | |
| CN115827258B (en) | Distributed task operation method, main control server, simulation computing node and system | |
| CN103810258A (en) | Data aggregation scheduling method based on data warehouse | |
| 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 | |
| Zhang et al. | Workflow-oriented grid service composition and scheduling | |
| Xue | A task parallel processing technology for robot process automation | |
| CN112884455A (en) | Task plan processing system, method and device |
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: 20160824 |