CN109636299A - Node time limit mechanism based on workflow band - Google Patents
Node time limit mechanism based on workflow band Download PDFInfo
- Publication number
- CN109636299A CN109636299A CN201710930273.XA CN201710930273A CN109636299A CN 109636299 A CN109636299 A CN 109636299A CN 201710930273 A CN201710930273 A CN 201710930273A CN 109636299 A CN109636299 A CN 109636299A
- Authority
- CN
- China
- Prior art keywords
- loose
- workflow
- leaf
- preferential
- leaves
- 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
A kind of node time limit mechanism based on workflow band, regard workflow as an isomery, shared computing resource pool, under the conditions of Service Source is enough and can guarantee that parallel task is performed simultaneously, according to the business process of circulation executed automatically in development process, document, information or task are carried out to transmitting between more loose-leaves and execute the embodiment of the present invention providing a kind of node time limit mechanism based on workflow band, automatically initiate several processes, these processes have independently to circulate parallel, and whether the main flow that also has an impact arrive the preferential association process of lower link.Flexible, convenient operation interface on the one hand is provided for system manager in this way, synchronous exchange and the shared feature that on the other hand can be realized data are more popular with users, effectively help system can simplify extra process, be the directions of future work Flow Technique development.
Description
Technical field
The present invention relates in the field of automation technology more particularly to development process under computer application environment according to circulation
The business process executed automatically, document, information or task are transmitted and are executed between more loose-leaves.
Background technique
Workflow, concept originate from organization of production and Field of Office Automation, are to be directed to have in routine work to fix
Program activity and the concept proposed, it is therefore an objective to by by job analysis at good task or role is defined, according to certain
More loose-leaves and process execute these tasks and it be monitored, reach and improve working efficiency, better control process, increasing
By force to the service of client, effective management business process the purpose of.The workflow defining that Georgakopoulos is provided is: workflow
It is to organize a group task to complete some business process: defines the trigger sequence and trigger condition of task, Mei Geren
Business can be completed by one or more software systems, can also be completed by one or a set of people, can also be by one or more people
Cooperate completion with software systems.
Scientific research, production activity and other a large number of services processes are substantially all workflow applications, and each process is usual
It is made of one group of partial ordering relation between activity and activity.Workflow activities execute before need distribution resource, i.e., activity and resource it
Between establish mapping relations.Can complete same movable resource can be very much, and resource is usually distributed, how to manage simultaneously effectively
It the use of resource is a major issue.We, which conclude to the mainstream modeling method that current process modeling field occurred, divides
Analysis, they can be divided into 5 major class: scripting language, the method based on net, the method based on more loose-leaves, the method for logic-based
And algebraic method.(1) sentence structure of control stream and data flow is described in scripting language, it provides a kind of concise description
Method, be easier to for experienced designer using.Its major defect is a lack of the Formal Semantic of process itself,
The semanteme of language is mainly used for language interpreter.(2) method based on net is suitable for the visual modeling of process, generally all
Use state changes net, and the activity in process is indicated with node, and control stream is indicated with side.The main problem of use state transition net
Be whether the semanteme of tangible formula, the visual modeling method of most of working flow products all lacks Formal Semantic.Having
Have in the status change net of Formal Semantic, makes with the most use to be exactly Petr net and state diagram.(3) side based on more loose-leaves
Method, the current most studied method based on more loose-leaves is the more loose-leaves of ECA.The more loose-leaves of ECA have formalization basis, still
The visual work amount of the more loose-leaves of ECA is bigger, is difficult to manage if when more loose-leaf collection are bigger.(4) side of logic-based
Method is suitable for the dynamic of description system, and wherein sequential logic is a kind of common method, it has formalization basis well,
The attribute for verifying Work flow model is more convenient.But the major defect of sequential logic is that visualization difficult to realize is not easy to turn
Change other description methods into, the system action for describing operation flow is too complicated.(5) method based on algebra is mainly still limited to
In theoretic discussion, Workflow Management field with seldom, only a kind of description language LOTOS of Kernel-based methods algebra by with
In Workflow Management field.The method that the major defect of algebraic method is similar to logic-based, and in automatic execution and form
Chemical examination card aspect shows more worse than the method for logic-based, and modeling method lacks intuitive, it is difficult to understand.
System implements benefit brought by the node time limit mechanism based on workflow band: the node based on workflow band
On the one hand time limit mechanism provides flexible, convenient operation interface for system manager, on the other hand can be realized the same of data
Step exchange and shared feature are more popular with users, effectively help system can simplify extra process, are future work Flow Technique hairs
The direction of exhibition.
Summary of the invention
In order to overcome the shortcomings of that existing node time limit mechanism, the present invention provide a kind of node phase based on workflow band
Limit mechanism, main flow circulation set more loose-leaves to a loose-leaf inside this loose-leaf, more loose-leaves according to dataform information into
Row statistics obtains result.Several processes are automatically initiated, these processes have independently to circulate parallel, and whether the main flow that also has an impact arrive
The preferential association process of lower link.Main flow will circulate to lower link, it is necessary to after the completion of waiting preferential process to execute, this when
It is just effective to click lower link button.The complexity and difficulty of application security control, another party on the one hand can be reduced in this way
Face can make full use of preferential more loose-leaf control workflow circulation processes again.
The technical solution adopted by the present invention to solve the technical problems is: the node time limit mechanism based on workflow band exists
NP-hard problem under normal conditions, heuristic algorithm due to can obtain acceptable solution in a reasonable runing time and by
It is widely used.Above-mentioned algorithm regards workflow as an isomery, shared computing resource pool.The application that services flows down is adjusted
Degree problem, under given conditions (Service Source is enough, can guarantee that parallel task is performed simultaneously), workflow DAG are applied excellent
First more loose-leaf optimization problems can regard the DTCTP problem in project scheduling field as.It is decomposed based on network, is given using column-generation technology
The bound calculation method solved out, and propose that most suitable more more loose-leaves of loose-leaf BF improve the solution.Preferential more loose-leaf DAG are indicated
The preferential more loose-leaf problems of workflow, can be based on the off period decomposition algorithm of positive layering TL.
The invention has the advantages that the node time limit mechanism based on workflow band, but since it is concerned only with movable institute
The resource characteristic needed, cannot obtain preferable performance, and hierarchical algorithm will decompose the off period according to movable parallel and synchronous characteristic
Carry out Optimizing Flow for movable preferential more loose-leaves, does not consider movable Service Source feature；And activity is in limiting time window
Service execution is selected, many unavailable discrete " time fragments " can be generated.By defining the more loose-leaf intensity TCS of time priority
One movable maximum time preferential more loose-leaf activity numbers are described；The information is introduced into preferential more loose-leaves, it is excellent to devise the time
First more most suitable rule BFTCS of loose-leaf intensity step up the performance of initial feasible solution for the improvement stage of heuritic approach.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples.
Fig. 1 is present example critical component relational graph.
Fig. 2 is present example Workflow Management System Architecture figure.
Fig. 3 is the simple work flow diagram that present example DAG is indicated.
Fig. 4 is present example cooperation meta-model diagram.
Fig. 5 is the procedure chart of present example process cooperation.
Fig. 6 is the design and relational graph that the management of present example workflow view and flow services manage main submodule.
Fig. 7 is present example directed acyclic instance graph.
Specific embodiment
In Fig. 3, the simple work flow diagram of the node time limit mechanism DAG expression based on workflow band is illustrated.In DAG
In figure, the activity positioned at same path is serially executed, and the deadline is the sum of all movable execution times, and by preferential more
Loose-leaf constraint.Therefore, if one of activity selection lower service execution of rank, other activities can constrain meeting due to the off period
Select the higher service of service class, i.e. these movable services selections (substantially distributing each movable time) phase each other
It mutually influences, thus provides following (1) and give G=(V, E), the more loose-leaves of time priority must be located on same path.For j,
Forerunner's activity r is known as the more loose-leaf activities of forward direction time priority of j；For r, the backward time priority that succeeding activity j is known as r is more
Loose-leaf activity.(2) G=(V, E) is given, the forward direction time priority that the more loose-leaf activity numbers of maximum forward time priority are known as r is more
Loose-leaf intensity；Given G=(V, E), the maximum backward more loose-leaf activity numbers of time priority are known as the more loose-leaves of backward time priority of r
Intensity；Given G=(V, E), the more loose-leaves of time priority that the sum of more loose-leaf intensity of forward and backward time priority are known as i are strong
Degree.As can be seen that the movable more loose-leaf intensity of time priority are a kind of quality metrics, for identifying a movable maximum time
Preferential more loose-leaf activity numbers, value can be calculated by the reachability matrix of DAG figure.The summation of the i-th row is the backward time of i in matrix
Preferential more loose-leaf intensity；I-th column summation is the more loose-leaf intensity of forward direction time priority of i；I-th row and i-th column summation then for i when
Between preferential more loose-leaf intensity.Numerical value indicates the movable more loose-leaf intensity values of time priority above node (except dummy node).
The definition of analysis time preferential more loose-leaf intensity, should it is found that the movable more loose-leaf intensity of time priority are bigger
The movable number that activity is influenced in services selection is more.Activity 7 has maximum time preferential more loose-leaf intensity (value is 6), if should
Active priority selects the service of seeervice level lower (runing time is longer), then under off period constraint, the more loose-leaves of time priority
Activity 3,4,5,6 (except dummy node) can cannot select the longer service of runing time due to slack time reduces or is not present,
These activity required costs will be higher, and the local optimum performance of algorithm will be affected；Conversely, if movable 3 (time priorities
More loose-leaf intensity are small) the preferential selection lower service of seeervice level, the services selection of its only influence activity 7, other activities are still organic
The lower service of seeervice level can be selected to further decrease workflow total cost, i.e. the more loose-leaf intensity of time priority are that priority is more
The key factor that loose-leaf is considered as when designing.
Claims (3)
1. the node time limit mechanism based on workflow band, it is characterized in that: according to the warp of circulation executed automatically in development process
Document, information or task are transmitted and are executed between more loose-leaves by battalion's process；Several processes are automatically initiated, these processes
Have and independently circulate parallel, whether the main flow that also has an impact arrive the preferential association process of lower link；Main flow will circulate to lower ring
Section, it is necessary to after the completion of waiting preferential process to execute, it is just effective to click lower link button this when.
2. according to the business process of circulation executed automatically in development process according to claim 1, by document, information or
Task is transmitted and is executed between more loose-leaves, it is characterized in that: regarding workflow as an isomery, shared computing resource
Pond；To the application schedules problem that services flows down, (Service Source is enough, can guarantee that parallel task is same under given conditions
Shi Zhihang), preferential more loose-leaf optimization problems of workflow DAG application can regard the DTCTP problem in project scheduling field as；Based on net
Network figure decomposes, and the bound calculation method of solution is provided using column-generation technology, and proposes most suitable more more loose-leaves of loose-leaf BF to the solution
It improves；The workflow indicated preferential more loose-leaf DAG preferentially decomposed by more loose-leaf problems, the off period that TL can be layered based on forward direction
Algorithm.
3. according to claim 1 automatically initiate several processes, these processes, which have, parallel independently to circulate, and also have an impact master
Whether process arrives the preferential association process of lower link, and main flow will circulate to lower link, it is necessary to preferential process be waited to execute completion
Afterwards, it is just effective to click lower link button this when, is characterized in: will be decomposed into the off period according to movable parallel and synchronous characteristic
Movable preferential more loose-leaves carry out Optimizing Flow, do not consider movable Service Source feature;And activity is selected in limiting time window
Service execution is selected, many unavailable discrete " time fragments " can be generated；It is retouched by defining the more loose-leaf intensity TCS of time priority
State a movable maximum time preferential more loose-leaf activity numbers;The information is introduced into the more loose-leaves of BF, it is more to devise time priority
The most suitable rule BFTCS of loose-leaf intensity steps up the performance of initial feasible solution for the improvement stage of heuritic approach.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710930273.XA CN109636299A (en) | 2017-10-09 | 2017-10-09 | Node time limit mechanism based on workflow band |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710930273.XA CN109636299A (en) | 2017-10-09 | 2017-10-09 | Node time limit mechanism based on workflow band |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109636299A true CN109636299A (en) | 2019-04-16 |
Family
ID=66051131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710930273.XA Pending CN109636299A (en) | 2017-10-09 | 2017-10-09 | Node time limit mechanism based on workflow band |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109636299A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114462900A (en) * | 2022-04-13 | 2022-05-10 | 云智慧（北京）科技有限公司 | Method, device and equipment for splitting service active node |
| CN116645068A (en) * | 2023-07-21 | 2023-08-25 | 三峡高科信息技术有限责任公司 | Flow processing system and method supporting conditional cycle node |
-
2017
- 2017-10-09 CN CN201710930273.XA patent/CN109636299A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114462900A (en) * | 2022-04-13 | 2022-05-10 | 云智慧（北京）科技有限公司 | Method, device and equipment for splitting service active node |
| CN114462900B (en) * | 2022-04-13 | 2022-07-29 | 云智慧（北京）科技有限公司 | Method, device and equipment for splitting service active node |
| CN116645068A (en) * | 2023-07-21 | 2023-08-25 | 三峡高科信息技术有限责任公司 | Flow processing system and method supporting conditional cycle node |
| CN116645068B (en) * | 2023-07-21 | 2023-10-20 | 三峡高科信息技术有限责任公司 | Flow processing system and method supporting conditional cycle node |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106775632B (en) | High-performance geographic information processing method and system with flexibly-expandable business process | |
| Bessai et al. | Bi-criteria workflow tasks allocation and scheduling in cloud computing environments | |
| Bastos et al. | Extending UML activity diagram for workflow modeling in production systems | |
| CN105959401B (en) | A kind of manufacturing service supply-demand mode and dynamic dispatching method based on super-network | |
| CN108037919A (en) | A kind of visualization big data workflow configuration method and system based on WEB | |
| CN105574705A (en) | Priority rule-based workflow transfer mechanism | |
| CN101271405A (en) | Bidirectional grade gridding resource scheduling method based on QoS restriction | |
| Liang et al. | Dynamic service selection with QoS constraints and inter-service correlations using cooperative coevolution | |
| CN109636299A (en) | Node time limit mechanism based on workflow band | |
| CN105894186A (en) | Workflow circulation mechanism using multiple loose leaves | |
| US20120059938A1 (en) | Dimension-ordered application placement in a multiprocessor computer | |
| Alaidaros et al. | A theoretical framework for improving software project monitoring task of Agile Kanban method | |
| JP5988173B2 (en) | Application architecture design method, application architecture design system, and program | |
| He et al. | Modeling and analyzing the impact of authorization on workflow executions | |
| US8108868B2 (en) | Workflow execution plans through completion condition critical path analysis | |
| CN109214763A (en) | Workflow priority algorithm based on process | |
| Xu | A petri net-based hybrid heuristic scheduling algorithm for flexible manufacturing system | |
| CN109635988A (en) | Workflow preferentially circulates mechanism | |
| CN108665222A (en) | The preferential flow algorithm realized by workflow | |
| Dias et al. | Improving Many-Task computing in scientific workflows using P2P techniques | |
| Reuther et al. | Technical challenges of supporting interactive HPC | |
| CN107871228A (en) | Workflow editor based on loose-leaf configuration | |
| Kumar et al. | Min-parent: An effective approach to enhance resource utilization in cloud environment | |
| CN113190336B (en) | Workflow scheduling method and device based on directed acyclic graph layering | |
| Burkov et al. | The optimal distribution problem for teams of specialists |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190416 |