TWI710980B - Process management device and process management method - Google Patents

Process management device and process management method Download PDF

Info

Publication number
TWI710980B
TWI710980B TW108145248A TW108145248A TWI710980B TW I710980 B TWI710980 B TW I710980B TW 108145248 A TW108145248 A TW 108145248A TW 108145248 A TW108145248 A TW 108145248A TW I710980 B TWI710980 B TW I710980B
Authority
TW
Taiwan
Prior art keywords
sequence
task
processes
task information
deadline
Prior art date
Application number
TW108145248A
Other languages
Chinese (zh)
Other versions
TW202123105A (en
Inventor
賴瓊惠
朱邦弘
Original Assignee
中華電信股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 中華電信股份有限公司 filed Critical 中華電信股份有限公司
Priority to TW108145248A priority Critical patent/TWI710980B/en
Application granted granted Critical
Publication of TWI710980B publication Critical patent/TWI710980B/en
Publication of TW202123105A publication Critical patent/TW202123105A/en

Links

Images

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A process management device and a process management method are provided. The process management method includes: generating, according to historical task information, a sequential rule corresponding to the historical task information; collecting task information of an unfinished task; configuring, according to the historical task information, a deadline of the unfinished task in response to a plurality of processes corresponding to the task information matching the sequential rule.

Description

流程管理裝置和流程管理方法Process management device and process management method

本發明是有關於一種電子裝置和方法，且特別是有關於一種流程管理裝置和流程管理方法。The present invention relates to an electronic device and method, and particularly relates to a process management device and process management method.

若一任務的流程都是由相同的部門單位執行時，則管理該任務的流程並不困難。然而，若該任務的流程需由跨部門單位執行時，該任務的流程將難以追蹤。另一方面，若任務的流程都是由經辦人員口頭傳承時，若發生組織重整或人員離退等事件時，不同部門之間的任務銜接將很容易出錯，並且在客戶詢問任務進度時，客服人員也需與每一位任務的經辦人員進行確認，方能確認任務進度。此外，一般來說，每個任務的截止期限都是在任務一開始時就配置的。因此，一旦發生突發事件而導致任務的工期逾時，用來管理流程的系統仍會向該任務的每一位經辦人員發出逾期通知。如此頻繁地發送逾期通知給尚無法執行該份任務的經辦人員，將會導致該些經辦人員對逾期通知感到疲乏而選擇忽略逾期通知。If the process of a task is executed by the same department unit, it is not difficult to manage the process of the task. However, if the process of the task needs to be executed by a cross-departmental unit, the process of the task will be difficult to track. On the other hand, if the task process is passed on verbally by the handling staff, if an event such as organizational reorganization or staff resignation occurs, the connection of tasks between different departments will be prone to errors, and when the customer asks about the task progress , The customer service staff also need to confirm with each task handler to confirm the task progress. In addition, generally speaking, the deadline for each task is configured at the beginning of the task. Therefore, in the event of an emergency that causes the task's deadline to expire, the system used to manage the process will still issue an overdue notification to every person handling the task. Sending overdue notices so frequently to the handling staff who cannot perform the task will cause these handling staff to become tired of the overdue notice and choose to ignore the overdue notice.

有鑑於此，本發明提供一種流程管理裝置和流程管理方法，可有效地管理需由跨部門單位執行的任務的流程。In view of this, the present invention provides a process management device and a process management method, which can effectively manage the process of tasks that need to be performed by cross-departmental units.

本發明的流程管理裝置，包括處理器、儲存媒體以及收發器。儲存媒體儲存歷史任務資訊以及多個模組。處理器耦接儲存媒體和收發器，並且存取和執行多個模組，其中多個模組包括運算模組以及任務收集模組。運算模組根據歷史任務資訊產生對應於歷史任務資訊的次序規則。任務收集模組通過收發器收集未完成任務的任務資訊，其中運算模組響應於對應於任務資訊的多個流程與次序規則匹配而根據歷史任務資訊配置未完成任務的截止期限。The process management device of the present invention includes a processor, a storage medium and a transceiver. The storage medium stores historical task information and multiple modules. The processor is coupled to the storage medium and the transceiver, and accesses and executes a plurality of modules, wherein the plurality of modules include a computing module and a task collection module. The calculation module generates sequence rules corresponding to the historical task information according to the historical task information. The task collection module collects task information of the uncompleted tasks through the transceiver, wherein the computing module configures the deadline of the uncompleted tasks according to the historical task information in response to a plurality of processes corresponding to the task information and sequence rule matching.

在本發明的一實施例中，上述的歷史任務資訊關聯於未在預定截止期限內完成的第一歷史任務資訊和第二歷史任務資訊。In an embodiment of the present invention, the aforementioned historical task information is associated with the first historical task information and the second historical task information that are not completed within a predetermined deadline.

在本發明的一實施例中，上述的第一歷史任務資訊包括由多個第一流程組成的第一序列，第二歷史任務資訊包括由多個第二流程組成的第二序列，其中運算模組根據第一序列和第二序列產生次序規則。In an embodiment of the present invention, the above-mentioned first historical task information includes a first sequence composed of a plurality of first processes, and the second historical task information includes a second sequence composed of a plurality of second processes, wherein the calculation modulus The group generates order rules according to the first sequence and the second sequence.

在本發明的一實施例中，上述的運算模組響應於第一序列和第二序列的前n個流程相同而刪除第一序列和第二序列的前m*n個流程以產生第三序列和第四序列，根據第三序列和第四序列產生第二次序規則，並且將前m*n個流程加入第二次序規則中的多個序列的每一者以產生次序規則，其中n為正整數並且m為大於或等於0但小於或等於1的分數。In an embodiment of the present invention, the above-mentioned arithmetic module deletes the first m*n processes of the first sequence and the second sequence to generate the third sequence in response to the first n processes of the first sequence and the second sequence being the same And the fourth sequence, generate the second order rule according to the third sequence and the fourth sequence, and add the first m*n processes to each of the multiple sequences in the second order rule to generate the order rule, where n is positive An integer and m is a fraction greater than or equal to 0 but less than or equal to 1.

在本發明的一實施例中，上述的運算模組根據R語言的序列樣式探勘函數產生次序規則。In an embodiment of the present invention, the aforementioned arithmetic module generates order rules according to the sequence pattern exploration function of the R language.

在本發明的一實施例中，上述的對應於次序規則的最大序列長度關聯於次序規則中的多個序列的平均長度，並且對應於次序規則的最小序列長度關聯於平均長度減去預設值。In an embodiment of the present invention, the aforementioned maximum sequence length corresponding to the order rule is associated with the average length of multiple sequences in the order rule, and the minimum sequence length corresponding to the order rule is associated with the average length minus the preset value .

在本發明的一實施例中，上述的歷史任務資訊包括關聯於多個序列的序列資訊，其中序列資訊包括分別對應於多個序列的多個實際截止期限以及多個序列長度，其中運算模組基於分類演算法而根據多個實際截止期限以及多個序列長度將多個序列分群以產生分群結果，其中運算模組根據分群結果配置截止期限。In an embodiment of the present invention, the aforementioned historical task information includes sequence information associated with a plurality of sequences, wherein the sequence information includes a plurality of actual deadlines and a plurality of sequence lengths corresponding to the plurality of sequences, and the calculation module Based on the classification algorithm, the multiple sequences are grouped according to multiple actual deadlines and multiple sequence lengths to generate a grouping result, wherein the computing module configures the deadline according to the grouping result.

在本發明的一實施例中，上述的多個模組包括告警模組。告警模組響應於未完成任務未在截止期限前完成而通過收發器發出告警訊息。In an embodiment of the present invention, the aforementioned multiple modules include an alarm module. The alarm module sends an alarm message through the transceiver in response to the unfinished task not being completed before the deadline.

在本發明的一實施例中，上述的多個模組包括查詢模組。查詢模組響應於通過收發器接收到請求訊息而通過收發器發送出包括截止期限的回應訊息。In an embodiment of the present invention, the aforementioned multiple modules include a query module. In response to receiving the request message through the transceiver, the query module sends a response message including the deadline through the transceiver.

本發明的流程管理方法，包括：根據歷史任務資訊產生對應於歷史任務資訊的次序規則；收集未完成任務的任務資訊；以及響應於對應於任務資訊的多個流程與次序規則匹配而根據歷史任務資訊配置未完成任務的截止期限。The process management method of the present invention includes: generating sequence rules corresponding to historical task information based on historical task information; collecting task information of unfinished tasks; and responding to the matching of multiple processes and sequence rules corresponding to task information based on historical tasks The deadline for the unfinished task of information allocation.

基於上述，本發明的流程管理裝置和流程管理方法可根據任務的執行狀況動態地調整任務的截止期限，提供任務的經辦人員可信賴的工期管理參考，並且避免在任務逾時產生大量非必要的告警訊息給還無法執行該任務的經辦人員。Based on the above, the process management device and process management method of the present invention can dynamically adjust the deadline of the task according to the execution status of the task, provide a reliable time management reference for the task handler, and avoid a large number of unnecessary tasks when the task is overtime. The warning message is given to the handling staff who cannot perform the task.

圖1根據本發明的實施例繪示一種流程管理裝置100的示意圖。流程管理裝置100包括處理器110、儲存媒體120以及收發器130。FIG. 1 illustrates a schematic diagram of a process management apparatus 100 according to an embodiment of the present invention. The process management apparatus 100 includes a processor 110, a storage medium 120, and a transceiver 130.

處理器110例如是中央處理單元（central processing unit，CPU），或是其他可程式化之一般用途或特殊用途的微控制單元（micro control unit，MCU）、微處理器（microprocessor）、數位信號處理器（digital signal processor，DSP）、可程式化控制器、特殊應用積體電路（application specific integrated circuit，ASIC）、圖形處理器（graphics processing unit，GPU）、算數邏輯單元（arithmetic logic unit，ALU）、複雜可程式邏輯裝置（complex programmable logic device，CPLD）、現場可程式化邏輯閘陣列（field programmable gate array，FPGA）或其他類似元件或上述元件的組合。處理器110可耦接至儲存媒體120以及收發器130，並且存取和執行儲存於儲存媒體120中的多個模組和各種應用程式。The processor 110 is, for example, a central processing unit (CPU), or other programmable general-purpose or special-purpose micro control unit (MCU), microprocessor, or digital signal processing DSP (digital signal processor, DSP), programmable controller, application specific integrated circuit (ASIC), graphics processing unit (GPU), arithmetic logic unit (ALU) , Complex programmable logic device (CPLD), field programmable gate array (FPGA) or other similar components or combinations of the above components. The processor 110 may be coupled to the storage medium 120 and the transceiver 130, and access and execute multiple modules and various application programs stored in the storage medium 120.

儲存媒體120例如是任何型態的固定式或可移動式的隨機存取記憶體（random access memory，RAM）、唯讀記憶體（read-only memory，ROM）、快閃記憶體（flash memory）、硬碟（hard disk drive，HDD）、固態硬碟（solid state drive，SSD）或類似元件或上述元件的組合，而用於儲存可由處理器110執行的多個模組或各種應用程式。在本實施例中，儲存媒體120可儲存包括運算模組121、任務收集模組122、告警模組123以及查詢模組124等多個模組，其功能將於後續說明。The storage medium 120 is, for example, any type of fixed or removable random access memory (RAM), read-only memory (ROM), or flash memory (flash memory). , Hard disk drive (HDD), solid state drive (SSD) or similar components or a combination of the above components, which are used to store multiple modules or various application programs that can be executed by the processor 110. In this embodiment, the storage medium 120 can store multiple modules including a computing module 121, a task collection module 122, an alarm module 123, and a query module 124, the functions of which will be described later.

收發器130以無線或有線的方式傳送及接收訊號。收發器130還可以執行例如低噪聲放大、阻抗匹配、混頻、向上或向下頻率轉換、濾波、放大以及類似的操作。The transceiver 130 transmits and receives signals in a wireless or wired manner. The transceiver 130 may also perform operations such as low noise amplification, impedance matching, frequency mixing, up or down frequency conversion, filtering, amplification and the like.

圖2根據本發明的實施例繪示一種流程管理方法的流程圖，其中所述流程管理方法可由如圖1所示的流程管理裝置100實施。FIG. 2 shows a flowchart of a process management method according to an embodiment of the present invention, wherein the process management method can be implemented by the process management apparatus 100 shown in FIG. 1.

在步驟S210中，運算模組121可根據歷史任務資訊產生對應於歷史任務資訊的次序規則（sequential rule）。參照圖3，圖3根據本發明的實施例繪示流程管理方法的步驟S210的流程圖。In step S210, the arithmetic module 121 may generate a sequential rule corresponding to the historical task information according to the historical task information. Referring to FIG. 3, FIG. 3 illustrates a flowchart of step S210 of a process management method according to an embodiment of the present invention.

在步驟S211中，任務收集模組122可通過收發器130取得包括多個序列的序列資訊的歷史任務資訊，其中歷史任務資訊可被儲存於儲存媒體120之中。舉例來說，任務收集模組122可通過收發器130從各種部門單位的資訊系統中取得該些部門單位曾經執行過的任務記錄。運算模組121可先將該些任務記錄轉換為NoSQL格式並將任務記錄儲存於儲存媒體120之中。In step S211, the task collection module 122 can obtain historical task information including sequence information of a plurality of sequences through the transceiver 130, wherein the historical task information can be stored in the storage medium 120. For example, the task collection module 122 can obtain the records of the tasks that have been performed by the departments and units from the information systems of the departments and units through the transceiver 130. The computing module 121 can first convert the task records into NoSQL format and store the task records in the storage medium 120.

以表1為例，表1記載了NoSQL格式的任務記錄。NoSQL格式的任務記錄記載了一客戶曾經執行過的任務的多個流程，並記載了每個流程的下一流程所需使用到的外部系統。流程管理裝置100只有在輪到一外部系統開始執行任務中的流程時，才會通過收發器130通知該外部系統，從而省去每個外部系統的介接成本。另一方面，NoSQL格式的任務記錄還具有易於擴充的優點。舉例來說，若運算模組121欲新增一「流控序號」欄位於表1的任務記錄中，運算模組121僅需將「流控序號」的文字編輯進表1的任務記錄即可完成。完成後的任務記錄如表2所示。 表1 任務名稱 截止期限 任務進度 客戶名稱或證號 客戶號碼所屬營運處 … 流程名稱 流程所使用的外部系統 下一流程名稱 下一流程所使用的外部系統 … 流程名稱 流程所使用的外部系統 下一流程名稱 下一流程所使用的外部系統 … 表2 任務名稱 截止期限 任務進度 客戶名稱或證號 客戶號碼所屬營運處 流控序號 … 流程名稱 流程所使用的外部系統 下一流程名稱 下一流程所使用的外部系統 … 流程名稱 流程所使用的外部系統 下一流程名稱 下一流程所使用的外部系統 … Take Table 1 as an example. Table 1 records the task records in NoSQL format. The task record in NoSQL format records multiple processes of a task that a customer has performed, and records the external system used in the next process of each process. The process management apparatus 100 notifies an external system through the transceiver 130 only when it is the turn of an external system to start executing the process in the task, so as to save the interface cost of each external system. On the other hand, NoSQL format task records also have the advantage of being easy to expand. For example, if the calculation module 121 wants to add a "flow control serial number" column in the task record of Table 1, the calculation module 121 only needs to edit the text of the "flow control serial number" into the task record of Table 1. carry out. The completed task record is shown in Table 2. Table 1 Task name Deadline Task progress Customer name or certificate number Customer number Ownership... Process name External system used by the process Next process name External system used by the next process... Process name External system used by the process Next process name The external system used in the next process... Table 2 Task name Deadline Task progress Customer name or certificate number Customer number Ownership flow control serial number... Process name External system used by the process Next process name External system used by the next process... Process name Under the external system used by the process The external system used by one process name and the next process...

運算模組121可進一步將NoSQL格式的任務記錄轉換為歷史任務資訊。歷史任務資訊可被儲存於儲存媒體120之中。歷史任務資訊可包括例如關聯於多個序列的序列資訊，其中序列資訊可包括例如分別對應於該些序列的多個截止期限以及多個序列長度。The computing module 121 can further convert the NoSQL format task records into historical task information. The historical task information can be stored in the storage medium 120. The historical task information may include, for example, sequence information associated with multiple sequences, where the sequence information may include, for example, multiple deadlines and multiple sequence lengths respectively corresponding to the sequences.

具體來說，歷史任務資訊中的每一個序列代表曾經被執行過之任務的多個流程，且該些任務都是未在預定截止期限內完成的任務。序列長度代表流程的總數量。例如，若一任務共包括9個流程，則該任務的序列長度為9。截止期限代表一任務的工期長度。截止期限可由管理者依據經驗設定，但本發明不限於此。Specifically, each sequence in the historical task information represents multiple processes of tasks that have been executed, and these tasks are all tasks that have not been completed within a predetermined deadline. The sequence length represents the total number of processes. For example, if a task includes 9 processes, the sequence length of the task is 9. The deadline represents the duration of a task. The deadline can be set by the manager based on experience, but the present invention is not limited to this.

以表3為例，表3為記載了五個任務之歷史任務資訊的範例，其中序列欄位中的{A}、{B}、…、{I}等符號分別代表不同的流程，並且序列欄位越左邊的符號代表越早被執行的流程。 表3 任務索引 序列 序列長度 預定截止期限（天） 實際截止期限（天） 1 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 11 8 14 2 {A}{B}{C}{D}{E}{F}{E}{F}{E}{F}{G}{H}{I} 13 8 15 3 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 11 8 13 4 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} 16 8 23 5 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} 16 8 25 Take Table 3 as an example. Table 3 is an example of historical task information for five tasks. The symbols {A}, {B},..., {I} in the sequence field represent different processes, and the sequence The symbol on the left of the field represents the earlier the process is executed. table 3 Task index sequence Sequence length Scheduled deadline (days) Actual deadline (days) 1 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 11 8 14 2 {A}{B}{C}{D}{E}{F}{E}{F}{E}{F}{G}{H}{I} 13 8 15 3 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 11 8 13 4 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} 16 8 twenty three 5 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} 16 8 25

