本文選題：工作流 + 任務(wù)分配策略��； 參考：《杭州電子科技大學(xué)》2016年碩士論文

【摘要】：近年來(lái),隨著計(jì)算機(jī)與通訊技術(shù)的快速發(fā)展,各企業(yè)更加注重使用高度集成的計(jì)算機(jī)軟件來(lái)進(jìn)行日常的生產(chǎn)及辦公,從而提高工作的效率和降低成本。而工作流技術(shù)順應(yīng)了以過(guò)程為中心的管理模式的發(fā)展趨勢(shì),因而得到了國(guó)內(nèi)外研究人員和產(chǎn)業(yè)界人士的廣泛重視。工作流通過(guò)預(yù)定義的一些規(guī)則,使文檔、信息或任務(wù)能夠在不同的執(zhí)行者之間傳遞、執(zhí)行。工作流的任務(wù)分配策略是在工作流實(shí)例運(yùn)行時(shí),對(duì)其中待執(zhí)行的任務(wù)分配具體的執(zhí)行者,良好的任務(wù)分配策略能夠提高工作流系統(tǒng)的性能,因此研究如何實(shí)現(xiàn)對(duì)工作流任務(wù)分配方法的優(yōu)化,具有十分重要的現(xiàn)實(shí)意義。為了實(shí)現(xiàn)對(duì)工作流任務(wù)分配問(wèn)題的優(yōu)化,本文綜合考慮工作流實(shí)例中任務(wù)候選執(zhí)行者的能力,負(fù)載,任務(wù)間的交互性以及候選執(zhí)行者間的協(xié)作相容性等要素,研究了一種基于協(xié)作相容性的、負(fù)載均衡式任務(wù)分配模型,以及在此基礎(chǔ)上給出了基于協(xié)作相容性與負(fù)載均衡的任務(wù)分配算法,通過(guò)最大化全局交互任務(wù)執(zhí)行者的協(xié)作相容性的措施,尋求在滿足執(zhí)行者負(fù)載相對(duì)均衡的同時(shí),提高工作流的整體性能。本文具體工作如下:首先,文章根據(jù)對(duì)工作流任務(wù)分配問(wèn)題的現(xiàn)有研究進(jìn)行了分析,針對(duì)任務(wù)分配過(guò)程中可能存在的負(fù)載不均衡問(wèn)題,進(jìn)行了深入的研究,提出了假設(shè)任務(wù)以泊松過(guò)程分配執(zhí)行者時(shí)兩種負(fù)載均衡的任務(wù)分配模型。在此基礎(chǔ)上,給出了兩種負(fù)載均衡的任務(wù)分配算法和時(shí)間復(fù)雜度分析。其次,通過(guò)一個(gè)簡(jiǎn)單的醫(yī)療索賠流程的分析,引入了執(zhí)行者間協(xié)作相容性對(duì)任務(wù)分配影響的內(nèi)容。在此基礎(chǔ)上,進(jìn)一步考慮執(zhí)行者當(dāng)前的任務(wù)負(fù)載,提出了基于協(xié)作相容性的、負(fù)載均衡式任務(wù)分配模型,并給出了該模型算法的具體實(shí)現(xiàn),用以提高整個(gè)流程實(shí)例的執(zhí)行效率,并優(yōu)化執(zhí)行者間的負(fù)載均衡。為了對(duì)該算法的高效性進(jìn)行分析,我們提出了一個(gè)單目標(biāo)的任務(wù)分配算法,即最大化協(xié)作相容性算法。由于執(zhí)行者之間的協(xié)作相容性涉及到個(gè)人的隱私,因此本文通過(guò)對(duì)歷史日志中協(xié)作執(zhí)行流程實(shí)例信息的挖掘,設(shè)計(jì)了一種計(jì)算執(zhí)行者協(xié)作相容的公式,具有一定的合理性和適用性。最后,文章對(duì)所提出的幾種任務(wù)分配算法分別進(jìn)行了相應(yīng)的實(shí)現(xiàn)和仿真實(shí)驗(yàn),并將得到的各種實(shí)驗(yàn)的數(shù)據(jù)結(jié)果進(jìn)行了比較詳細(xì)的分析、對(duì)比等。同時(shí)說(shuō)明本文最后所提出的基于協(xié)作相容性的負(fù)載均衡任務(wù)分配方法,相較于其他幾種算法,在很大程度上減少了工作流實(shí)例的平均完成時(shí)間、平均處理時(shí)間以及執(zhí)行者的負(fù)載均衡性,提高了工作流系統(tǒng)的整體性能。
[Abstract]:In recent years, with the rapid development of computer and communication technology, enterprises pay more attention to the use of highly integrated computer software for daily production and office, thereby improving the efficiency of work and reducing costs. Workflow technology conforms to the development trend of process-centered management model, so it has been widely paid attention to by researchers and industry people at home and abroad. Workflow allows documents, information, or tasks to be passed and executed between different executors through predefined rules. The task allocation strategy of workflow is to assign specific executors to the tasks to be executed while the workflow instance is running. A good task assignment strategy can improve the performance of workflow system. Therefore, it is of great practical significance to study how to optimize the task allocation method of workflow. In order to optimize the task assignment of workflow, this paper comprehensively considers the ability, load, interactivity among tasks and the compatibility of candidate executors in workflow instance. In this paper, a load balancing task allocation model based on collaboration compatibility is studied, and a task allocation algorithm based on collaboration compatibility and load balancing is presented. By maximizing the cooperative compatibility of the global interactive task executors, we seek to improve the overall performance of the workflow while satisfying the relative balance of the executor's load. The specific work of this paper is as follows: firstly, according to the existing research on workflow task allocation, the paper makes a deep research on the possible load imbalance in the task allocation process. Two load balancing task allocation models are proposed, which assume that the task is assigned to the executor by the Poisson process. On this basis, two load balancing task allocation algorithms and time complexity analysis are presented. Secondly, through the analysis of a simple medical claim process, the content of the effect of the cooperation compatibility between the executors on the task assignment is introduced. On the basis of this, considering the current task load of the executor, this paper proposes a cooperative compatible, load-balanced task allocation model, and gives the concrete implementation of the model algorithm to improve the execution efficiency of the whole process instance. And optimize the load balance between the executors. In order to analyze the efficiency of the algorithm, we propose a single objective task assignment algorithm, that is, maximization of coordination compatibility algorithm. Because the compatibility of cooperation between executors involves the privacy of individuals, this paper designs a formula to calculate the compatibility of cooperation between executors by mining the instance information of collaborative execution process in the history log. It has certain rationality and applicability. Finally, the paper carries on the corresponding realization and the simulation experiment to several kinds of task assignment algorithms proposed, and carries on the detailed analysis, the contrast and so on to the obtained each kind of experiment data result. At the end of this paper, the load balancing task allocation method based on collaboration compatibility is presented. Compared with other algorithms, it reduces the average completion time of workflow instance to a great extent. The average processing time and the load balance of the executor improve the overall performance of the workflow system.
【學(xué)位授予單位】：杭州電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP301.6

【引證文獻(xiàn)】

相關(guān)期刊論文 前1條

1 尹薇婷;;基于任務(wù)和用戶屬性的工作流任務(wù)分配算法研究[J];通訊世界;2017年10期

，

本文編號(hào)：1934634