工作流程管理已經被認為是一個企業成功的重要因素。基於合作夥伴 所提議的工作流程方案,公司是否能夠在截止日期或訂單時程內完成交付 而做出正確的決策,這對公司而言是很重要問題。本研究的目的是建立一 個有效的計算方法來分析時間的工作流程。許多研究指出派翠網路(Petri Nets)能夠充分表達工作流程的問題和解決複雜的時序分析問題。我們提出 一個時間性工作流程網路問題,而這個網路模型屬於工作流程網路中的特 殊問題。我們提出一個演算法來計算最早完成的時間,以及開發一個支援 已標準化派翠網路標記語言(Petri Net Markup Language, PNML)格式的工 具,來幫助工作流程管理中的決策工作。
Workflow management has been recognized as a significant issue to the success of an enterprise. How to estimate whether the workflow solution proposed by the partners can meet the due date or schedule of an order is critical for a company to make the right decision. The objective of this paper is to develop a computationally efficient algorithm to analyze the timing of workflows. As pointed out by many studies, the Petri net is able to fully express the configuration of workflows and solve the complicated timing analysis problems. We propose an algorithm to compute the earliest completion time for a class of timed workflow nets and develop a tool based on the standardized Petri net Markup Language (PNML) to support the decision-making in workflow management.