在步驟S212中，運算模組121可基於分類演算法而根據序列長度和實際截止期限對多個序列進行分群以產生分群結果。舉例來說，運算模組121可將如表3所示的序列長度和實際截止期限作為K-平均演算法（K-means clustering）的參數，以根據K-平均演算法將表3的序列分為兩個群組，如表4所示。運算模組121還可進一步計算出每一個群組的平均序列長度和平均實際截止期限，如表4所示。 表4 任務索引 序列 群組 平均序列長度 平均實際截止期限 1 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 1 11 14 2 {A}{B}{C}{D}{E}{F}{E}{F}{E}{F}{G}{H}{I} 3 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 4 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} 2 16 24 5 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} In step S212, the arithmetic module 121 may group the multiple sequences according to the sequence length and the actual deadline based on the classification algorithm to generate a grouping result. For example, the arithmetic module 121 can use the sequence length and the actual deadline as shown in Table 3 as the parameters of the K-means clustering algorithm to classify the sequences in Table 3 according to the K-means clustering algorithm. There are two groups, as shown in Table 4. The computing module 121 can further calculate the average sequence length and average actual deadline of each group, as shown in Table 4. Table 4 Task index sequence Group Average sequence length Average actual deadline 1 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 1 11 14 2 {A}{B}{C}{D}{E}{F}{E}{F}{E}{F}{G}{H}{I} 3 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 4 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I} 2 16 twenty four 5 {A}{B}{C}{D}{E}{F}{G}{A}{B}{C}{D}{E}{F}{G}{H}{I}

