A p-time hybrid Petri net model for the scheduling problem of workflow management systems

Julia, Stéphane; Oliveira, Fernanda Francielle de

doi:10.1109/icsmc.2004.1401315

Cited by 9 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If it is supposed that in the "Handle Complaint Process", presented in [6] an employee of the Complaint Department is used to treat the activities "Contact-Client", "ContactDepartment" and "Send-Letter". The example of discrete In this figure, it is clear that if the token in R D is used to realize the activity A 2 , then the activities A 3 and A 7 could only be initiated after the end of activity A 2 .…”

Section: Discrete Resource Allocation Mechanismmentioning

confidence: 99%

See 1 more Smart Citation

Fuzzy Continuous Resource Allocation Mechanisms in Workflow Management Systems

Jeske

Julia

Valette

2006

2006 IEEE International Conference on Information Reuse &Amp;amp; Integration

View full text Add to dashboard Cite

In this paper, an approach based on a fuzzy hybrid Petri net model is proposed to solve the resource allocation problem of Workflow Management Systems. Hybrid resource allocation mechanisms are modeled by hybrid Petri net with discrete transitions where discrete resources represent equipment and continuous resources represent employees availability. To express in a more realistic way the resource allocation mechanisms when human behavior is considered, fuzzy sets delimited by possibility distributions of the triangular form are associated with the marking of the places which represent human availability. New firing rules and the fuzzy marking evolution of the new model are defined. Such a fuzzy resource allocation model is applied to an example of resource allocation mechanism of a "Handle Complaint Process".

show abstract

Section: Discrete Resource Allocation Mechanismmentioning

confidence: 99%

“…In [6], an approach based on a p-time hybrid Petri net model was proposed to solve the scheduling problem of Workflow Management Systems. In particular, the proposed approach used a Hybrid Petri net [3] with discrete transitions to model hybrid resource allocation mechanisms.…”

Section: Introductionmentioning

confidence: 99%

Fuzzy Continuous Resource Allocation Mechanisms in Workflow Management Systems

Jeske

Julia

Valette

2006

2006 IEEE International Conference on Information Reuse &Amp;amp; Integration

View full text Add to dashboard Cite

show abstract

“…Terminology of Timed Transition PN As a graphical and mathematical tool, PN provides a uniform environment for process modeling, formal analysis, and design of discrete event systems [10,11]. It also provides a good platform for process scheduling [4,[7][8][9][12][13][14][15].…”

Section: Timed Pn Based Modeling For Scheduling Problem Of the Htmentioning

confidence: 99%

Scheduling a Life Science High-Throughput Platform under Starvation Constraints Using Timed Transition Petri Nets and Heuristic Search

Hong

Chow

Haaland

et al. 2007

2007 IEEE International Symposium on Industrial Electronics

View full text Add to dashboard Cite

High-Throughput (HT) platforms have been increasingly used in the life science area for diverse bio-chemical experiments. This paper addresses the scheduling of HT platform based experiments under multiple constraints, such as operation constraints, resource constraints and starvation constraints. We use timed transition Petri nets (PN) to model the experimental process with constraints. We first propose the transition variant property of the PN model. We then propose the HCH (Hong-Chow-Haaland) algorithm, which is customized from A* algorithm, to find a feasible solution. HCH algorithm is more efficient than L1 algorithm and most other A* extended algorithms in identification of new markings when applied to the transition variant PN. We then applied HCH algorithm to two typical HT processes. The results show that HCH algorithm can be used to find optimal solutions with the time complexity of identifying new markings less than 2% of the L1 algorithm. which fulfills the starvation constraint because 6 J starts right after 5 J is completed. Since only one job can be operated at a time due to the resource constraint, the minimum operation time for the whole experiment should be the sum of all the jobs' operation time. The result shows that the total time of this schedule is equal to the minimum operation time (15 time units), which means that the scheduling result is an optimal solution with the objective of minimizing the operation time.J stands for the bth job in the ath process. For example, 2.6 J means the 6th job (culture cells) in process 2. The jobs operating sequence is:

show abstract

“…So it is impossible to using traditional static scheduling solution simplicity to adopt the requirement of production. Logic [7] , Petri Net [8] are used to deal with workflow scheduling usually. Literature [9] [10] based on comprehensive evaluation method, selected appropriate resources for the allocation of resources one by one.…”

Section: Introductionmentioning

confidence: 99%

A Dynamic Scheduling Algorithm Based Cost Compensation for Service-Workflows

Zhang

2014

AMM

View full text Add to dashboard Cite

Scheduling the workflow in a dynamic environment is an important issues for actual application because of service resources changed dynamically . In this paper, a cost-compensation-based dynamic scheduling algorithm (CCDSA) is constructed for the dynamic service-workflows. Related rules are defined, local re-scheduling workflow is performed by judging the influence range of abnormal nodes. Comparing CCDSA with HPSO, experimental results show that CCDSA obtains satisfied solutions, and has good adaptability and stability.

show abstract

A p-time hybrid Petri net model for the scheduling problem of workflow management systems

Cited by 9 publications

References 5 publications

Fuzzy Continuous Resource Allocation Mechanisms in Workflow Management Systems

Fuzzy Continuous Resource Allocation Mechanisms in Workflow Management Systems

Scheduling a Life Science High-Throughput Platform under Starvation Constraints Using Timed Transition Petri Nets and Heuristic Search

A Dynamic Scheduling Algorithm Based Cost Compensation for Service-Workflows

Contact Info

Product

Resources

About