JP2006018529A - Workflow system, method for controlling it, program, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To calculate the expected time required for a process while taking the skill level of an operator and an increase or decrease in accumulated tasks over time into account, thus calculating the expected time with high precision even in the case of a large-scale workflow system. <P>SOLUTION: A workflow server 104 manages the processing status of the tasks generated from a business process having a plurality of nodes interconnected in a predetermined order as the process units of a workflow, causes a client 102 to retain previous process history information for each node, and calculates the required time to process the tasks generated from the business process, at any of the nodes forming the business process, by subtracting the total value of the required time to process the tasks generated at nodes upstream of that node from a value calculated on the basis of the number of tasks accumulated at the node and a history of previous processes at the node. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention provides a means for calculating a required time (actual process required time) for processing for each or for each node in a workflow system and automatically selecting and processing a fast processing node based on the calculated time. To do.

  In the workflow system, drafting processing is performed, and finally a matter is processed through a plurality of approval processes according to the business process. However, the drafter does not know when the matter (task) that he drafted will be finally processed. Furthermore, when a task is concentrated on a certain node in the middle of the process, there is a problem that the performance of the entire workflow process deteriorates because the task is not easily processed.

To solve this problem, the “workflow system with stay prevention function” in Patent Document 1 (Japanese Patent Application Laid-Open No. 2003-76823) calculates the work time until the task processing is completed based on the number and types of tasks reaching each worker. The idea of comparing the value with a set threshold and distributing the task to the set agent when it is exceeded is presented.
Japanese Patent Laid-Open No. 2003-76823

  However, in the above idea, the task time is simply calculated by multiplying the number of tasks and does not take into account the decrease in tasks due to the passage of time. For example, when there are nodes A-B-C and the work time is calculated when the task is at A, the work time of the nodes B and C is simply calculated by the number of tasks accumulated in the respective nodes. . However, in reality, since the nodes A-B-C are processed at the same time, the processing of the task in B advances and the number of tasks decreases by the time required for the processing of A. Similarly, the process of the task in C progresses for the node of C by the amount required for both the processes of A and B. For this reason, the error in the expected work time increases as the workflow system becomes larger with a large number of nodes and a large number of tasks. Since work time is a trigger for task distribution, the accuracy of the distribution function itself is greatly reduced (first problem).

  In addition, in the above idea, a substitute must be set in advance, and cannot be quickly handled when the substitute is on vacation or leaves the seat for a long time. In addition, in the organization, the supervisor may tell the subordinates the necessary work and work on behalf, but in the case of the above idea, if the system administrator does not set as a substitute, the work can not be done as a substitute , Can not respond flexibly (second problem).

  Furthermore, even when a task is distributed to an agent, according to the above idea, the determination can be performed only in the work time calculated from the number of tasks. Depending on the worker and the form, there is a case where it is desired to perform the processing by himself / herself without going through the agent. However, the above idea does not consider reflecting the will of the worker, and if the threshold is exceeded, the system always distributes it (third problem).

  In addition, when tasks are distributed to agents, the process configuration becomes complicated, making it difficult for the drafter to understand the time until the final processing of the task, making it impossible to perform scheduling and smooth business execution. (The fourth problem).

  The present invention has been made to solve the above-described problems. The present invention takes into account the increase / decrease in tasks due to the flow of time and the technical level of the worker, and the time required for the target node to process the task ( The first object is to solve the first problem by calculating the actual processing time) and distributing the task to the agent with the highest work efficiency from the calculated time.

  Further, the second object is to solve the second problem by timely detecting an optimal agent, assigning and executing tasks without setting an agent in advance in the server.

  Furthermore, in order to determine whether to distribute tasks, by using a file in which distribution conditions are set for each person in charge, tasks that reflect the will of the worker are distributed to solve the third problem. Is the third purpose.

  The fourth object is to solve the fourth problem by displaying the above-mentioned time required for actual processing together with a process map (shown in FIG. 12) at an arbitrary timing and informing the worker of the progress of the task. .

  The present invention provides a task management means for managing a processing status of a task generated from a business process in which a plurality of nodes as workflow processing units are combined in a predetermined order in a workflow system constituted by a client / server system, A processing history information storage unit that stores past processing history information for each node, and a processing time required for an arbitrary node forming the business process of a task generated from the business process is retained in the node. A calculation means for calculating by subtracting a total value of processing time required for the generated task at a node upstream from the node from a value calculated based on the number of tasks and the past processing history of the node; It is characterized by having.

  According to the present invention, since each client has processing history information having the skill information of the worker, even if the number of processes that can be handled by the worker increases or decreases, it is possible to cope with the server without any change.

  In addition, the estimated time required for processing is calculated by taking into account the increase and decrease of the accumulated task due to the skill level of the worker and the progress of time, and is used for task distribution. It is possible to calculate a high expected time, always perform the optimal task distribution, and improve the work efficiency of the workflow.

  Furthermore, in order to manage worker information between clients, the server sets a substitute agent in a timely manner based on the information. Therefore, it is not necessary to set a specific worker as an agent in advance, and a system configuration that can flexibly cope with increase / decrease in the worker and change in skill level is possible.

  In addition, since the operator can set in detail whether or not to substitute, slips that are not desired to be shown to a third party such as confidential documents are not distributed without permission, leading to improved security.

  Furthermore, by displaying the difference between the target time and the actual work time, it can be used as a judgment material for training human resources and reviewing the system configuration.

  In addition, since the expected time until the end of processing is known in a series of work workflows, scheduling can be performed easily, and more efficient work execution can be achieved.