在步驟S213中，運算模組121判斷各個群組的多個序列的前n個流程是否相同，其中n為任意的正整數。若各個群組的多個序列的前n個流程相同，則進入步驟S214。若各個群組的多個序列的前n個流程不同，則進入步驟S215。在步驟S214中，運算模組121將各個群組的多個序列的前m*n個流程刪除，其中m為大於或等於0但小於或等於1的分數。以表4的群組1為例，假設m=1/2，則運算模組121可響應於表4中的群組1的多個序列的前8個流程（即：流程{A}、{B}、{C}、{D}、{E}、{F}、{E}和{F}）相同而刪除多個序列的前(1/2)*8=4個流程（即：流程{A}、{B}、{C}和{D}），從而產生如表5所示的經更新序列。 表5 任務索引 經更新序列 1 {E}{F}{E}{F}{G}{H}{I} 2 {E}{F}{E}{F}{E}{F}{G}{H}{I} 3 {E}{F}{E}{F}{G}{H}{I} In step S213, the calculation module 121 determines whether the first n processes of the multiple sequences of each group are the same, where n is any positive integer. If the first n processes of the multiple sequences of each group are the same, step S214 is entered. If the first n processes of the multiple sequences in each group are different, then step S215 is entered. In step S214, the calculation module 121 deletes the first m*n processes of the multiple sequences in each group, where m is a score greater than or equal to 0 but less than or equal to 1. Taking group 1 in Table 4 as an example, assuming m=1/2, the calculation module 121 can respond to the first 8 processes of the multiple sequences of group 1 in Table 4 (ie: processes {A}, { B}, {C}, {D}, {E}, {F}, {E} and {F}) are the same but delete the first (1/2)*8=4 processes of multiple sequences (ie: process {A}, {B}, {C}, and {D}), resulting in the updated sequence shown in Table 5. table 5 Task index Updated sequence 1 {E}{F}{E}{F}{G}{H}{I} 2 {E}{F}{E}{F}{E}{F}{G}{H}{I} 3 {E}{F}{E}{F}{G}{H}{I}

在步驟S215中，運算模組121可計算多個序列的最大序列長度以及最小序列長度，其中最大序列長度以及最小序列長度將被設定為R語言的序列樣式探勘（sequential pattern mining）函數的輸入參數。具體來說，運算模組121可根據如下述的方程式（1）計算出最大序列長度，並且根據如下述的方程式（2）計算出最小序列長度，其中X為多個序列的平均長度、n為如前所述的正整數、m為如前所述的大於或等於0但小於或等於1的分數並且

Figure 02_image001
為由使用者定義的正整數。在本實施例中，
Figure 02_image003
，但本發明不限於此。 最大序列長度
Figure 02_image005
…(1) 最小序列長度
Figure 02_image007
…(2) In step S215, the arithmetic module 121 can calculate the maximum sequence length and the minimum sequence length of the multiple sequences, where the maximum sequence length and the minimum sequence length will be set as input parameters of the sequence pattern mining function of the R language . Specifically, the arithmetic module 121 can calculate the maximum sequence length according to the following equation (1), and calculate the minimum sequence length according to the following equation (2), where X is the average length of multiple sequences, and n is The positive integer as described above, m is a fraction greater than or equal to 0 but less than or equal to 1, and
Figure 02_image001
It is a positive integer defined by the user. In this embodiment,
Figure 02_image003
, But the present invention is not limited to this. Maximum sequence length
Figure 02_image005
…(1) Minimum sequence length
Figure 02_image007
…(2)

以表4的群組1為例，運算模組121可根據方程式（1）和（2）計算出對應於群組1之序列的最大序列長度為11-(1/2)*8=7且最小序列長度為11-(1/2)*8-3=4。Taking group 1 in Table 4 as an example, the arithmetic module 121 can calculate the maximum sequence length corresponding to group 1 according to equations (1) and (2) as 11-(1/2)*8=7 and The minimum sequence length is 11-(1/2)*8-3=4.

在步驟S216中，運算模組121可根據R語言的序列樣式探勘函數產生次序規則。具體來說，運算模組121可將多個序列（或經更新序列（若步驟S214曾被執行））以及對應於多個序列的最大序列長度和最小序列長度等參數輸入至序列樣式探勘函數，藉以產生多個次序規則。In step S216, the arithmetic module 121 can generate sequence rules according to the sequence pattern exploration function of the R language. Specifically, the arithmetic module 121 can input multiple sequences (or updated sequences (if step S214 has been executed)) and parameters such as the maximum sequence length and minimum sequence length corresponding to the multiple sequences into the sequence pattern exploration function. To generate multiple order rules.

以表4的群組1為例，運算模組121可將對應於群組1的經更新序列（如表5所示）、最大序列長度（即：7）和最小序列長度（即：4）輸入至R語言的序列樣式探勘函數中，從而產生如表6所示的多個次序規則。 表6 次序規則序號 次序規則 1 {E}{F}{E}{F}{G}{H}{I} 2 {F}{E}{F}{G}{H}{I} 3 {E}{F}{F}{G}{H}{I} 4 {E}{E}{F}{G}{H}{I} 5 {E}{F}{E}{G}{H}{I} 6 {E}{F}{E}{F}{H}{I} 7 {E}{F}{E}{F}{G}{I} 8 {E}{F}{E}{F}{G}{H} 9 {F}{F}{G}{H}{I} 10 {F}{E}{G}{H}{I} 11 {E}{F}{G}{H}{I} 12 {E}{E}{G}{H}{I} 13 {F}{E}{F}{H}{I} 14 {E}{F}{F}{H}{I} 15 {E}{E}{F}{H}{I} 16 {E}{F}{E}{H}{I} 17 {F}{E}{F}{G}{I} 18 {E}{F}{F}{G}{I} 19 {E}{E}{F}{G}{I} 20 {E}{F}{E}{G}{I} 21 {E}{F}{E}{F}{I} 22 {F}{E}{F}{G}{H} 23 {E}{F}{F}{G}{H} 24 {E}{E}{F}{G}{H} 25 {E}{F}{E}{G}{H} 26 {E}{F}{E}{F}{H} 27 {E}{F}{E}{F}{G} 28 {F}{G}{H}{I} 29 {E}{F}{G}{I} 30 {E}{F}{G}{H} 31 {E}{E}{G}{I} 32 {F}{E}{F}{I} 33 {E}{F}{F}{I} 34 {E}{E}{F}{I} 35 {E}{F}{E}{I} 36 {F}{F}{G}{H} 37 {F}{E}{G}{H} 38 {E}{E}{G}{H} 39 {E}{G}{H}{I} 40 {F}{F}{H}{I} 41 {F}{E}{H}{I} 42 {E}{F}{H}{I} 43 {E}{E}{H}{I} 44 {F}{F}{G}{I} 45 {F}{E}{G}{I} 46 {F}{E}{F}{H} 47 {E}{F}{F}{H} 48 {E}{E}{F}{H} 49 {E}{F}{E}{H} 50 {F}{E}{F}{G} 51 {E}{F}{F}{G} 52 {E}{E}{F}{G} 53 {E}{F}{E}{G} 54 {E}{F}{E}{F} Taking group 1 in Table 4 as an example, the arithmetic module 121 can compare the updated sequence corresponding to group 1 (as shown in Table 5), the maximum sequence length (ie: 7) and the minimum sequence length (ie: 4) Input to the sequence pattern exploration function of R language to generate multiple sequence rules as shown in Table 6. Table 6 Sequence number Order rule 1 {E}{F}{E}{F}{G}{H}{I} 2 {F}{E}{F}{G}{H}{I} 3 {E}{F}{F}{G}{H}{I} 4 {E}{E}{F}{G}{H}{I} 5 {E}{F}{E}{G}{H}{I} 6 {E}{F}{E}{F}{H}{I} 7 {E}{F}{E}{F}{G}{I} 8 {E}{F}{E}{F}{G}{H} 9 {F}{F}{G}{H}{I} 10 {F}{E}{G}{H}{I} 11 {E}{F}{G}{H}{I} 12 {E}{E}{G}{H}{I} 13 {F}{E}{F}{H}{I} 14 {E}{F}{F}{H}{I} 15 {E}{E}{F}{H}{I} 16 {E}{F}{E}{H}{I} 17 {F}{E}{F}{G}{I} 18 {E}{F}{F}{G}{I} 19 {E}{E}{F}{G}{I} 20 {E}{F}{E}{G}{I} twenty one {E}{F}{E}{F}{I} twenty two {F}{E}{F}{G}{H} twenty three {E}{F}{F}{G}{H} twenty four {E}{E}{F}{G}{H} 25 {E}{F}{E}{G}{H} 26 {E}{F}{E}{F}{H} 27 {E}{F}{E}{F}{G} 28 {F}{G}{H}{I} 29 {E}{F}{G}{I} 30 {E}{F}{G}{H} 31 {E}{E}{G}{I} 32 {F}{E}{F}{I} 33 {E}{F}{F}{I} 34 {E}{E}{F}{I} 35 {E}{F}{E}{I} 36 {F}{F}{G}{H} 37 {F}{E}{G}{H} 38 {E}{E}{G}{H} 39 {E}{G}{H}{I} 40 {F}{F}{H}{I} 41 {F}{E}{H}{I} 42 {E}{F}{H}{I} 43 {E}{E}{H}{I} 44 {F}{F}{G}{I} 45 {F}{E}{G}{I} 46 {F}{E}{F}{H} 47 {E}{F}{F}{H} 48 {E}{E}{F}{H} 49 {E}{F}{E}{H} 50 {F}{E}{F}{G} 51 {E}{F}{F}{G} 52 {E}{E}{F}{G} 53 {E}{F}{E}{G} 54 {E}{F}{E}{F}