[First Embodiment]
Hereinafter, an embodiment of a workflow system according to the present invention will be described with reference to the drawings.

  The workflow process in the workflow system according to the present embodiment includes a node that is a unit of work performed on a client, and a path that connects the nodes and constructs a business process (business). For example, it is configured as shown in FIG.

  FIG. 1 is a schematic diagram showing an example of the configuration of a workflow process in the workflow system showing the first embodiment according to the present invention.

  As shown in FIG. 1, first, a case (task) is created by a draft node 1001. This case is a workflow that passes the path 1007, approves the case at the approval 1 node 1002, approves again at the approval 2 node 1003, performs final approval at the approval 3 node 1004, and ends the process.

  Note that, in each of the above nodes, when a matter stays for a long time, an optimal node is selected from a plurality of proxy nodes 1005 to perform proxy processing. Details will be described later.

  FIG. 2 is a system configuration diagram showing an example of the configuration of the workflow system showing the first embodiment according to the present invention.

  As shown in FIG. 2, the workflow system of the present invention includes a plurality of computers that function as a workflow client (client) 102 and a workflow server 104 in a network 101 configured by a single unit or a combination of LAN, WAN, WWW, and the like. Connected and configured. An example of the configuration of each computer is shown in FIG.

  The client 102 includes a user interface 103, accepts an operator's operation in the workflow, and performs login processing, form (task) drafting (generation), and approval processing.

  Further, the client 102 includes processing history information 112 in which the work history of the worker and the collected work history of other workers are stored for each client, and processing history information control for controlling input / output to the processing history information 112 Part 114 is provided.

  Further, the workflow server 104 manages and holds definition information such as process definition information 108, task information 109, processing time information 110, worker information 111, condition setting file 115, and the like, and task generation is performed by the workflow control unit 105. , Task processing, transition, and control.

  The waiting task analysis unit 107 of the workflow server 104 calculates the progress status of the node in charge of each worker from the current task progress status from the task information 109. This information is used by the processing time calculation unit 106 to calculate the actual processing time.

  Further, the processing time calculation unit 106 of the workflow server 104 determines the node that the worker is in charge of based on the progress status of the node received from the waiting task analysis unit 107 and the information acquired from the processing time information 110. The actual processing time required to indicate the time until all processing is completed is calculated.

  Further, the warning notification unit 113 of the workflow server 104 has a function of monitoring task information and informing a worker of report information, task information, and the like using a mail, a messenger, and other protocols when a change occurs. Have.

  FIG. 3 is a functional block diagram for explaining the workflow system shown in FIG. 2 from a functional viewpoint.

  First, a flow for confirming the normality of the worker and specifying a node to be processed by the worker will be described.

  As shown in FIG. 3, when the user interface 103 receives a processing request from an operator, first, the processing history information 112 is searched by the worker ID via the processing history information control unit 114 in the client machine 102, and A route and a node that can be processed by the worker are specified from the node ID and the route ID of the data. Next, log in to the system. A search is performed for the ID and password entered in the worker information 111. If there is a corresponding ID, a work screen is displayed.

  Second, the flow of calculating the actual processing time will be described.

  When issuing a draft, the workflow control unit 105 displays the process to be executed, and can display the actual processing time required for each node and the entire process and the time set as a target at the same time. In addition, it is possible to display a progress status indicating which node the task has progressed to.

  The required processing time calculation unit 106 is required to calculate the actual processing time to be displayed. The processing time calculation unit 106 acquires the processing time of the nodes included in the process, receives the task processing time and the average processing time of the nodes included in the processing history information from the waiting task analysis unit 107, and controls the workflow. The unit 105 multiplies these pieces of information to calculate the time required for actual processing and returns the value to the user interface 103 to display it on the screen.

  The waiting task analysis unit 107 calculates the required processing time of the staying node, which is used for calculating the actual processing required time. The waiting task analysis unit 107 receives the request from the processing time calculation unit 106, counts the nodes staying in the task information 109, calculates the time required for processing from the number, and sends it to the processing time calculation unit. Returns a value.

  The task progress information is requested to the processing time calculation unit 106. The processing time calculation unit 106 obtains the task progress information from the process of calculating the actual processing time and indicates the process configuration. Display in process map.

  Third, the flow of workflow control will be described.

  The workflow control unit 105 has a function of controlling the progress status and data transition of the entire workflow, and a function of receiving a command from the user interface and issuing a command to each calculation unit in the server.

  The warning notification unit 113 monitors the change of the node of the task information via the workflow control unit, and if there is a change, sends the form information etc. using the email address obtained from the worker information 111, and works to the worker. Has a function of prompting

  The configuration of a computer applicable to the client 102 and the workflow server 104 shown in FIG. 2 will be described below with reference to FIG.

  FIG. 4 is a block diagram illustrating an example of a computer configuration applicable to the client 102 and the workflow server 104 illustrated in FIG.

  In FIG. 4, reference numeral 40 denotes a computer applicable to the client 102 and the workflow server 104. Reference numeral 41 denotes a CPU. The CPU 41 loads a program stored in the ROM 43 or an external storage device (for example, any storage device such as a hard disk, flexible disk, CD-ROM, DVD-ROM) onto the RAM 42 and executes it. Thus, the entire computer 40 is controlled. The RAM 42 is used as a work area for the CPU 41.

  Reference numeral 45 denotes a network interface card (NIC) that enables connection to a network. An input device 47 corresponds to a pointing device such as a keyboard or a mouse. A display device 46 is composed of a CRT, LCD, or the like.

  The implementation of each component of the workflow system shown in FIGS. 2 and 3 will be described below with reference to FIG.

  First, the user interface 103 shown in FIG. 2 is implemented by the CPU of the client 102 loading and executing a program stored in an external storage device or the like on the RAM. The input screen received from the workflow server 104 or the like (generated by the client 102 or read from the external storage device) is displayed on the display device of the client 102, and the input device of the client 102 to the input screen is controlled. Perform the input control used.

  The processing history information control unit 114 shown in FIG. 2 is implemented by the CPU of the client 102 loading and executing a program stored in an external storage device or the like on the RAM.

  Further, the processing history information 112 illustrated in FIG. 2 is stored in the external storage device of the client 102.

  In addition, the workflow control unit 105, the processing time calculation unit 106, the waiting task analysis unit 107, and the warning notification unit 113 shown in FIG. 2 are all programs stored by the CPU of the workflow server 104 in an external storage device or the like. It is mounted by loading on the RAM and executing it.

  Furthermore, the process definition information 108, task information 109, processing time information 110, worker information 111, and condition setting file 115 shown in FIG. 2 are all stored in the external storage device of the workflow server 104.

  Hereinafter, the various information 108 to 112 and 115 shown in FIG. 2 will be described with reference to FIGS.

  FIG. 5 is a data configuration diagram showing an example of the data configuration of the process definition information 108 shown in FIG.

  The process definition information 108 is defined for each process and has a configuration as shown in FIG. 5, and is definition information for managing a business process configured by workflow system nodes and paths. This definition information exists for each type of slip.

  Using “node ID” and “route ID” as keys, the type of processing (node type) to be performed by the node and the order of processing (processing order) are defined.

  FIG. 6 is a data configuration diagram showing an example of the data configuration of the task information 109 shown in FIG.

  The task information 109 holds task progress management on the workflow system in an integrated manner.

  As shown in FIG. 6, the task information 109 indicates the current processing status using “task ID”, “node ID”, and “route ID” sequentially assigned by the worker's drafting process. It manages the "status" and the "start time" of task processing. “Status” includes “processing” indicating that the task is being processed, and “standby” indicating that the task has not been performed yet. The task information 109 is used for calculating the actual processing time required by the waiting task analysis unit (107) reading the number of nodes remaining and the start time.

  FIG. 7 is a data configuration diagram illustrating an example of a data configuration of the required processing time information 110 illustrated in FIG.

  As shown in FIG. 7, the processing time information 110 is for setting a target value (target time) of processing time for each node and worker on the workflow system. “Target time” is set using “Route ID” as a key.

  FIG. 8 is a data configuration diagram showing an example of the data configuration of the worker information 111 shown in FIG.

  As shown in FIG. 8, the worker information 111 manages information on the worker who operates the workflow system. The “worker ID” is used as a key to set “password” and a mail address for sending a message from the system. (Mail) is set. Further, a “status” indicating whether or not the user is logged in is managed for each “worker ID”.

  The work information 111 is used when logging into the workflow system.

  FIG. 9 is a data configuration diagram showing an example of the data configuration of the processing history information 112 shown in FIG.

  In the present embodiment, as described above, each client 102 holds worker information called processing history information 112 shown in FIG.

  As shown in FIG. 9, the processing history information 112 exists for each client 102 and uses “client ID”, “worker ID”, “node ID”, and “route ID” set with the client IP address as keys. The “average processing time” and “number of processing times” of the node and the “update date” of information are set.

  The “node ID” and “route ID” recorded in the processing history information 112 are approved by the worker corresponding to the “worker ID” by the “node ID” and “route ID”. Indicates that you have the authority to perform processing.

  That is, the operator's work authority can be specified by a combination of “node ID” and “route ID”. The processing history information can hold not only one worker information but also other worker information.

  In addition, since the processing history information shares the worker's information with each other, the processing history information of other machines can be read even if the adjacent client machine breaks when sorting tasks or searching for processing history information. With this, you can reach the target worker information.

  In addition, the processing time calculation unit 106 reads the “average processing time” of the processing history information 112 to calculate the actual processing time.

  Further, the processing history information 112 is not only information of one worker, but also the processing history information control unit 114 searches the processing history information 112 set in the other client 102 and obtains information of other workers. You can capture.

  FIG. 10 is a data configuration diagram showing an example of the data configuration of the condition setting file 115 shown in FIG.

  The condition setting file 115 is set with distribution conditions for automatic task distribution.

  As shown in FIG. 10, “target time” and time (±) set to “target time” for triggering automatic task distribution processing are set using “node ID” and “path ID” as keys. In addition, in the automatic distribution process, the “number of processes” of the worker who performs automatic distribution and the worker (user) who performs automatic distribution are set.

  The “target time” is used not only as a threshold for automatic task assignment, but also as a comparison when displaying the actual processing time.

  Hereinafter, the constant setting screen for setting the processing time information 110 shown in FIG. 7, the worker information 111 shown in FIG. 8, and the condition setting file 115 shown in FIG. 10 will be described with reference to FIG. .

  FIG. 11 is a schematic diagram showing an example of a constant setting screen for setting the required processing time information 110 shown in FIG. 7, the worker information 111 shown in FIG. 8, and the condition setting file 115 shown in FIG. .

  When the constant setting screen shown in FIG. 11A is displayed on the display device of the client 102 and the setting of the required processing time information is instructed by the input device of the client 102, the user interface 103 is shown in FIG. The required time list setting screen is displayed on the display device of the client 102, and information corresponding to the processing required time information 110 shown in FIG. 7 can be input. When the determination is instructed, the user interface 103 transmits the required time list information input on the required time list setting screen shown in FIG. 11B to the workflow server 104, and the CPU of the workflow server 104 The received required time list information is stored in the external storage device as the required processing time information 110 shown in FIG.

  When the delegation condition setting is instructed by the input device of the client 102 in the state where the constant setting screen of FIG. 11A is displayed, the user interface 103 displays the agent selection condition shown in FIG. A setting screen is displayed on the display device of the client 102, and information corresponding to the condition setting file 115 shown in FIG. 10 can be input.

  In the proxy selection condition setting screen shown in FIG. 11 (c), the system acquires and displays the target time (column 3) of the required processing time information (FIG. 7) using the node ID and route ID obtained from the processing history information as keys. To do. The worker can set the time α as the trigger for distribution.

  It is also possible to specify a value for the number of processing times and execute it with more than that value as in the approval 1 node on the first line.

  Furthermore, by setting the worker ID to the worker item (user) as in the definition on the second line, it is possible to restrict the processing worker and perform the processing or give the authority to perform a new processing. (For example, the boss sets the subordinate's worker ID).

  Moreover, the conditions shown here are examples, and for example, a value set in a slip can be set as a condition in the present invention.

  In the above example, the target time is set for each node as a trigger, but by setting a predetermined value for the route ID and the target time ± (the node ID is left blank), the actual processing of the entire workflow is required. It is also possible to treat time as a trigger.

  When the determination is instructed, the user interface 103 transmits the condition setting information input on the proxy selection condition setting screen shown in FIG. 11C to the workflow server 104, and the CPU of the workflow server 104 The received condition setting information is stored in the condition setting file 115 shown in FIG.

  Further, when the user information setting is instructed by the input device of the client 102 in a state where the constant setting screen of FIG. 11A is displayed, the user interface 103 displays the user list setting shown in FIG. A screen is displayed on the display device of the client 102, and information corresponding to the worker information 111 shown in FIG. 8 can be input. When the determination is instructed, the user interface 103 transmits the user list setting information input on the user list setting screen shown in FIG. 11C to the workflow server 104, and the CPU of the workflow server 104 receives the information. The user list setting information is stored in the external storage device as the worker information 111 shown in FIG.

  Hereinafter, the processing flow of the workflow system of the present invention will be described with reference to FIGS.

  FIG. 12 is a flowchart showing an example of the first control process in the workflow system of the present invention. In the figure, S101 to S105 correspond to the steps on the client 102 side, and are realized by the CPU of the client 102 shown in FIG. 2 loading and executing a program stored in an external storage device or the like on the RAM. Is done. Further, S110 to S119 are realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM.

  FIG. 13 is a schematic diagram showing the screen transition of the client 102 in accordance with the process shown in FIG.

  First, the node for which the operator has processing authority is specified.

  In step S101 of FIG. 12, when the work ID and password are input and “Enter” is instructed on the login screen of FIG. 13A displayed by the user interface 103 (executed by the CPU) “ The interface 103 transmits the input work ID and password to the workflow server 104.

  In step S110, the workflow control unit 105 (executed by the CPU) of the workflow server 104 determines whether the work ID and password information received from the client 102 is authentic or not based on the worker information 111 shown in FIG. To do.

  If it is determined that the work ID and password information are authentic, the workflow control unit 105 of the workflow server 104 uses the input “worker ID” as a key in step S111. 9 (refer to the processing history information control unit 114 of the client 102 to request the search, and the processing history information control unit 114 searches and sends the search result to the workflow server 104). (Return), and the “node ID” and “route ID” set in the data (processing history information) matching the “worker ID” are set as the processing authority of the worker.

  If it is determined that the work ID and password information are not legitimate, the client 102 is notified of the fact and the processing is terminated.

  Next, a task list is acquired and a process to be performed is selected.

  Subsequently, in step S <b> 111, the workflow control unit 105 of the workflow server 104 searches the task list 109 using “worker ID” as a key, and transmits the searched task information data to the client 102.

  In step S102, the user interface 103 of the client 102 receives the task information data retrieved from the workflow server 104, and generates a process selection screen shown in FIG.

  Next, in step S103, when the user interface 103 of the client 102 selects any slip on the process selection screen shown in FIG. A slip issuing instruction is transmitted to the workflow server 104.

  If the workflow control unit 105 of the workflow server 104 determines that a slip has been selected and a draft has been instructed from the client 102, the workflow control unit 105 immediately adds a task ID to the task information 109 in step S113. Is assigned (acquired), and based on the information of the slip to be issued, “node ID” and “route ID” are set in the task information corresponding to the new task ID, and the status is “processing”. As the start time, the current time is set, and the process proceeds to step S114 where node information (here, all nodes on the route) and route information are designated, and processing required time calculation pre-processing (details are described later in FIG. 17). When an actual process is required, the execution time of the process is indicated and the time required for the process to be completed for each node is indicated to the process time calculation unit 106 Is calculated, and generates a screen (FIG. 14) based on the processing required time calculation result is transmitted to the client 102 waits for the end of work on the client 102 ( "application" instruction).

  In step S104, the user interface 103 of the client 102 changes the screen to the application screen shown in FIG. 13C and displays the slip to be input. Further, the user interface 103 of the client 102 displays a screen (FIG. 14) based on the processing time calculation result transmitted from the workflow server 104 on another screen. That is, on the display screen of the client 102, a slip to be input and a route and time until the slip reaches the final approval are displayed.

  Further, in step S103, the user interface 103 of the client 102 is displayed on the approval waiting slip list screen shown in FIG. 13D displayed by selecting “approval processing” on the processing selection screen shown in FIG. 13B. When one of the tasks is checked and “selection” is instructed, an approval process selection instruction for the selected task information (task ID) is transmitted to the workflow server 104, and the screen is shown in FIG. Transition to the approval screen and prompt the user for input.

  If the workflow control unit 105 of the workflow server 104 determines that the task is selected and the task approval process is instructed from the client 102, the workflow control unit 105 immediately stores the task information 109 in step S112. Search by the selected “task ID”, obtain target task information, change the status of the task information to “processing”, change the start time to the current time, and change the contents of the task It transmits to the client 102 and waits for the end of work (“application” / “denial” instruction) in the client 102.

  Further, the user interface 103 of the client 102 displays the contents of the task to be approved transmitted from the workflow server 104 (FIG. 13 (e)). As a result, the contents of the slip are displayed, and the worker confirms the contents and performs processing such as approval.

  In step S <b> 104, when the worker input process on the user interface of the client 102 is completed, the client 102 transmits the input process result to the workflow server 104.

  Then, the workflow server 104 rewrites the task information and updates the processing history information because the task moves to the next node.

  More specifically, in step S115, the workflow control unit 105 of the workflow server 104 searches for process definition information using “node ID” and “path ID” as keys, and acquires information on a node to be advanced next.

  Next, in step S116, the workflow control unit 105 of the workflow server 104 rewrites the “node ID” and “route ID” of the task information with the information of the node to be advanced next, sets the status to “standby”, and sets the start time. Erase settings.

  In step S117, the workflow control unit 105 of the workflow server 104 performs processing for writing information on the currently processed task in the processing history information in order to make the processing history information the latest information (the processing shown in FIG. 19 described later). (History information update process), the process of this flowchart is terminated.

  Although not shown in this flowchart, the user interface 103 of the client 102 is configured such that when any task is selected and “task search” is selected on the process selection screen shown in FIG. The workflow server 104 executes a progress status display process shown in FIG. 27 to be described later, and as a result, transmits it to the client 102. At this time, the screen shown in FIG. 15 is displayed on the client 102, and an ongoing node such as “Approve 1 node” is colored and displayed.

  Similarly, although not shown in this flowchart, when “target time display” is selected on the processing selection screen shown in FIG. 13B on the client 102 side, the workflow server 104 side will be described later. 26 is executed, and the result is transmitted to the client 102. As a result, the screen shown in FIG. 16 is displayed on the client 102, and the actual processing time is displayed on each node, and the total time required for all processing is displayed on the drafting node.

  Furthermore, although not shown in this flowchart, when “proxy processing for delegating the processing to the agent” is selected on the approval waiting slip list screen shown in FIG. The side shifts to an automatic task distribution process shown in FIG. 22 to be described later, determines an agent, and distributes the task to the agent.

  Hereinafter, background processing will be described.

  In this workflow system, processing history information search processing (details are shown in FIG. 20 described later) is always executed in the background on the client 102 side (S105). This function synchronizes the contents of processing history information between clients for each business content, and always keeps the latest information.

  In addition, the workflow server 104 also performs in real time processing (details are shown in FIG. 22 to be described later) in which a task staying in a node in the background is sequentially distributed to a proxy node that can be processed quickly (S118). .

  Further, the workflow server 104 side monitors the change of the value of the task information, and performs a warning notification process (details are shown in FIG. 25 described later) if there is a change (S119).

  The above represents the workflow control in this system.

  Hereinafter, with reference to FIG. 17 and FIG. 18, the processing required time calculation pre-processing in step S114 of FIG. 12 will be described.

  FIG. 17 is a flowchart showing an example of the second control processing in the workflow system of the present invention, and corresponds to the processing required time calculation pre-processing in step S114 of FIG. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S3001 to S3006 indicate steps.

  In step S3001, when the processing time calculation unit 106 of the workflow server 104 receives an instruction from the workflow control unit 105 or an operator (instruction from the user interface 103), in step S3002, information on the instructed node (draft) In step S114 of FIG. 12, all the nodes on the route are instructed), and in step S3003, one piece of node information is extracted from the instructed plurality of node information. The corresponding definition information is acquired from the process definition information 108 using the path information as a key and stored in the work area in the RAM.

  Next, in step S3004, the processing time calculation unit 106 of the workflow server 104 calculates the actual processing time based on the process information acquired in step S3003.

  Next, in step S3005, the processing time calculation unit 106 of the workflow server 104 determines whether or not the required time for all the instructed nodes has been calculated, and still calculates the required time for all the instructed nodes. If it is determined that there is not, the process returns to step S3003, and the next node is processed.

  On the other hand, if it is determined in step S3005 that the required processing time calculation unit 106 of the workflow server 104 has calculated the required time for all the nodes that have already been instructed, the required time calculated together with the route map in step S3006 is obtained. A screen for display (FIG. 14) is transmitted to the client 102, and the process ends.

  As a result, the screen (FIG. 14) reflecting the calculation result is returned to and displayed on the user interface 103 on the client 102 side.

  Next, the processing time calculation process in step S3003 will be described.

  FIG. 18 is a flowchart showing an example of the third control processing in the workflow system of the present invention, and corresponds to the processing required time calculation processing in step S3004 in FIG. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S402 to S413 indicate each step.

  First, in step S402, the processing time calculation unit 106 of the workflow server 104 performs client processing related to the target worker from the node ID, route ID, and worker ID in the process information acquired in step S3003 of FIG. The history information is searched to obtain the average processing time (b).

  Next, in step S403, the processing time calculation unit 106 of the workflow server 104 retrieves task information from the node ID, route ID, and worker ID, and task information related to the worker who processes the designated node. Get "status" and "start time" information.

  Next, in step S404, the processing time calculation unit 106 of the workflow server 104 counts the information acquired from the task information whose status is “waiting” for each node, and the number of tasks in the standby status for each node ( x).

  Next, in step S405, the processing time calculation unit 106 of the workflow server 104 determines the status of the target node using the status of each node as a key. Specifically, a node having a status of only “processing”, a node including “standby”, and a node having no status are determined, the processing is branched, and the actual processing time is calculated for each task information status.

  First, in step S405, if the processing time calculation unit 106 of the workflow server 104 determines that the status is a node having only “processing”, the time information (OS etc.) that the workflow server 104 has in step S407. The “start time” of the task information is subtracted from the “current time” obtained from the “process time” (a). Then, a “time until the processing being completed” (c) is calculated by subtracting the “processing execution time” (a) from the “average processing time” (b).

  Next, in step S409, first, “the total processing time required for the nodes existing up to the calculation target node” (d) is obtained. Then, the value of the preprocessing ("the total time required for processing of the nodes existing up to the calculation target node" (d) from "the time until the processing being processed" (c) obtained in step S407 is completed. A value (e) obtained by subtracting and adding “average processing required time (b)” is calculated, and “the total required processing time of nodes existing up to the calculation target node” (d) Assuming that the required time calculation process is repeated in order from the top node, the value calculated as each “real process required time” is calculated each time, and until the processing of FIG. The data is stored in the RAM, and is updated sequentially every time the processing of this flowchart is executed for the next node.

  Next, in step S410, it is determined whether or not the calculated value (e) in step S409 is “0”, minus, or smaller than “average processing time” (b), and the calculated value in step S409 is “0”. ”, Minus, or“ average processing time ”(b), the process proceeds to step S412 to set“ average processing time ”(b) as“ actual processing time ”. The process proceeds to S413.

  On the other hand, if it is determined in step S410 that the calculated value (e) in step S409 is not "0", minus, or less than "average processing time" (b), the process proceeds to step S411, and step S409 is performed. The calculated value (e) is set as “actual processing time”, and the process proceeds to step S413.

  If the processing time calculation unit 106 of the workflow server 104 determines in step S405 that the node includes a status of “standby”, “average processing time (b)” is set in step S408. Multiply by “number of tasks in standby status for each node (x)” to obtain “time (z) for processing in standby”. Then, “time until task processing is completed” (c) is added to “time (z) related to standby processing” to obtain “time until task processing is completed” (i).

  In step S409, first, all the required processing times of the nodes on the route to the calculation target node are added to obtain “the total required processing time of the nodes existing until the calculation target node” (d). . Then, the value of the preprocessing (“time until task processing is completed” (i) obtained in step S408) to “total processing time of nodes existing up to the calculation target node” (d) The value (f) obtained by subtracting and adding the “average processing time (b)” is calculated.

  Next, in step S410, it is determined whether or not the calculated value (f) in step S409 is “0”, minus, or smaller than “average processing time” (b), and the calculated value (f) in step S409. Is determined to be “0”, minus, or smaller than “average processing time” (b), the process proceeds to step S412, and “average processing time” (b) is set as “real processing time”. Then, the process proceeds to step S413.

  On the other hand, if it is determined in step S410 that the calculated value (f) in step S409 is not "0", minus, or less than "average processing time" (b), the process proceeds to step S411, and step S409 is performed. The calculated value (f) is set as “actual processing time”, and the process proceeds to step S413.

  In step S405, if the processing time calculation unit 106 of the workflow server 104 defines nothing in the status (represents that there is no task in the node), in step S406, “ “Average processing time (b)” is set as “actual processing time”, and the process proceeds to step S413.

  Next, in step S413, the time required for the entire process is obtained by adding up the actual processing time. That is, the actual processing time required for each node is summarized, the value is set as the total processing time in the drafting node, and the processing of this flowchart ends.

  As described above, the actual processing time is displayed at each node, and the total time required for all processing is displayed at the draft node.

  Note that the actual processing time is not calculated for the draft node. This is because the drafting node is the beginning of all workflows, so a certain person in charge does not always work, so even if the required time is calculated, the time is not credible, and this This is because the processing time of the node does not affect the subsequent node in time.

  Hereinafter, with reference to the flowchart of FIG. 19, the function of constantly maintaining the latest processing history information contents held by the client according to the processing contents of the form performed by the operator is a processing history information updating function. Will be described.

  FIG. 19 is a flowchart showing an example of the fourth control process in the workflow system of the present invention, which corresponds to the process history information update process in step S117 of FIG. A function that keeps the contents of information up-to-date according to the contents of the processing of the form performed by the operator is the process history information update function. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S2901 to S2904 indicate steps.

  In step S2901, the workflow control unit 105 of the workflow server 104 calculates the time required for task processing. Then, the workflow control unit 105 searches the processing history information by the worker ID, the node ID, and the route ID, and multiplies the required processing time and the number of processing times to obtain the total node processing time.

  Next, in step S2902, the workflow control unit 105 subtracts the start time of the task information from the current time to calculate the time required for the node processing time.

  In step S 2903, the workflow control unit 105 adds the total node processing time calculated in step S 2901 and the node processing time calculated in step S 2902, and divides the value by the value of “number of processing times + 1”. The average processing time is assumed.

  In step S2904, the workflow control unit 105 overwrites the value of the processing count + 1 with the processing count, and ends the processing of this flowchart.

  Hereinafter, with reference to the flowchart of FIG. 20, the history information of the processing performed by the operator called processing history information, which is held for each client in order to calculate the actual processing required time, is searched, and the processing of the own client A processing history information search function for taking processing history information of other clients into the history information will be described.

  FIG. 20 is a flowchart showing an example of the fifth control process in the workflow system of the present invention, and corresponds to the process history information search process in step S105 of FIG. Note that the processing in this flowchart is realized by the CPU of the client 102 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S1101 to S1110 indicate each step.

  In step S <b> 1101, the processing history information control unit 114 of the client 102 acquires information on a node having its own processing authority. Specifically, the processing history information control unit 114 searches its own processing history information with the worker ID and acquires a node ID and a route ID.

  Next, the processing history information of the partner client is searched.

  Specifically, in step S1102, the processing history information control unit 114 of the client 102 searches for a client machine of another worker connected via the network.

  Next, in step S1103, the processing history information control unit 114 of the client 102 acquires the processing history information of the searched client machine, and searches using the node ID and path ID acquired in step S1101 as keys.

  Next, a process of taking the information of the partner process history information into the own process history information is performed (S1104 to S1109).

  Specifically, in step S1104, the processing history information control unit 114 of the client 102 extracts one processing history information from the search result in step S1103, and determines whether or not the node ID and route ID that the user has are the same information. If it is determined and it is determined that the node ID and route ID that the user has are not the same information, the process directly proceeds to step S1109.

  On the other hand, if the processing history information control unit 114 of the client 102 determines in step S1104 that the node ID and route ID of the client 102 are the same information, in step S1105, the processing history information control unit 114 uses the worker ID of the partner worker. The processing history information is searched and a match / mismatch is determined.

  If the processing history information control unit 114 of the client 102 determines in step S1105 that worker information that matches the worker ID of the partner worker does not exist in the time processing history information, in step S1106, the acquired partner Is added to its own processing history information, and the process advances to step S1109.

  On the other hand, if the processing history information control unit 114 of the client 102 determines in step S1105 that worker information that matches the worker ID of the partner worker exists in the time processing history information, the process proceeds to step S1107.

  In step S1107, the processing history information control unit 114 of the client 102 compares the update dates of both the processing history information of the client 102 and the processing history information of the acquired partner, and the partner from which the processing history information of the client 102 has acquired. It is determined whether it is older than the processing history information.

  If the processing history information control unit 114 of the client 102 determines in step S1107 that the processing history information of the client 102 is older than the acquired processing history information of the partner, the acquired processing history information of the partner is stored in step S1108. The process history information is overwritten, and the process proceeds to step S1109.

  Next, in step S1109, the process history information control unit 114 of the client 102 determines whether or not the search for all partner process history information has been completed. If it is determined that the process has not been completed, the process returns to step S1104. Next, the following processing history information is checked.

  On the other hand, if the processing history information control unit 114 of the client 102 determines in step S1109 that all the partner processing history information has been searched, in step S1110, the processing history information control unit 114 converts the own processing history information into the node ID, path ID, Sort by the required processing time and the number of processing times, and end the processing.

  This sort processing of the self-processing history information in step S1110 is an operation for performing efficient search when performing task processing.

  The search destination is preferentially searched if system information of another worker is included in the processing history information. If other workers' information is not included, the information of the nearest machine as viewed from its own machine is searched.

Also,
FIG. 21 is a schematic diagram modeling a connection between a plurality of clients 102 and the workflow server 104 in the present embodiment.

  As shown in FIG. 21, in the processing history information search / collection processing shown in FIG. 20, the client machines take the form of sharing information with each other. At this time, the server is not used, but the configuration may be performed via the server.

  Further, the processing history information held by each client 102 may be stored in a server.

  Hereinafter, with reference to the flowchart of FIG. 22, a task distribution process (also referred to as an automatic path distribution process or an automatic proxy process) performed based on the above-described time required for actual processing will be described.

  This task automatic distribution is a task that is triggered based on the condition setting file that defines the distribution conditions shown in Fig. 10 and the system is automatically retained when tasks remain in the node. Is a function that distributes to nodes that can perform proxy processing.

  Also, when the “proxy processing” button shown in FIG. 13D is instructed, this automatic task distribution processing is executed.

  FIG. 22 is a flowchart showing an example of the sixth control process in the workflow system of the present invention, and corresponds to the automatic route distribution process in step S118 of FIG. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S501 to S507 indicate steps.

  In step S501, upon receiving an instruction “substitution instruction” from the worker or a notification that the condition setting file matches the workflow condition, the workflow control unit 105 of the workflow server 104 selects a client that can perform the substitution process. In order to search, a node ID and a route ID for proxy processing are acquired, and automatic route distribution processing is started.

  Next, in step S502, the workflow control unit 105 of the workflow server 104 searches the processing history information (FIG. 9) of the client machine where the selected task stays, and has the same node ID and route as the proxy request source. The client information having the ID is acquired, the average processing time (column 5) in the acquired information of each client is compared, and the information of the client having the shortest average processing time is acquired.

  Next, in step S503, the workflow control unit 105 of the workflow server 104 shows an example based on the processing history information shown in FIG.

  For example, if the combination of the node ID of approval 1 and the path ID of path 1 is a task to be subjected to proxy processing, row 1, row 3, and row 4 are targeted. Subsequently, the respective average processing times (column 5) are compared, and the one with the shortest time is acquired. Here, the information of line 3 is acquired.

  If the task is distributed according to the setting file conditions, the comparison is performed under the conditions shown in the condition setting file shown in FIG. For example, when the node ID is “approval 1” and the route ID is “route 1”, the setting in the first row is a comparison target.

  The set condition is that the target time is “1:00” and an operator who has been able to process within the range of “± 0: 10” at that time and who has processed the node “50” times or more. It becomes a target. When the processing history information shown in FIG. 9 is searched under this condition, the target is the operator “B3000” in the row 3.

  Hereinafter, the description returns to the flowchart of FIG.

  In step S503, in order to perform task distribution processing, the workflow control unit 105 of the workflow server 104 searches for a distribution destination client machine based on the client ID of the information acquired from the processing history information in step S502, Check the connection status. At the same time, it is checked based on the worker information 111 shown in FIG. 8 whether or not the worker has logged in to the workflow system.

  If the workflow control unit 105 of the workflow server 104 determines in step S503 that login or machine activation has not been confirmed, the process returns to step S502 to search the processing history information again, and information on the worker that meets the conditions. To get. If there is no worker information that meets the conditions, the client ID of the compared worker information is acquired, and the processing history information of the machine is similarly searched. If there is no worker information that meets the conditions even after searching the processing history information of all clients, an error is displayed on the screen.

  On the other hand, if the workflow control unit 105 of the workflow server 104 determines in step S503 that login and machine activation have been confirmed, in step S504 to check the processing status of the node that the worker is currently performing. The node ID and the route ID for performing the proxy processing acquired in step S501 are processed, and the processing time calculation unit 106 is caused to execute the processing time pre-processing (shown in FIG. 17) to determine the actual processing time. Let it be calculated.

  Next, in step S505, the workflow control unit 105 of the workflow server 104 confirms whether or not the actual processing time required in step S504 is applicable to the condition in the condition setting file. This confirmation processing is performed by checking whether the actual processing time required in step S504 is shorter than the target time (column 3) of the processing time information (FIG. 7).

  In step S505, when the workflow control unit 105 of the workflow server 104 determines that the condition setting file condition is satisfied, in step S506, the task remaining in the worker is distributed, The warning request function 113 is used to transmit the purpose of requesting the proxy to the proxy and the operator of the proxy request source.

  On the other hand, if the workflow control unit 105 of the workflow server 104 determines in step S505 that the condition setting file condition is not satisfied, the process returns to step S502.

  In step S507, the workflow control unit 105 of the workflow server 104 repeats the processing up to step S506, confirms whether all the tasks set in the setting file and the tasks instructed by the worker have been distributed and distributed. If it is determined that it is not, the process returns to step S502 and the next task is distributed.

  On the other hand, if it is determined in step S507 that the workflow control unit 105 of the workflow server 104 has distributed all the tasks set in the setting file and the tasks instructed by the worker, the processing of this flowchart ends.

  FIG. 23 and FIG. 24 show the effects in a process map using the automatic task distribution process shown in FIG.

  FIG. 23 is a map showing the result of executing the above distribution function. FIG. 24 corresponds to a map representing the state of the task information shown in FIG. 6 before executing the above distribution function.

  23 is compared with FIG. 24, the total time “23:36” required for the processing indicated by 1401 in FIG. 24 is the total time “17:00” required for the processing indicated by 1301 in FIG. As you can see, it is shorter.

  Hereinafter, with reference to FIG. 25, a warning notification function for monitoring task information and notifying workers of form data and node information when there is a change in node information such as proxy processing will be described.

  FIG. 25 is a flowchart showing an example of the eighth control process in the workflow system of the present invention, and corresponds to the warning notification process in step S119 of FIG. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S2801 to S2803 indicate steps.

  First, in step S2801, the warning notification unit 113 of the workflow server 104 monitors the node ID of the task information 109 for each task.

  In step S2802, the warning notification unit 113 of the workflow server 104 determines whether or not there is a change such as addition or transition in the node ID, and if it is determined that there is no change such as addition or transition in the node ID, Returning to S2801, monitoring is continued.

  On the other hand, if the warning notification unit 113 of the workflow server 104 determines in step S2802 that there is a change such as addition or transition in the node ID, the worker information is searched in step S2803 and the transition destination or delegation is delegated. The person in charge of the node is notified of the slip contents and task contents by e-mail.

  Note that the present invention is not limited to mail delivery, but also supports a system notification function and a notification function using other protocols.

  It is also possible to make a notification according to an instruction from the workflow control unit 105 or the like.

  Hereinafter, with reference to FIG. 26, the time set as the target value of the time required for the processing of each node and the actual processing time are displayed, and the difference is calculated and displayed as a guideline for assigning the person in charge. A display function of the available target processing time will be described.

  FIG. 26 is a flowchart showing an example of the ninth control process in the workflow system of the present invention, and corresponds to the display process of the target process required time. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S1501 to S1505 indicate the respective steps.

  First, in step S1501, the furk flow control unit 105 of the workflow server 104 corresponds to each node of each client 102 using, for example, each node ID and path ID corresponding to the slip instructed in FIG. The processing history information to be searched is searched, and the average value of the average processing time corresponding to each acquired node is obtained.

  Next, in step S1502, the furk flow control unit 105 of the workflow server 104 searches the processing required time information 110 using the node ID and the route ID as keys, and acquires the target required time corresponding to each node.

  Next, in step S1503, the furk flow control unit 105 of the workflow server 104 calculates the target required time corresponding to each node acquired in step S1502 from the average value of the average processing required time corresponding to each node calculated in step S1501. Subtract each and find the difference.

  Next, in step S1504, the furk flow control unit 105 of the workflow server 104 sums up the processing required time corresponding to each of the nodes calculated in step S1503, the target processing required time, and the difference therebetween.

  In step S1505, the furk flow control unit 105 of the workflow server 104 displays the total processing time, the total target processing time, and the total difference calculated in step S1504 on the draft node. For the node, a screen for displaying the target time and actual processing time for each node on the process map is generated and transmitted to the client 102.

  As a result of the above processing, the client 102 displays as shown in FIG. As shown in FIG. 16, the required time of the target and the actual result is displayed for each node, and the difference between them is also displayed at the same time.

  Here, the required time is obtained in a state where the distribution is not performed. However, even when the distribution is performed, the required time can be obtained.

  Hereinafter, a task progress display function will be described with reference to FIG. This function displays which node the task issued by itself is currently reached.

  FIG. 27 is a flowchart showing an example of a tenth control process in the workflow system of the present invention, and corresponds to a task progress status display process. Note that the processing of this flowchart is realized by the CPU of the workflow server 104 loading and executing a program stored in an external storage device or the like on the RAM. In the figure, S1701 to S1703 indicate the respective steps.

  First, in step S <b> 1701, the furk flow control unit 105 of the workflow server 104 searches for a node whose status of the task information to be read is “processing” at the time of calculating the required processing time and automatically distributing the route.

  In step S <b> 1702, the furk flow control unit 105 of the workflow server 104 transmits the task desired to be displayed from the information acquired in step S <b> 1701 to the client 102, and sends any task to the client 102. In step S1703, the task information is returned to the user interface 103 in a visual form that can identify the target node (in this embodiment, the target node is colored and distinguishable).

  As a result of the above processing, the client 102 displays as shown in FIG. As shown in FIG. 15, a node in progress such as an approval 1 node is colored and displayed.

  As shown above, since each client has processing history information with the skill information of the worker, even if the number of processes that can be handled by the worker increases or decreases, it can be handled without any changes to the workflow server. .

  In addition, the estimated time required for processing is calculated by taking into account the increase and decrease of the accumulated task due to the skill level of the worker and the progress of time, and is used for task distribution. It is possible to calculate a high expected time, always perform the optimal task distribution, and improve the work efficiency of the workflow.

  Furthermore, in order to manage worker information between clients, the server sets a substitute agent in a timely manner based on the information. Therefore, it is not necessary to set a specific worker as a substitute in advance, and a system configuration that can flexibly cope with changes in the number of workers and changes in skill level is possible.

  In addition, since the operator can set in detail whether or not to substitute, slips that are not desired to be shown to a third party such as confidential documents are not distributed without permission, leading to improved security.

  Furthermore, by displaying the difference between the target time and the actual work time, it can be used as a judgment material for training human resources and reviewing the system configuration.

  In addition, since the expected time until the end of processing is known in the workflow of a series of tasks, scheduling can be easily performed and more efficient tasks can be performed.

  As described above, it has task information 109 for storing processing information such as voting and approval generated from the request of the worker, and the processing time calculation unit 106 and the workflow control unit 105 stay in the routed node. The process and time required for the task to be processed as time elapses are simulated, and the task is determined from the processing history information 112 storing the skill and processing history of the worker for each client machine and the information obtained by the task time analysis means. The distribution conditions are analyzed, tasks are distributed to other nodes, and the processing is performed.

  In a group of nodes forming a business process, tasks generated from other business processes for each node are mixed and waiting for processing, and tasks are processed in parallel for each node. Based on the processing history information 112, the processing time calculation unit 106 calculates the processing load time of the node and the task as the scheduled processing time from the cumulative tasks related to the processing capacity and processing wait.

  Furthermore, the processing history information 112 owned as its own processing history information for each client machine is shared between the client machines, and the client machine searches, updates, and adds processing history storage information of other client machines.

  Also, based on the task distribution conditions defined in the distribution setting file, it is determined whether the task can be distributed, and the current skill of the worker based on the processing history information 112 and the task processing load indicated by the scheduled processing time. From this information, the task is distributed to the optimal worker and the substitution is designated.

  Therefore, each client used by the worker has work history information including worker skill information called processing history information, taking into account the above-mentioned skill information of the processing history information and the increase / decrease in the number of tasks as time progresses. The actual processing time is calculated by multiplying the number of remaining tasks of the node, and the first purpose is achieved by distributing the task to the agent based on the calculated time.

  Further, the server searches the work history of the processing history information shared by the client, and if there is a record, the server distributes the task in a timely manner as a substitute worker, thereby achieving the second purpose.

  Furthermore, a condition file in which conditions for performing proxy processing are set is prepared for each person in charge, and the server can distribute tasks according to the conditions by reading this file, thereby achieving the third object.

  Further, the fourth object is achieved by determining the route from the process information and the processing history information, comparing the actual processing time with the preset target time, and displaying the difference between the values on the process map.

  Therefore, since each client has processing history information having the skill information of the worker, even if the number of processes that can be handled by the worker increases or decreases, it is possible to cope with the server without any change.

  In addition, the estimated time required for processing is calculated by taking into account the increase and decrease of the accumulated task due to the skill level of the worker and the progress of time, and is used for task distribution. It is possible to calculate a high expected time, always perform the optimal task distribution, and improve the work efficiency of the workflow.

  In order to manage worker information between clients, the server sets a substitute agent in a timely manner based on the information. Therefore, it is not necessary to set a specific worker as a substitute in advance, and a system configuration that can flexibly cope with changes in the number of workers and changes in skill level is possible.

  Since the operator can set in detail whether or not to substitute, slips that are not desired to be shown to a third party such as confidential documents are not distributed without permission, leading to improved security.

By displaying the difference between the target time and the actual work time, it can be used as a judgment material for training human resources and reviewing the system configuration. In addition, since the expected time until the end of processing is known in the workflow of a series of tasks, scheduling can be easily performed and more efficient tasks can be performed.

  It is characterized by searching for clustered client machines and assigning tasks to the most appropriate agent when task retention occurs for a regular workflow process.

  Further, it is characterized in that the total time required for task processing is displayed at an arbitrary timing.

  A configuration in which any or all of the above-described modifications are combined is also included in the present invention.

  The configuration and contents of the various data described above are not limited to this, and it goes without saying that the various data and contents are configured according to the application and purpose.

  Although one embodiment has been described above, the present invention can take an embodiment as, for example, a system, apparatus, method, program, or recording medium, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

  The configuration of a data processing program that can be read by a computer constituting the workflow system according to the present invention will be described below with reference to the memory map shown in FIG.

  FIG. 28 is a diagram for explaining a memory map of a recording medium (storage medium) for storing various data processing programs that can be read (read) by a computer constituting the workflow system according to the present invention.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

  The functions shown in FIGS. 12, 17, 18, 19, 20, 22, 25, 26, and 27 in this embodiment may be executed by a host computer by a program installed from the outside. Good. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium recording software program codes for realizing the functions of the above-described embodiments is supplied to a system or apparatus, and a computer (or CPU or MPU) of the system or apparatus stores the recording medium in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the programmed program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention. .

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

It is a schematic diagram which shows an example of a structure of the workflow process in the workflow system which shows 1st Embodiment concerning this invention. It is a system configuration figure showing an example of the composition of the workflow system which shows a 1st embodiment concerning the present invention. It is a functional block diagram for demonstrating the workflow system shown in FIG. 2 from a functional viewpoint. FIG. 3 is a block diagram illustrating an example of a computer configuration applicable to the client and workflow server illustrated in FIG. 2. FIG. 3 is a data configuration diagram illustrating an example of a data configuration of process definition information illustrated in FIG. 2. FIG. 3 is a data configuration diagram illustrating an example of a data configuration of task information illustrated in FIG. 2. FIG. 3 is a data configuration diagram illustrating an example of a data configuration of processing required time information illustrated in FIG. 2. It is a data block diagram which shows an example of a data structure of the worker information shown in FIG. FIG. 3 is a data configuration diagram illustrating an example of a data configuration of processing history information illustrated in FIG. 2. FIG. 3 is a data configuration diagram illustrating an example of a data configuration of a condition setting file illustrated in FIG. 2. FIG. 11 is a schematic diagram illustrating an example of a constant setting screen for setting the required processing time information illustrated in FIG. 7, the worker information illustrated in FIG. 8, and the condition setting file illustrated in FIG. 10. It is a flowchart which shows an example of the 1st control processing in the workflow system of this invention. It is a schematic diagram which shows the screen transition of the client according to the process shown in FIG. It is a schematic diagram which shows an example of the actual process required time display in the workflow system of this invention. It is a schematic diagram which shows an example of the progress status display in the workflow system of this invention. It is a schematic diagram which shows an example of the target time display in the workflow system of this invention. It is a flowchart which shows an example of the 2nd control processing in the workflow system of this invention. It is a flowchart which shows an example of the 3rd control processing in the workflow system of this invention. It is a flowchart which shows an example of the 4th control processing in the workflow system of this invention. It is a flowchart which shows an example of the 5th control processing in the workflow system of this invention. FIG. 5 is a schematic diagram modeling a connection between a plurality of clients and a workflow server in the present embodiment. It is a flowchart which shows an example of the 6th control processing in the workflow system of this invention. It is a schematic diagram which shows the state after automatic distribution in the workflow system of this invention. It is a schematic diagram which shows the state after automatic distribution in the workflow system of this invention. It is a flowchart which shows an example of the 8th control processing in the workflow system of this invention. It is a flowchart which shows an example of the 9th control processing in the workflow system of this invention. It is a flowchart which shows an example of the 10th control processing in the workflow system of this invention. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read (read) with the computer which comprises the workflow system which concerns on this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 101 Network 102 Client 103 User interface 104 Workflow server 105 Workflow control part 106 Processing time calculation part 107 Waiting task analysis part 108 Process definition information 109 Task information 110 Processing time information 111 Worker information 112 Processing history information 113 Warning notification part 114 Processing history information control unit 115 Condition setting file

Claims (7)

In a workflow system consisting of a client / server system,
A task management means for managing the processing status of a task generated from a business process in which a plurality of nodes as workflow processing units are combined in a predetermined order;
Processing history information storage means for storing past processing history information for each node;
The time required for processing at an arbitrary node forming the business process of the task generated from the business process is calculated from a value calculated based on the number of tasks staying at the node and the past processing history of the node. Calculating means for calculating by subtracting a total value of the required processing time of the generated task at a node upstream from the node;
A workflow system characterized by comprising:   Each client machine acquires processing history information for each node from the processing history information storage means for storing past processing history information for each node, and updates for adding or updating the processing history information for each node from the storage means of the other client machine The workflow system according to claim 1, further comprising: means. A distribution condition storage means for storing a processing history as a task distribution condition;
A distribution unit that distributes a task to a node corresponding to a processing history that matches a processing history stored in the distribution condition storage unit;
The workflow system according to claim 1 or 2, further comprising: A distribution condition storage means for storing a processing target time at each node of the task as a task distribution condition;
Distributing means for distributing tasks to nodes whose processing required time calculated by the calculating means is within the processing target time;
The workflow system according to claim 1 or 2, further comprising: In a control method of a workflow system composed of a client / server system,
A task management step for managing the processing status of a task generated from a business process in which a plurality of nodes as workflow processing units are combined in a predetermined order;
A processing history information update step of storing processing history information processed in the past for each node in the storage means when processing the node;
The time required for processing at an arbitrary node forming the business process of the task generated from the business process is calculated from a value calculated based on the number of tasks staying at the node and the past processing history of the node. A calculation step of calculating by subtracting a total value of the processing time required for the generated task at a node upstream from the node;
A method for controlling a workflow system, comprising:   The program for performing the control method of the workflow system described in Claim 5.   6. A recording medium storing a computer-readable program for executing the workflow system control method according to claim 5.

Images