值得注意的是，若步驟S214曾被執行，則在步驟S216中，運算模組121還需進一步將在步驟S214被刪除的m*n個流程加回由序列樣式探勘函數所輸出的多個次序規則中。以表4的群組1為例，由於運算模組121曾在步驟S214中將流程{A}、{B}、{C}和{D}自群組1的多個序列之中刪除。因此，在步驟S216中，運算模組121還需進一步將流程{A}、{B}、{C}和{D}加回如表6所示的次序規則，從而產生如表7所示的次序規則。 表7 次序規則序號 次序規則 1 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 2 {A}{B}{C}{D}{F}{E}{F}{G}{H}{I} 3 {A}{B}{C}{D}{E}{F}{F}{G}{H}{I} 4 {A}{B}{C}{D}{E}{E}{F}{G}{H}{I} 5 {A}{B}{C}{D}{E}{F}{E}{G}{H}{I} 6 {A}{B}{C}{D}{E}{F}{E}{F}{H}{I} 7 {A}{B}{C}{D}{E}{F}{E}{F}{G}{I} 8 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H} 9 {A}{B}{C}{D}{F}{F}{G}{H}{I} 10 {A}{B}{C}{D}{F}{E}{G}{H}{I} 11 {A}{B}{C}{D}{E}{F}{G}{H}{I} 12 {A}{B}{C}{D}{E}{E}{G}{H}{I} 13 {A}{B}{C}{D}{F}{E}{F}{H}{I} 14 {A}{B}{C}{D}{E}{F}{F}{H}{I} 15 {A}{B}{C}{D}{E}{E}{F}{H}{I} 16 {A}{B}{C}{D}{E}{F}{E}{H}{I} 17 {A}{B}{C}{D}{F}{E}{F}{G}{I} 18 {A}{B}{C}{D}{E}{F}{F}{G}{I} 19 {A}{B}{C}{D}{E}{E}{F}{G}{I} 20 {A}{B}{C}{D}{E}{F}{E}{G}{I} 21 {A}{B}{C}{D}{E}{F}{E}{F}{I} 22 {A}{B}{C}{D}{F}{E}{F}{G}{H} 23 {A}{B}{C}{D}{E}{F}{F}{G}{H} 24 {A}{B}{C}{D}{E}{E}{F}{G}{H} 25 {A}{B}{C}{D}{E}{F}{E}{G}{H} 26 {A}{B}{C}{D}{E}{F}{E}{F}{H} 27 {A}{B}{C}{D}{E}{F}{E}{F}{G} 28 {A}{B}{C}{D}{F}{G}{H}{I} 29 {A}{B}{C}{D}{E}{F}{G}{I} 30 {A}{B}{C}{D}{E}{F}{G}{H} 31 {A}{B}{C}{D}{E}{E}{G}{I} 32 {A}{B}{C}{D}{F}{E}{F}{I} 33 {A}{B}{C}{D}{E}{F}{F}{I} 34 {A}{B}{C}{D}{E}{E}{F}{I} 35 {A}{B}{C}{D}{E}{F}{E}{I} 36 {A}{B}{C}{D}{F}{F}{G}{H} 37 {A}{B}{C}{D}{F}{E}{G}{H} 38 {A}{B}{C}{D}{E}{E}{G}{H} 39 {A}{B}{C}{D}{E}{G}{H}{I} 40 {A}{B}{C}{D}{F}{F}{H}{I} 41 {A}{B}{C}{D}{F}{E}{H}{I} 42 {A}{B}{C}{D}{E}{F}{H}{I} 43 {A}{B}{C}{D}{E}{E}{H}{I} 44 {A}{B}{C}{D}{F}{F}{G}{I} 45 {A}{B}{C}{D}{F}{E}{G}{I} 46 {A}{B}{C}{D}{F}{E}{F}{H} 47 {A}{B}{C}{D}{E}{F}{F}{H} 48 {A}{B}{C}{D}{E}{E}{F}{H} 49 {A}{B}{C}{D}{E}{F}{E}{H} 50 {A}{B}{C}{D}{F}{E}{F}{G} 51 {A}{B}{C}{D}{E}{F}{F}{G} 52 {A}{B}{C}{D}{E}{E}{F}{G} 53 {A}{B}{C}{D}{E}{F}{E}{G} 54 {A}{B}{C}{D}{E}{F}{E}{F} It is worth noting that if step S214 has been executed, in step S216, the computing module 121 needs to further add the m*n processes deleted in step S214 back to the multiple sequences output by the sequence pattern exploration function Rules. Take group 1 in Table 4 as an example, because the calculation module 121 has deleted the processes {A}, {B}, {C}, and {D} from the multiple sequences of group 1 in step S214. Therefore, in step S216, the arithmetic module 121 needs to further add the processes {A}, {B}, {C}, and {D} back to the sequence rules shown in Table 6, thereby generating the sequence rules shown in Table 7. Order rules. Table 7 Sequence number Order rule 1 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H}{I} 2 {A}{B}{C}{D}{F}{E}{F}{G}{H}{I} 3 {A}{B}{C}{D}{E}{F}{F}{G}{H}{I} 4 {A}{B}{C}{D}{E}{E}{F}{G}{H}{I} 5 {A}{B}{C}{D}{E}{F}{E}{G}{H}{I} 6 {A}{B}{C}{D}{E}{F}{E}{F}{H}{I} 7 {A}{B}{C}{D}{E}{F}{E}{F}{G}{I} 8 {A}{B}{C}{D}{E}{F}{E}{F}{G}{H} 9 {A}{B}{C}{D}{F}{F}{G}{H}{I} 10 {A}{B}{C}{D}{F}{E}{G}{H}{I} 11 {A}{B}{C}{D}{E}{F}{G}{H}{I} 12 {A}{B}{C}{D}{E}{E}{G}{H}{I} 13 {A}{B}{C}{D}{F}{E}{F}{H}{I} 14 {A}{B}{C}{D}{E}{F}{F}{H}{I} 15 {A}{B}{C}{D}{E}{E}{F}{H}{I} 16 {A}{B}{C}{D}{E}{F}{E}{H}{I} 17 {A}{B}{C}{D}{F}{E}{F}{G}{I} 18 {A}{B}{C}{D}{E}{F}{F}{G}{I} 19 {A}{B}{C}{D}{E}{E}{F}{G}{I} 20 {A}{B}{C}{D}{E}{F}{E}{G}{I} twenty one {A}{B}{C}{D}{E}{F}{E}{F}{I} twenty two {A}{B}{C}{D}{F}{E}{F}{G}{H} twenty three {A}{B}{C}{D}{E}{F}{F}{G}{H} twenty four {A}{B}{C}{D}{E}{E}{F}{G}{H} 25 {A}{B}{C}{D}{E}{F}{E}{G}{H} 26 {A}{B}{C}{D}{E}{F}{E}{F}{H} 27 {A}{B}{C}{D}{E}{F}{E}{F}{G} 28 {A}{B}{C}{D}{F}{G}{H}{I} 29 {A}{B}{C}{D}{E}{F}{G}{I} 30 {A}{B}{C}{D}{E}{F}{G}{H} 31 {A}{B}{C}{D}{E}{E}{G}{I} 32 {A}{B}{C}{D}{F}{E}{F}{I} 33 {A}{B}{C}{D}{E}{F}{F}{I} 34 {A}{B}{C}{D}{E}{E}{F}{I} 35 {A}{B}{C}{D}{E}{F}{E}{I} 36 {A}{B}{C}{D}{F}{F}{G}{H} 37 {A}{B}{C}{D}{F}{E}{G}{H} 38 {A}{B}{C}{D}{E}{E}{G}{H} 39 {A}{B}{C}{D}{E}{G}{H}{I} 40 {A}{B}{C}{D}{F}{F}{H}{I} 41 {A}{B}{C}{D}{F}{E}{H}{I} 42 {A}{B}{C}{D}{E}{F}{H}{I} 43 {A}{B}{C}{D}{E}{E}{H}{I} 44 {A}{B}{C}{D}{F}{F}{G}{I} 45 {A}{B}{C}{D}{F}{E}{G}{I} 46 {A}{B}{C}{D}{F}{E}{F}{H} 47 {A}{B}{C}{D}{E}{F}{F}{H} 48 {A}{B}{C}{D}{E}{E}{F}{H} 49 {A}{B}{C}{D}{E}{F}{E}{H} 50 {A}{B}{C}{D}{F}{E}{F}{G} 51 {A}{B}{C}{D}{E}{F}{F}{G} 52 {A}{B}{C}{D}{E}{E}{F}{G} 53 {A}{B}{C}{D}{E}{F}{E}{G} 54 {A}{B}{C}{D}{E}{F}{E}{F}

回到圖2，在步驟S220中，任務收集模組122可通過收發器130收集未完成任務的任務資訊，其中任務資訊記載了至少一已完成流程及其對應的預定截止期限。以表8為例，表8記載了一未完成任務之任務資訊的態樣，其中流程{A}、{B}、{C}、{D}、{E}、{F}、{E}、{F}、{G}和{I}已經由先前的經辦人員完成，後面還有其他未知的未完成流程。 表8 未完成任務的序列 預定截止期限（天） 已完成流程 {A}{B}{C}{D}{E}{F}{E}{F}{G}{I} 8 Returning to FIG. 2, in step S220, the task collection module 122 may collect task information of uncompleted tasks through the transceiver 130, where the task information records at least one completed process and its corresponding predetermined deadline. Take Table 8 as an example. Table 8 records the status of the task information of an uncompleted task, in which processes {A}, {B}, {C}, {D}, {E}, {F}, {E} , {F}, {G} and {I} have been completed by the previous handling staff, and there are other unknown unfinished processes. Table 8 Sequence of unfinished tasks Scheduled deadline (days) Process completed {A}{B}{C}{D}{E}{F}{E}{F}{G}{I} 8

在步驟S230中，運算模組121可響應於對應於任務資訊的多個流程與次序規則匹配而根據歷史任務資訊配置未完成任務的截止期限。具體來說，運算模組121可將未完成任務的序列與次多個次序規則進行比較。若未完成任務的序列與一次序規則匹配，代表對應於該次序規則之截止期限可作為該未完成任務之截止期限的參考。在一實施例中，運算模組121可響應於未完成任務的序列與一次序規則匹配而根據對應於該次序規則之序列的分群結果來配置未完成任務的截止期限。以表8的未完成任務為例，運算模組121可將表8的未完成任務的序列與表7的多個次序規則進行比較，並且判斷未完成任務的序列與序號7的次序規則匹配。接著，運算模組121可根據對應於序號7的次序規則的截止期限來設定未完成任務的截止期限。由於表7的次序規則是根據如表4所示之群組1的多個序列而產生的，因此，運算模組121可將未完成任務的預定截止期限（即：8天）更新為如表4所示的群組1的平均實際截止期限（即：14天），如表9所示。 表9 未完成任務的序列 預定截止期限（天） 已完成流程 {A}{B}{C}{D}{E}{F}{E}{F}{G}{I} 14 In step S230, the arithmetic module 121 may configure the deadline of the uncompleted tasks according to the historical task information in response to the matching of multiple processes and sequence rules corresponding to the task information. Specifically, the arithmetic module 121 can compare the sequence of unfinished tasks with multiple order rules. If the sequence of uncompleted tasks matches the one-time sequence rule, the deadline corresponding to the sequence rule can be used as a reference for the deadline of the unfinished task. In an embodiment, the computing module 121 can configure the deadline of the uncompleted tasks according to the grouping result of the sequence corresponding to the sequence rule in response to the sequence of the unfinished tasks matching the one-time sequence rule. Taking the uncompleted tasks in Table 8 as an example, the arithmetic module 121 may compare the sequence of the uncompleted tasks in Table 8 with the multiple sequence rules in Table 7, and determine that the sequence of the unfinished tasks matches the sequence rule of sequence number 7. Then, the computing module 121 can set the deadline of the uncompleted tasks according to the deadline of the sequence rule corresponding to the sequence number 7. Since the order rule in Table 7 is generated based on the multiple sequences of Group 1 as shown in Table 4, the calculation module 121 can update the predetermined deadline (ie: 8 days) of uncompleted tasks as shown in Table 4 The average actual deadline of group 1 shown in 4 (ie: 14 days) is shown in Table 9. Table 9 Sequence of unfinished tasks Scheduled deadline (days) Process completed {A}{B}{C}{D}{E}{F}{E}{F}{G}{I} 14

步驟S230的執行時機可由多種不同的方式決定。在一實施例中，運算模組121可響應於當前時間與一未完成任務的截止期限小於預設值而執行步驟S230以更新該未完成任務的截止期限（即：重新配置預定截止期限）。舉例來說，使用者可設定預設值為3天。如此，若當前的時間與一未完成任務之截止期限之間的差異小於3天，運算模組121即可執行步驟S230以動態地更新該未完成任務的截止期限，自動地將截止期限展延。在一實施例中，運算模組121可響應於一未完成任務的流程已經發生延遲而執行步驟S230以更新該未完成任務的截止期限。舉例來說，若一未完成任務的截止期限為8天，並且該未完成任務實際已執行天數為5天，則運算模組121可執行步驟S230以更新該未完成任務的截止期限。The execution timing of step S230 can be determined in many different ways. In an embodiment, the calculation module 121 may execute step S230 to update the deadline of the uncompleted task (ie, reconfigure the predetermined deadline) in response to the current time and the deadline of an uncompleted task is less than a preset value. For example, the user can set the default value to 3 days. In this way, if the difference between the current time and the deadline of an uncompleted task is less than 3 days, the computing module 121 can execute step S230 to dynamically update the deadline of the uncompleted task, and automatically extend the deadline . In one embodiment, the computing module 121 may execute step S230 to update the deadline of the unfinished task in response to the delay in the process of an unfinished task. For example, if the deadline of an uncompleted task is 8 days, and the actual number of days that the uncompleted task has been executed is 5 days, the computing module 121 may perform step S230 to update the deadline of the uncompleted task.

在一實施例中，告警模組123可響應於未完成任務未在截止期限前完成而通過收發器130發出告警訊息給相關的經辦人員，藉以提示該些經辦人員加快該未完成任務的處理速度。舉例來說，告警模組123可通過簡訊通知各個經辦人員加快該未完成任務的處理速度。In one embodiment, the alarm module 123 may send an alarm message to the relevant handling personnel through the transceiver 130 in response to the uncompleted task not being completed before the deadline, so as to remind the handling personnel to speed up the unfinished task. Processing speed. For example, the alarm module 123 can notify each operator through a short message to speed up the processing of the unfinished task.

在一實施例中，查詢模組124可響應於通過收發器130接收到來自外部電子裝置（例如：客戶的終端裝置）的請求訊息而通過收發器130發送包括該請求訊息所欲查詢之任務的截止期限的回應訊息給該外部電子裝置。如此，客戶可隨時透過終端裝置查詢其申請之任務的執行進度。In one embodiment, the query module 124 may send a request message including the task to be queried by the request message through the transceiver 130 in response to receiving a request message from an external electronic device (such as a client's terminal device) through the transceiver 130 The deadline response message is sent to the external electronic device. In this way, the customer can check the execution progress of the task applied for through the terminal device at any time.

本發明運用文件導向資料庫的特點，能即時回應使用者流程的變動，不需額外的進行資料的擴充，即可實現資料的變動。The present invention uses the characteristics of the document-oriented database to respond to changes in user processes in real time, and can realize data changes without additional data expansion.

本發明運用非正規化的NoSQL儲存方式，在查詢時可加快跨單位資料的查詢速率，讓使用者能快速掌控流程。The present invention uses an informal NoSQL storage method to speed up the query rate of cross-unit data during query, so that users can quickly control the process.

本發明運用分群演算法將不同流程作分群，再運用大數據的數據挖掘（data mining）的次序規則挖掘（sequential rule discovery）技術，依不同群組特性及根據歷史任務資訊，能夠找出最佳的截止期限或完成天數，自動地調整相關工作的流程資料。The present invention uses a grouping algorithm to group different processes, and then uses the sequential rule discovery technology of big data data mining to find the best according to different group characteristics and historical task information The deadline or number of days to complete, automatically adjust the process data of related work.

本發明可應用在不同系統跨單位資料的整合，能即時掌控流程，並且進而自動調整流程。The invention can be applied to the integration of cross-unit data of different systems, can control the process in real time, and then automatically adjust the process.

本發明可建置一套依客戶證號為主，設備為輔的「客戶互動記錄與其設備維護紀錄樹」，客戶申辦/租用本公司設備開始，即成為一棵樹。如此能便利員工迅速了解各個案件，能從人工逐站詢問，改善至系統面查詢，協助人員可快速回應用戶查詢，有效縮短查詢時間。The present invention can build a set of "customer interaction record and equipment maintenance record tree" based on the customer's ID number and equipment as a supplement. The customer will become a tree when the customer applies for or rents the company's equipment. In this way, it is convenient for employees to quickly understand each case, from manual inquiries station by station, to improvements to system-based inquiries, and assisting personnel can quickly respond to user inquiries, effectively shortening the inquiry time.

客戶每件交付的任務，為一枝新樹枝，各分工單位依所訂時間完成所轄的流程，其過程全程透明，並且能透過簡訊通知進度，以提升用戶使用感受及黏著度。Each task delivered by the customer is a new branch, and each division of labor completes the process under its jurisdiction according to the set time. The process is transparent throughout, and the progress can be notified through text messages to improve user experience and adhesion.

本發明可降低客戶查詢進度或催修等次數，在協助樽節客服人力成本有很大的幫助。The present invention can reduce the number of times for customers to inquire about progress or reminding repairs, etc., and is of great help in assisting the customer service manpower cost.

綜上所述，本發明的流程管理裝置和流程管理方法可以達到資訊分享的高揭露性、流程快速掌握告警以及自動化調整截止期限的技術功效。具體來說，本發明可為客戶所申請的任務建立流程記錄。客戶可通過向流程管理裝置發出請求訊息來查詢該任務的狀況，客服人員或部門主管也能通過流程管理裝置迅速地掌握該任務的執行進度。若發生突發事件導致任務的工期逾時，則流程管理裝置可根據歷史任務資訊而動態地為當前的任務計算出最佳的工作天數，並且自動地展延當前任務的截止期限。如此，可顯著地減少非必要的告警訊息，使任務的經辦人員能更專注於手邊的工作。In summary, the process management device and process management method of the present invention can achieve the technical effects of high disclosure of information sharing, rapid process control and alarm, and automatic adjustment of deadlines. Specifically, the present invention can establish process records for tasks requested by customers. The customer can query the status of the task by sending a request message to the process management device, and the customer service staff or department heads can also quickly grasp the execution progress of the task through the process management device. If an emergency occurs that causes the task deadline to expire, the process management device can dynamically calculate the best working days for the current task based on historical task information, and automatically extend the deadline of the current task. In this way, unnecessary warning messages can be significantly reduced, so that the task handler can focus more on the task at hand.

100:流程管理裝置 110:處理器 120:儲存媒體 121:運算模組 122:任務收集模組 123:告警模組 124:查詢模組 130:收發器 S210、S211、S212、S213、S214、S215、S216、S220、S230:步驟 100: Process management device 110: processor 120: storage media 121: Computing Module 122: Task Collection Module 123: Alarm module 124: Query module 130: Transceiver S210, S211, S212, S213, S214, S215, S216, S220, S230: steps

圖1根據本發明的實施例繪示一種流程管理裝置的示意圖。 圖2根據本發明的實施例繪示一種流程管理方法的流程圖。 圖3根據本發明的實施例繪示流程管理方法的步驟的流程圖。 Fig. 1 illustrates a schematic diagram of a process management apparatus according to an embodiment of the present invention. Fig. 2 shows a flowchart of a process management method according to an embodiment of the present invention. Fig. 3 shows a flowchart of the steps of a process management method according to an embodiment of the present invention.

S210、S220、S230:步驟 S210, S220, S230: steps

Claims (5)

一種流程管理裝置，包括：收發器，用於傳送或接收訊號；儲存媒體，儲存歷史任務資訊以及多個模組，其中所述歷史任務資訊關聯於未在預定截止期限內完成的第一歷史任務資訊和第二歷史任務資訊，其中所述第一歷史任務資訊包括由多個第一流程組成的第一序列，其中所述第二歷史任務資訊包括由多個第二流程組成的第二序列，其中所述歷史任務資訊包括關聯於多個序列的序列資訊，其中所述序列資訊包括分別對應於所述多個序列的多個實際截止期限以及多個序列長度；以及處理器，耦接所述儲存媒體和所述收發器，並且存取和執行所述多個模組，其中所述多個模組包括：運算模組，基於分類演算法而根據所述多個實際截止期限以及所述多個序列長度將所述多個序列分群以產生分群結果，響應於所述第一序列和所述第二序列的前n個流程相同而刪除所述第一序列和所述第二序列的前m*n個流程以產生第三序列和第四序列，根據所述第三序列、所述第四序列以及序列樣式探勘函數產生第二次序規則，並且將所述前m*n個流程加入所述第二次序規則中的各個序列以產生次序規則，其中n為正整數並且m為大於或等於0但小於或等於1的分數；以及任務收集模組，通過所述收發器收集未完成任務的任務 資訊，其中所述運算模組響應與所述任務資訊相對應的多個流程與所述次序規則匹配而根據所述分群結果配置所述未完成任務的截止期限。 A process management device includes: a transceiver for transmitting or receiving signals; a storage medium for storing historical task information and a plurality of modules, wherein the historical task information is associated with a first historical task that is not completed within a predetermined deadline Information and second historical task information, wherein the first historical task information includes a first sequence composed of a plurality of first processes, and the second historical task information includes a second sequence composed of a plurality of second processes, The historical task information includes sequence information associated with a plurality of sequences, wherein the sequence information includes a plurality of actual deadlines and a plurality of sequence lengths respectively corresponding to the plurality of sequences; and a processor coupled to the Storage medium and the transceiver, and access and execute the plurality of modules, wherein the plurality of modules include: an arithmetic module, based on a classification algorithm based on the plurality of actual deadlines and the plurality of The sequence length groups the plurality of sequences to produce a grouping result, and the first m sequences of the first sequence and the second sequence are deleted in response to the first n processes of the first sequence and the second sequence being the same *n processes to generate a third sequence and a fourth sequence, generate a second order rule according to the third sequence, the fourth sequence and the sequence pattern exploration function, and add the first m*n processes to the Each sequence in the second order rule generates an order rule, where n is a positive integer and m is a score greater than or equal to 0 but less than or equal to 1; and a task collection module, which collects tasks that have not completed tasks through the transceiver Information, wherein the calculation module configures the deadline of the uncompleted task according to the grouping result in response to a plurality of processes corresponding to the task information matching the sequence rule. 如申請專利範圍第1項所述的流程管理裝置，其中對應於所述次序規則的最大序列長度關聯於與所述次序規則相對應的分群中的多個序列的平均長度，並且對應於所述次序規則的最小序列長度關聯於所述平均長度減去預設值。 The process management device according to the first item of the patent application, wherein the maximum sequence length corresponding to the sequence rule is associated with the average length of a plurality of sequences in the cluster corresponding to the sequence rule, and corresponds to the The minimum sequence length of the sequence rule is associated with the average length minus a preset value. 如申請專利範圍第1項所述的流程管理裝置，其中所述多個模組包括告警模組，所述告警模組響應於所述未完成任務未在所述截止期限前完成而通過所述收發器發出告警訊息。 The process management device according to item 1 of the scope of patent application, wherein the plurality of modules include an alarm module, and the alarm module passes the task in response to the uncompleted task not being completed before the deadline. The transceiver sends out an alarm message. 如申請專利範圍第1項所述的流程管理裝置，其中所述多個模組包括查詢模組，所述查詢模組響應於通過所述收發器接收到請求訊息而通過收發器發送出包括所述截止期限的回應訊息。 The process management device according to the first item of the patent application, wherein the plurality of modules include a query module, and the query module sends a request message through the transceiver including all Response message stating the deadline. 一種流程管理方法，適用於流程管理裝置，其中所述流程管理方法，包括：取得歷史任務資訊，其中所述歷史任務資訊關聯於未在預定截止期限內完成的第一歷史任務資訊和第二歷史任務資訊，其中所述第一歷史任務資訊包括由多個第一流程組成的第一序列，其中所述第二歷史任務資訊包括由多個第二流程組成的第二序列，其中所述歷史任務資訊包括關聯於多個序列的序列資訊，其中所 述序列資訊包括分別對應於所述多個序列的多個實際截止期限以及多個序列長度；基於分類演算法而根據所述多個實際截止期限以及所述多個序列長度將所述多個序列分群以產生分群結果；響應於所述第一序列和所述第二序列的前n個流程相同而刪除所述第一序列和所述第二序列的前m*n個流程以產生第三序列和第四序列，根據所述第三序列、所述第四序列以及序列樣式探勘函數產生第二次序規則，並且將所述前m*n個流程加入所述第二次序規則中的各個序列以產生次序規則，其中n為正整數並且m為大於或等於0但小於或等於1的分數；收集未完成任務的任務資訊；以及響應與所述任務資訊相對應的多個流程與所述次序規則匹配而根據所述分群結果配置所述未完成任務的截止期限。 A process management method suitable for a process management device, wherein the process management method includes: obtaining historical task information, wherein the historical task information is associated with the first historical task information and the second historical task that are not completed within a predetermined deadline Task information, wherein the first historical task information includes a first sequence composed of a plurality of first processes, wherein the second historical task information includes a second sequence composed of a plurality of second processes, wherein the historical task Information includes sequence information associated with multiple sequences, where The sequence information includes a plurality of actual deadlines and a plurality of sequence lengths respectively corresponding to the plurality of sequences; based on a classification algorithm, the plurality of sequences are classified according to the plurality of actual deadlines and the plurality of sequence lengths Grouping to generate a grouping result; in response to the first n processes of the first sequence and the second sequence being the same, deleting the first m*n processes of the first sequence and the second sequence to generate a third sequence And the fourth sequence, generate a second order rule according to the third sequence, the fourth sequence and the sequence pattern exploration function, and add the first m*n processes to each sequence in the second order rule to Generate sequence rules, where n is a positive integer and m is a score greater than or equal to 0 but less than or equal to 1; collect task information of uncompleted tasks; and respond to multiple processes corresponding to the task information and the sequence rule Match and configure the deadline of the uncompleted task according to the grouping result.
TW108145248A 2019-12-11 2019-12-11 Process management device and process management method TWI710980B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW108145248A TWI710980B (en) 2019-12-11 2019-12-11 Process management device and process management method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW108145248A TWI710980B (en) 2019-12-11 2019-12-11 Process management device and process management method

Publications (2)

Publication Number Publication Date
TWI710980B true TWI710980B (en) 2020-11-21
TW202123105A TW202123105A (en) 2021-06-16

Family

ID=74202451

Family Applications (1)

Application Number Title Priority Date Filing Date
TW108145248A TWI710980B (en) 2019-12-11 2019-12-11 Process management device and process management method

Country Status (1)

Country Link
TW (1) TWI710980B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI222018B (en) * 1998-12-22 2004-10-11 Indeliq Inc A goal based flow of control presentation system
CN101101653A (en) * 2006-06-06 2008-01-09 美国西门子医疗解决公司 Dynamic workflow scheduling
TWI647628B (en) * 2013-04-23 2019-01-11 柯法克斯股份有限公司 Method and system for leveraging location-based information to influence business workflows and computer program product
TW201933142A (en) * 2018-01-19 2019-08-16 中華電信股份有限公司 Frequent time-gap sequential pattern mining system and method
TWM585382U (en) * 2019-07-11 2019-10-21 賈伯科技有限公司 Smart shift scheduling system
TWM587309U (en) * 2019-06-11 2019-12-01 合作金庫商業銀行股份有限公司 Training Course Management System

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI222018B (en) * 1998-12-22 2004-10-11 Indeliq Inc A goal based flow of control presentation system
CN101101653A (en) * 2006-06-06 2008-01-09 美国西门子医疗解决公司 Dynamic workflow scheduling
TWI647628B (en) * 2013-04-23 2019-01-11 柯法克斯股份有限公司 Method and system for leveraging location-based information to influence business workflows and computer program product
TW201933142A (en) * 2018-01-19 2019-08-16 中華電信股份有限公司 Frequent time-gap sequential pattern mining system and method
TWM587309U (en) * 2019-06-11 2019-12-01 合作金庫商業銀行股份有限公司 Training Course Management System
TWM585382U (en) * 2019-07-11 2019-10-21 賈伯科技有限公司 Smart shift scheduling system

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
Eason [資料科學//Python學習/資料庫] & [拍片&剪片] :: 痞客邦 ::，"[R] 資料科學-序列樣式探勘分析(Sequential Pattern Mining)"，2017年7月13日，第1/5~5/5頁 *
Eason [資料科學//Python學習/資料庫] & [拍片&剪片] :: 痞客邦 ::，"[R] 資料科學-序列樣式探勘分析(Sequential Pattern Mining)"，2017年7月13日，第1/5~5/5頁。網址：https://to52016.pixnet.net/blog/post/343052527-%5Br%5D-資料科學-序列%28sequence%29分析。
布丁布丁吃布丁，"循序樣式探勘：以R的arulesSequences實作"，2017年1月14日，第1~17頁 *
布丁布丁吃布丁，"循序樣式探勘：以R的arulesSequences實作"，2017年1月14日，第1~17頁。網址：http://blog.pulipuli.info › 2017/01 › rarulessequences-sequential-pattern.html。
網址：http://blog.pulipuli.info › 2017/01 › rarulessequences-sequential-pattern.html *
網址：https://to52016.pixnet.net/blog/post/343052527-%5Br%5D-資料科學-序列%28sequence%29分析 *

Also Published As

Publication number Publication date
TW202123105A (en) 2021-06-16

Similar Documents

Publication Publication Date Title
CN109033387A (en) A kind of Internet of Things search system, method and storage medium merging multi-source data
CN111353693B (en) Work order dispatching, processing and analyzing system and method thereof
US20130318034A1 (en) Distributed processing of streaming data records
WO2022151668A1 (en) Data task scheduling method and apparatus, storage medium, and scheduling tool
AU2013371448A1 (en) System and method for distributed database query engines
CN107301196A (en) Method of data synchronization, device, equipment and monitoring server
CN108197909A (en) A kind of project process supervision control system
CN111553560A (en) Service index monitoring method, monitoring server and system
US20240195842A1 (en) Massively scalable computer platform using a distributed computational graph
US20160344808A1 (en) Device data synchronization
CN111400130A (en) Task monitoring method and device, electronic equipment and storage medium
CN110457371A (en) Data managing method, device, storage medium and system
US20220179850A1 (en) Code list builder
WO2023050779A1 (en) Quantity analysis method and apparatus for reservation service, device and storage medium
CN104424555B (en) For the control method and equipment in publish/subscribe system
WO2022237506A1 (en) Method, apparatus, and device for monitoring online diagnosis service, and storage medium
TWI710980B (en) Process management device and process management method
CN117112651A (en) Enterprise data quality assessment method and equipment
US20160342670A1 (en) Device data synchronization
CN113435615B (en) Intelligent reservation system for scanning image subject research project and using method
US20220229692A1 (en) Method and device for data task scheduling, storage medium, and scheduling tool
CN109582795B (en) Data processing method, device, system and medium based on full life cycle
WO2020151054A1 (en) Data synchronization method and apparatus
CN111475504A (en) Data management method and device
CN111128319A (en) Public health service management platform for disease prevention and control