AU3817802A - Computer executable workflow control system - Google Patents

Description

AUSTRALIA

PATENTS ACT 1990 DIVISIONAL APPLICATION NAME OF APPLICANT(S): FMR CORP.

ADDRESS FOR SERVICE: DAVIES COLLISON CAVE Patent Attorneys 1 Little Collins Street Melbourne, Victoria 3000.

INVENTION TITLE: "COMPUTER EXECUTABLE WORKFLOW CONTROL SYSTEM" The following statement is a full description of this invention, including the best method of performing it known to us: 1 COMPUTER EXECUTABLE WORKFLOW CONTROL SYSTEM BackQround of the Invention The invention relates generally to computer executable workflow management and control systems and more particularly to computer system executable methods for controlling access to, or processing of, a work item in a database of workflow work items stored by the computer system.

As is known in the art, members of an organization having an organizational structure are provided work items for execution from a database of unexecuted work items. These work items represent tasks such as filling out documents, returning-.telephone calls to potential or existing customers, initiating transactions, or similar duties. Work items may arrive at the database from outside the organization or from inside the organization or both. For example, if the organization provides financial services, the work items may relate to client account maintenance, buy and sell orders, internal management directives, and the like.

Efficiency gains can be accomplished by implementing a workflow management system that automates a process for distributing the work items to the members o#the organization operators). The work items a Watored in a database. Associated with.the work items 'is definitional data. The definitional data includes a plurality of definitional data items. Each definitional data item includes, for example: information about steps nodes) in a process for manipulating the work item; information about a characteristic of a list a queue associated with a node) of work items appropriate for execution in connection with a node; information about a rule specifying a protocol for executing the work item, such as a display characteristic for the work item; 2 or information about a characteristic of the operator, or operators, who may work on the work item. In general, a node typically represents a single task in a work environment; for example, the single task may be "submitting new account applications." More particularly, a node represents a unit step of work specified in one or more processes; for example, a process for handling new account applications may have a node representing a unit step being "new account application approval." Each node may be used in more than one process and may be associated with a department having responsibility for the single task or unit step of work.

In the workflow management system, each membeY-fthe organization each operator) is situated at a computer station, such as a personal computer. The computer stations are connected to a computer system running a workflow application program. The operator requests a work item from the database. After a work item is assigned, processed, displayed in accordance with the definitional data, and then completed by the operator, a new work item is provided from the database to the computer station in response to another request from the computer station.

h Some organizations are structured into separate izations such as departments or divisions or si business units, with each such sub-organization requiring some control over access to and processing of the sub-organization's work items. For example, the suborganizations may require different sets of rules governing the flow of work items but may also need to share work items. If the sub-organizations use separate databases to control access and processing, and maintain separate sets of rules, the work items may be shared by making and distributing copies of the work items. In 3 such cases, it is necessary to keep track of the copies and also to ensure cross-database consistency of definitional data concerning the shared work items.

One proposed system allows a single database to be used to store the work items of different suborganizations. In the proposed system, each suborganization maintains general access rules unrelated to the specific type of business activity performed by the sub-organization. Further, with the proposed system the access rules maintained by each sub-organization are provided specifically to prevent access by the suborganization to work items not pertaining to the suborganization. A change in the structure of the organization or one of the sub-organizations typically requires changes to each sub-organization's access rules.

Summary of the Invention In accordance with one aspect of the invention, a computer system executable method is provided for controlling access to, or processing of, a work item.

The work item is stored in a database of work items for subsequent execution by at least one operator. The database (perhaps along with some computing resources associated with the database) is used by a plurality of organizations. The operator belongs to one of the or~Cuzations. The method stores in a memory a plurality oJXgstization identifiers. Each one of the SoS zation identifiers is associated with a corresponding one of the organizations. Definitional data items are also stored in the memory. Each one of the definitional data items is associated with the one of the organizational identifiers. The method provides the operators with access to, or allows the operators to be affected by, one of the definitional data items only if the operator is associated with the same organization identifier associated with the definitional data item.

4 The definitional data item controls access to, or processing of, the work item.

With this method, because each organization has its own identifier and the definitional data item is associated with one of the identifiers (and hence with a specific organization), establishment of, and subsequent change to, work item flow through a single workflow system used by different organizations is facilitated.

For example, an additional organization may be added simply by associating the additional organization with an additional organization identifier in the first memory section. In addition, the method allows efficient use of the workflow system's storage facilities, because multiple organizations' definitional data items may be stored together while remaining logically separate as a result of the organization identifiers.

Implementations of this aspect of the invention may include one or more of the following features. The memory may store a data structure relating each one of the plurality of operators with one of the organization identifiers; and one of the operators of the organization may be provided with access to, or may be affected by, one of the definitional data items only if the data structure stored in the third memory section associates thWons of the operators with the same organization i associated with the one of the definitional Sdttiems. The definitional data item may include: information about a node corresponding to a step in a process for manipulating the work item; a rule specifying a display, transfer, or processing characteristic for the work item; information about a characteristic of the operator; information about a characteristic of a queue associated with a node; or information about a setup component such as an item-type code, a status code, or a value group.

5 rn accordance with another aspect of the invention, another computer system executable method is provided for controlling access to, or processing of, work items. The work items are stored in a database of work items for subsequent execution by operators. The method includes storing in a memory: information defining nodes steps, departments, persons) available for use in processing the work items; and a programmable data structure defining an organizational relationship between selected ones of the stored nodes to control the access to, or processing of, the work item. The data structure is programmed to provide the organizational relationship between the nodes to control access to, and processing of, the work item by an operator.

This method allows the progression of work items within an organization to be controlled in accordance with a programmable organizational structure. Such method facilitates assuring that work items are accessible to only selected operators in the organization.

Implementations of this aspect of the invention may include one or more of the following features. The organizational relationship may be hierarchal or matrixoriented. The operator may be associated with one of the noda where each node may correspond to a step in a p~es for manipulating the work item within the ortanization or sub-organization. The method may further include storing definitional data items used in controlling access to, or processing of, the work item.

In accordance with still another aspect of the invention, a computer system executable method is provided for controlling access to, or processing of, a work item. The work item is stored in a database of work items for subsequent execution by an operator in accordance with definitional data stored in the database.

6 The method includes storing in a hierarchy memory section a networked data structure a tree data structure) having networked entries tree entries). The networked data structure corresponds to an organization having nodes for manipulation of work items. The nodes correspond to steps used to process a work item and may represent, for example, departments within an organization or sub-organization, or persons within a department. The organization is organized hierarchally and each networked entry corresponds to one of the nodes.

A process memory section stores a process table specifying a sequence of steps for manipulating the work item by the nodes. A definitional data item memory section. stores a definitional data item associated with the nodes.

With such an arrangement, when a request is received to store in the definitional data item memory section a new definitional data item which is intended to be associated with one of the nodes in violation of the hierarchial structure stored in the hierarchy memory section, the system prevents storage of such violative definitional data item. Thus, because access and processing control is established at a time when the organization is set up when the hierarchy memory sectio~ and the definitional data items are established), a .sed to checking each such work item at a VN qent time when such work items are progressing through the system, this method allows a hierarchal organization to easily control access to, or processing of, work items by placing restrictions on definitional data that will be accepted for storage. Thus, access and processing control is made robust by allowing the organization to establish such control at a time when the organization is setting up defining) a workflow system for manipulating work items or is modifying the 7 setup of the workflow system, as opposed to checking each such work item at a subsequent time as mentioned before.

Brief Description of the DrawinQe Other features and advantages of the invention, as well as the invention itself, will become more readily apparent when read together with the following detailed description taken together with the accompanying drawings, in which: FIG. 1 is a block diagram of a computer system for execution of the methods according to the invention; FIGs. 2-4 are flow diagrams of methods for controlling access to a workflow work item in a database of work items stored by the computer system of FIG. 1 according to the invention; FIGs. 5-7 are block diagrams of data structures and organizational structures used in the methods of FIGs. 2-4; FIG. 8 is an organizational chart useful in understanding features of the invention; FIG. 9 is a block diagram of a data structure used to control workflow in an organization having the organizational chart shown in FIG. 8; FIGs. 10 and 11 are diagrams useful in understanding the workflow process for the organization haXpi'g-the organizational chart shown in FIG. 8.

Description of the Preferred Embodiments Referring now to FIG. 1, a computer system 16 is shown programmed to execute methods shown in FIGs. 2-4 for controlling access to, or processing of, a work item 10. The work item 10 is stored in a database 14 of work items 10 for subsequent execution by an operator, not shown, belonging to an organization. The operator, here exemplified by a person, may in fact be multiple persons or one or more automated operator computer programs. The 8 database 14 is used by a plurality of organizations, here sub-organizations of the organization. (It should be understood, however, that the organizations need not be organizationally related to each other the organizations may merely share the database 14 and perhaps also some computing resources associated with the database 14.) Each step in a process, such as processes 58,, 582, 583, shown in FIG. 10, for manipulating the work item 10 is performed in each sub-organization by an operator or operators assigned to the sub-organization. The method includes storing in a memory section 37 (FIG. sub-organization identifiers (ORG ID). Each one of suborganization identifiers (ORG ID)'is associated with a corresponding one of the sub-organizations, here divisions, DIV1, DIV2, DIV3, and so on) as shown in FIG. 5. Another memory section 39 (FIG. 6) stores a plurality of definitional data items (such as rules 56, 68, 72), each one of the plurality of definitional data items being associated with a corresponding one of the sub-organization identifiers (ORG ID), as shown in FIG.

6. Each one of the definitional data items controls access to, or processing of, the work items. Another memory section 41 (FIG. 7) stores a data structure wherein each one of the operators (OP ID) of the organization is associated with one of the suborganization identifiers (ORG ID), as shown in FIG. 7.

Each one of the operators (such as operators Al, 01, and so on) of the organization is provided with access to, or is affected by, a definitional data item rule 56 or 68), only if the data structure stored in the memory section 41 associates said one of the operators with the same sub-organization identifier associated with said definitional data item in the memory section 39. For example, operator 01 belongs to an organization 9 identified by "ORG ID" as from the memory section 37 operator 01 belongs to DIV1). Thus, from memory section 39, operator 01 is provided with access to, or is affected by, definitional data items 56, 68, 72, 75 but not definitional data item 77 which is associated with ORG ID here, from memory section 37, DIV2.

More particularly, the work item 10 is stored in the database 14 of work items 10 for subsequent execution by one of a plurality of operators (not shown) at one of a plurality of computer stations 12. The database 14 of work items 10 may be implemented using an Oracle® Pyramid" database system version 7.2. The computer system 16 may include a Pyramid" NILEm computer having eight central processing units and two gigabytes of fastaccess memory. Here, an operating system such as Data Center Operating System ("DC-OSx") runs on the computer system 16. The computer system 16 also runs a workflow application program 20 providing key functions used to provide a workflow management system as, for example, described by the Workflow Management Coalition in Workflow Management Coalition Terminology Glossary Issue 2.0 (1996), incorporated by reference.

Each one of the computer stations 12 may be a personal computer running an operating system such as tWiosoft® Windows® 3.1, Microsoft® Windows®95, or SMirosoft® Windows® NT". The computer system 16 and the computer stations 12 are interconnected across a bidirectional data connection bus 18 such as a network connection provided by a computer network using a TCP/IP protocol.

Referring again to FIGs. 2-4, a work item 10 is stored in the database 14 (step 300). The memory section 37 (FIG. 5) stores an organizations data structure associating a first sub-organization 42 (FIG. here 10 Division-1 (DIV1) of the organization, with a first identifier ORG ID), here 44, and also associating a second sub-organization 46 (FIG. here Division 2 (DIV2), with a second identifier, here 47 (step 310). The memory section 39 (FIG. 6) stores another data structure such as a rules data structure 48 associating each one of a plurality of definitional data items (to be described) with one of the identifiers, such as a rule 56 with the first identifier ORG ID 1, which corresponds to DIV1 42 (step 320). The memory section 41 (FIG. 7) stores an operator/administrators data structure associating the operator/administrator with one of the identifiers 44, 47 (step 330). Thus, for example, from the memory section 41, operator '(OP ID) Al, having log-in ID Al, is indicated as being an administrator associated with ORG ID 1, and hence, from the memory section 37, with DIV1 42. As shown in FIG. 7, OP ID 02 indicates that such operator/administrator is an operator associated with ORG ID 2 and hence, from the memory section 37, associated with DIV2 46. Each operator/administrator, hereinafter being referred to as an operator, is then provided with access to one of the definitional data items the rule 56), or is affected by said one of the definitional data items only if the operators data structure 50 associates the operator with the same identifier the first identifier 44) associated with the one of the definitional data items the rule 56) (step 340).

For example, operator. 01 is, from memory section 41, associated with ORG ID 1. From the memory section 37, ORG ID 1 is associated with DIV1 42. Thus, from the memory section 39, operator 01, as well as all members in DIV1, are able to process work items defined by rules 56, 68, 72, 74 and 75. Here, rule 56 defines a NEW ACCOUNT APPLICATION and rule 68 defines a NEW ACCOUNT APPROVAL.

11 Thus, operator 01 can handle new account applications and new account approvals. On the other hand, operator 02 and all other operators belonging to DIV2 are able to process work in accordance with rule 77 because such operators are in DIV2 46. It is noted that as additional sub-organizations such as DIV3 and DIV4 are added to the organization, one merely adds additional ORG IDs, here ORG ID and ORG ID respectively, for the new suborganizations DIV3, DIV4 to the memory section 37. Then, as operators are added, the memory section 41 associates these new operators, such as OP3, OP4 with the new suborganizations. Rules for the new sub-organizations may be easily added, removed, or modified in the memory section 39. It is also noted that if a sub-organization is deleted from the organization, or if the organization wished to change the rules, or of the organization wished to add, delete, or change operators, one merely provides proper changes to the appropriate one, or ones, of the memory sections 37, 41, 39.

The use of the three memory sections 37, 41, 39 allows for additional flexibility in controlling access to, or processing of, a work item. More particularly, referring again to FIG. 8, it is noted that each suborganization 42, 46 is shown with a networked data stxucture, here a tree data structure, having networked entries, here tree entries. The tree data structure corresponds to an organization, here a sub-organization, having nodes A-L for manipulation of work items. The organization, here sub-organization, is organized hierarchally and each tree entry corresponds to one of the nodes. The nodes A-L correspond to steps used to process a work item and may represent, for example, departments within the sub-organization or persons within a department. For example, if the nodes are departments, departments represented by Nodes E and F report into the 12 department represented by Node B and the department represented by Node B reports into the department represented by Node A. If the nodes are persons in a department, persons represented by Nodes E and F report into the person represented by Node B and the person represented by Node B reports into the department manager represented by Node A.

The networked data structure, here tree data structure 65, appears in an organization data structure 64 stored in another memory section 73 (FIG. Thus, Nodes A-I are shown as belonging within ORG ID 1 DIV1 42), and Nodes J-L are shown as belonging within ORG ID 2 DIV2 46). Further, Nodes B, C and D are shown as being dependent on Node A; Nodes E and F as being dependent on Node B; Nodes G and H as being dependent on Node C; Node I as being dependent on Node D; and Nodes L and K as being dependent on Node J.

A process table 69 (FIG. 10) specifying sequences of steps for manipulating work items is stored in another memory section (not shown). With one process 581, the work item is to pass from Node A to Node B and then to Node C. In another process 582, the work item is to pass from Node B to Node A to Node I. In a third process 583, the work item is to pass from Node E to Node F and then to !bdi C.

k The memory section 41 (FIG. 7) stores definitional datiPStems (here operators) associated with the nodes.

Thus, in this example, the OP ID Al is associated with Node B, OP 01 with Node K and so forth.

In operation, let it be assumed that a request is received to store in the memory section 39 (FIG. 6) a proposed definitional data item (here a rule) associated with one of the nodes, say Node C, to cause a work item to be transferred to Node C after the work item has been processed by Node B. Let it also be assumed that another 13 definitional data item defining the work item is associated with node B. Because Node C in not dependent on Node B, the request to store the proposed definitional data item (to cause a transfer of the work item to Node C after the work item is processed by Node B) is invalid because such request violates the hierarchial structure established in memory section 73 (FIG. Therefore, the system prevents this "invalid" requested definitional data item from being stored in the memory section 39.

Because access and processing control is established in memory section 73 at a time when the workflow system is set up or defined, as opposed to checking each such work item at a subsequent time when such work items are progressing through the system, this method allows a hierarchal organization to easily control access to, or processing of, work items by placing restrictions on definitional data that will be accepted for storage.

Thus, access and processing control is made robust by allowing the organization to establish such control at a time when the organization is setting up defining) a workflow system for manipulating work items, as opposed to checking each such work item at a subsequent time when such work items are progressing through the system.

Referring again to FIG. 6, it is noted that the definitional data items (such as the rules 56, 68) may incI;iki information about a node, an "ASSOCIATED NODt- Thus, for example, definitional data item 56 has as an ASSOCIATED NODE, Node A. Referring also to FIG.

11, the system stores a repertoire of nodes 52,-52, available for use in processing the work item. As noted above, each one of the nodes 521-52. may, for example, correspond to a step in a process. Here, nodes 521-5212 correspond to Nodes A-L, respectively, as indicated. By way of example, in exemplary process 58,, the sequence of process steps is Node A node 52,) followed by Node 14 B node 522) followed by Node C node 52,).

In exemplary process 582, the process steps are Node B node 522) followed by Node A node 521) followed by Node I node 5212). It is noted that the same Node, here Node B, may be used in more than one process. Thus, for exemplary process 583, the process follows Nodes'E, F and C, sequentially; Node C also being used in process 58,. Further, for each of the nodes 521- 52n, the operator is able to use the nodes 521-52n in one of the processes 58,-583 only if the operators data structure 50 (FIG. 7) associates the operator with the same identifier (ORG ID) that is associated with the nodes 52 52 n in a nodes data structure 60 stored in another memory section 175 (FIG. It is noted in comparing the node data structure 60 (FIG. 6) with FIG.

8, that the node data structure 60 is constructed to replicate the organizational relationship shown in FIG.

8. Further, because the nodes data structure 60 (FIG. 6) associates node E with the first identifier 44 (ORG ID here identifying Division DIV1 42 (FIG. such use of node E is possible only if the operators data structure 50 (FIG. 7) associates the operator with the first identifier ORG ID DIV1 42. Thus, referring to FIG. 7, such use is possible in the cases of operators "AdminOt and "Operl". For example, operator 02 being in DIVI& cannot be associated with, or perform a process stef represented by, any one of the Nodes A-I in DIV1 42.

Rather, such operator 02, being in DIV2 46, can be associated with Nodes J, K, and/or L.

The definitional data item may include a rule, such as rule 56 (Fig. 6) which specifies a display characteristic (not shown) for the work item 10. For example, the work item 10 may involve a new account application and may have various fields providing information such as an amount of money involved, an 15 account number, a name of an accountholder, an indicator of the work item's status, and a due date. If so, the rule 56 may specify that the account number and the name of accountholder should be displayed on a display screen 62 of the operator's computer station 12 in accordance with a predefined set of codes. Rule 56, however, being associated with ORG ID is not able to be used to display the work item 10 to the operator unless the operators data structure 50 associates the operator with the same identifier that is associated with the rule 56 only if the operator is in ORG ID DIV1 42).

For instance, because the rules data structure 48 associates the rule 56 with the ORG ID 44 associated with the first sub-organization (DIV1) 42 (FIG. the operator is able to view the work item 10 on the screen 62 of the operator's computer station 12 only if the operators data structure 50 associates the operator with the ORG ID DIV1 44 identifier. Again, such an association exists in the cases of operators "Adminl" and "Operl".

What applies as described above for the nodes 521- 52n and the rule 56 also applies if the definitional data item includes other information, either in addition to or instead of node or rule information. The other information may include, information about a charatceristic of a queue (not shown) associated with one of tIe& nodes 52,-52,. The queue is used to keep track of work items 10 that are appropriate for execution in connection with the one of the nodes 5 2 For example, if Node J 52,0 represents a department responsible for approving purchase orders, the queue may be associated with Node J 5210 and may keep a list of purchase order work items awaiting approval by the department. In another example, the other information may include information about one or more setup 16 components (not shown) including but not limited to itemtype codes, status codes, and value groups. Each setup component is used by an administrator (not shown) of the workflow system to define how operators may interact with a displayed work item 10. For example, the administrator may specify six status codes (including, e.g., "SUBMITTED", "IN PROGRESS", "AWAITING

APPROVAL",

"APPROVAL DENIED", "APPROVAL GRANTED", and "COMPLETED") for indicating the progress of one of the work items in the workflow system, but may also specify using one of the value groups to restrict one of the operators to selecting from among only three of the six.

More particularly, referring now also to FIG. 8, access control is provided not only between the suborganizations 42, 46 as described above but also within each of the first and second sub-organizations 42, 46.

As mentioned before, the work item 10 is stored in the database 14 (step 400). The memory section 175 (FIG. 6) stores information (such as the nodes data structure defining the nodes 52 and the memory section 73 stores a programmed data structure (such as the structure defining an organizational relationship between a first one of the nodes 52 and a second one of the nodes 52 (step 410). This programmed data structure is then used to provide the organizational relationship between the nodess52 to control access to, and processing of, the by one of the operators (step 420).

As mentioned before, in the operators data structure 50, the operator is associated with one of the nodes 521-52,. For example, in the case of operator "Operl", the operator is associated with node E 52s. As shown in FIG. 8, Node E 52, corresponds to one of the steps, here the step associated with node 524 (specifically in one of the processes 58, here process 583 for manipulating work items 10. The 17 definitional data item (such as a rule) discussed above is associated not only with one of the sub-organizations 42, 46 but also with one of the nodes 521-52,. For example, in the rules data structure 48, rule "Rulel" is associated with node A. As discussed above, the definitional data item may include a rule specifying a display characteristic for the work item 10, information about a characteristic of the operator, or other information, including information about a characteristic of a queue associated with the first one of the nodes 52.- 52n.

In a particular example executing steps shown in FIG. 4, the organization hierarchy data structure 64 stores the tree data structure 65having tree entries 66A-I (step 500). The tree data structure 65 corresponds to the first sub-organization 42. The sub-organization 42 is organized hierarchally and each tree entry 66A-I corresponds to one of the nodes A-I 52,-52, in the first sub-organization 42. The process table 69 specifies a sequence of steps in one of the processes 583 (step 510). Also stored is the new account approval rule 68 associated with node B 52, (step 520). The new account approval rule 68 defines how a new account approval item (not shown) is displayed on the operator's screen 62.

Node B 522 corresponds to. tree entry 66B. As shown in FIG S9 entry 66B defines a subset 70 of the tree entries 66A66L.in the tree data structure 65. The subset consists of entry 66B and all the tree entries dependent on entry 66B entries 66E, 66F). FIG. 8 shows how the subset 70 corresponds to a portion of DIV1.

A request is received to store a proposed new rule 72 (step 530). The rule "Rulel" 56 defines how a new account application work item is handled at node E.

Executed only if the new account application work item is complete, the proposed new rule 72 is configured to 18 transfer the new account application work item from node E to node F and also to provide the new account approval work item to node F. Such a transfer is intended to allow another operator (not shown) to review the complete new account application and fill out the new account approval work item. Thus, the new rule relies on the new account approval rule 68 and corresponds to step F in the process 583.

Because the new rule 72 is configured for transferring information to node F, the new rule 72 is associated with node F, which corresponds to entry 66F in the tree data structure 65. It is determined whether entry 66F belongs to the subset 70 (step 540). In fact, entry 66F does belong-to the subset 70, producing a positive outcome. Based on the positive outcome of the determination, the new rule 72 is stored (step 550).

In another example, another request is received, involving a proposed rule "Rule4" 74. The proposed rule 74 is associated with node C and is intended to transfer the new account application to node C if the other operator indicates approval in the new account approval work item. Thus, like the new rule 72 mentioned before, the proposed rule 74 also relies on the new account approval rule 68, which relates as described above to the subaetz,70 including entries 66B, 66E, and 66F. As a result, the proposed rule 74 will not be stored, because 'the-proposed rule is associated with node C which corresponds to entry 66C which is not included in the subset To allow the proposed rule 74 to be stored, at least one of two changes must be made. In the first of the two changes, the proposed rule 74 is changed to cause the new account application to be transferred not to node C but instead to one of the nodes 521-52n, here node B 522, E 525, or F 52,, corresponding to one of the entries 19 66B, 66E,'or 66F in the subset 70. This first change allows the proposed rule 74 to be associated with such a node B 522, E 525, or F 526.

In the second of the two changes, the subset 70 is replaced with a larger subset that includes entry 66C.

In the case of the first sub-organization 42, the larger subset is defined by entry 66A and in fact includes the entire first sub-organization 42 (DIVi). To gain the larger subset, the new account approval rule 68 is associated in the memory section 39 with node A instead of node B.

As used herein, each of the memory sections (such as memory sections 37, 39, 41, 175, 73) may represent a memory section being physically separate from the others or may represent a logical section of an overall memory all memory storage) of the computer system 16. As used herein, each of the memory sections 37, 39, 41, 175 may be made up of any type of data storage media and in fact may be made up of more than one type of data storage media, including volatile data storage media and nonvolatile data storage media. Such data storage media types include but are not limited to semiconductor memory dynamic RAM, static RAM), magnetic memory magnetic tape, hard disk, floppy disk), optical memory CD-ROM), and magneto-optical memory writable optical disk).

The technique the methods described above) may be implemented in hardware or software, or a combination of both. Preferably, the technique is implemented in computer programs executing on programmable computers that each include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Program code is applied to data entered 20 using the-input device to perform the method described above and to generate output information. The output information is applied to one or more output devices.

Each program is preferably implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the programs can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language.

Each such computer program is preferably stored on a storage medium or device ROM or magnetic diskette) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to'perform the procedures described in this document. The system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner.

Other embodiments are within the scope of the following claims. For example, one of the suborganizations 42, 44 may not be simply hierarchal but may instead be matrix-oriented so that at least of the nodes 52 ia. directly dependent from multiple others of the noddi 1'52. In addition, whether the operator has access 'o the- definitional data item or is affected by the definitional data item may depend not on whether one of a nodes 52 52 n corresponds to one of entries 66B, 66E, or 66F belonging to the subset 70. Instead, such access may depend on a horizontal position of one of the nodes 52.

For example, in the first sub-organization 42, such horizontal positioning divides the nodes 52 into three categories: node A, nodes B, C, D, and nodes E, F, G, H, I. In such a case, whether the operator has 21 access to a particular definitional data item or is affected by the particular definitional data item may depend on whether the operator and the particular definitional data item are associated with the same category.

In addition, the networked data structure may not be a tree data structure but may instead be another type of data structure reflective of nodes organized other than as the hierarchy described above.

Furthermore, the identifiers are not limited to use in logically separating the workflows of multiple sub-organizations of the same organization as described above. The identifiers may also be used for logically separating the workflows of multiple fully-independ norganizations. For example, using the identifiers, a workflow services business may use a single work item database supported by a single computer system to manage the workflows of multiple companies even though these companies are not commonly owned and are in fact completely unrelated to each other.

Claims (31)

1. 2. The method of claim I, wherein the method further comprises storing a data structure relating each one of the plurality of operators with one of the organization identifiers; and providing one of the operators of the organization with access to, or affecting said operator by, one of the definitional data items only if the data structure stored in the third memory section associates the one of the operators with the same organization identifier associated with the one of the definitional data items.
2. 3. The method of claim 1 wherein the definitional data item comprises information about a node corresponding to a step in a process for manipulating the work item.
3. 4. The method of claim 1 wherein the definitional data item comprises a rule specifying a display characteristic for the work item. The method of claim 1 wherein the definitional data item comprises a rule specifying a transfer characteristic for the work item.
4. 6. The method of claim 1 wherein the definitional datai item comprises a rule specifying a processing characteristic for the work item.
5. 7. The method of claim 1 wherein the definitional data item comprises information about a characteristic of the operator. 24
6. 8. "The method of claim 1 wherein the definitional data item comprises information about a characteristic of a queue associated with a node.
7. 9. A computer system executable method for controlling access to, or processing of, work items, the work items being stored in a database of work items for subsequent execution by operators belonging to an organization, the method comprising storing in a memory: information defining nodes available for use in processing the work items; and a programmable data structure defining an organizational relationship between selected ones of the stored nodes to control the access to, or processing of, the work item; and providing the organizational relationship between the nodes to control access to, and processing of, one of the work items by one of the operators. The method of claim 9, wherein the organizational relationship is hierarchal.
8. 11. The method of claim 9, wherein the organizational relationship is matrix-oriented. i2.. The method of claim 9, wherein the operator is aaiated with one of the nodes.
9. 13. The method of claim 9, wherein each node corresponds to a step in a process for manipulating the work item. 25
10. 14." The method of claim 9, wherein the method further comprises storing a definitional data item, the definitional data item being associated with one of the nodes; and using the definitional data item in a determination about whether to provide the operator with access to the work item. The method of claim 14 wherein the definitional data item comprises a rule specifying a display characteristic for the work item.
11. 16. The method of claim 14 wherein the definitional data item comprises information about a characteristic of the operator.
12. 17. The method of claim 14 wherein the definitional data item comprises information about a characteristic of a queue associated with one of the nodes.
13. 18. The method of claim 14 wherein the definitional data item comprises information about a setup component associated with one of the nodes.
14. 19. The method of claim 18 wherein the setup cqmpodent comprises an item-type code. The method of claim 18 wherein the setup component comprises a status code.
15. 21. The method of claim 18 wherein the setup component comprises a value group. 26
16. 22.- A computer system executable method for controlling access to a work item, the work item being stored in a database of work items for subsequent execution by an operator in accordance with definitional data stored in the database, the method comprising storing in a first memory a networked data structure having networked entries, the networked data structure corresponding to an organization having nodes for manipulation of work items, the organization being organized hierarchally, each networked entry corresponding to one of the nodes; storing in a second memory a process table specifying a sequence of steps for manipulating the work item; storing in a third memory a first definitional data item associated with a first one of the nodes, the first node corresponding to a first one of the networked entries, the first networked entry defining a subset of the networked entries in the networked data structure, the subset consisting of the first networked entry and all networked entries dependent from the first networked entry; receiving a request to store in a fourth memory a second definitional data item associated with a second one of the nodes, the second item relying on the first item, the second node corresponding to one of the steps in the sequence, the second node corresponding to a second one of the networked entries in the networked data structure; determining whether the second networked entry belongs to the subset of networked entries defined by the first networked entry; and based on the outcome of the determination, storing in the fourth memory the second definitional data item. 27 23; Computer software, residing on a computer- readable storage medium, comprising instructions for use in a computer system to control access to, or processing of, a work item, the work item being stored in a database of work items for subsequent execution by at least one operator, the database being used by a plurality of organizations, the operator belonging to one of the organizations, the instructions causing the system to: store in a memory: a plurality of organization identifiers, each one of the organization identifiers being associated with a corresponding one of the organizations; and, a plurality of definitional data items, each one of the plurality of definitional data items being associated with a corresponding one of the organization identifiers, each one of the plurality of definitional data items controlling access to, or processing of, work items; and provide the operator with access to, or allow said operator to be affected by, one of the definitional data items only if the operator is associated with the same organization identifier associated with the definitional data item, the definitional data item controlling access to, or processing of, the work item.
17. 24. The computer software of claim 23, further comprz±sing instructions causing the system to store a data structure relating each one of the plurality of operators with one of the organization identifiers; and provide one of the operators of the organization with access to, or affect said operator by, one of the definitional data items only if the data structure stored in the third memory section associates the one of the operators with the same organization identifier associated with the one of the definitional data items. 28 The computer software of claim 23 wherein the definitional data item comprises information about a node corresponding to a step in a process for manipulating the work item.
18. 26. The computer software of claim 23 wherein the definitional data item comprises a rule specifying a display characteristic for the work item.
19. 27. The computer software of claim 23 wherein the definitional data item comprises a rule specifying a transfer characteristic for the work item.
20. 28. The computer software of claim 23 wherein the definitional data item comprises a rule specifying a processing characteristic for the work item.
21. 29. The computer software of claim 23 wherein the definitional data item comprises information about a characteristic of the operator. The computer software of claim 23 wherein the definitional data item comprises information about a characteristic of a queue associated with a node. 29 31; Computer software, residing on a computer- readable storage medium, comprising instructions for use in a computer system to control access to, or processing of, work items, the work items being stored in a database of work items for subsequent execution by operators belonging to an organization, the instructions causing the system to: store in a memory: information defining nodes available for use in processing the work items; and a programmable data structure defining an organizational relationship between selected ones of the stored nodes to control the access to, or processing of, the work item; and provide the organizational relationship between the nodes to control access to, and processing of, one of the work items by one of the operators.
22. 32. The computer software of claim 31, wherein the organizational relationship is hierarchal.
23. 33. The computer software of claim 31, wherein the organizational relationship is matrix-oriented.
24. 34. The computer software of claim 31, wherein the operator is associated with one of the nodes. The computer software of claim 31, wherein each node corresponds to a step in a process for manipulating the work item. 30
25. 36. The computer software of claim 31, wherein the computer software further comprises instructions causing the system to: store a definitional data item, the definitional data item being associated with one of the first and second nodes; and use the definitional data item in the determination about whether to provide the operator with access to the work item.
26. 37. The computer software of claim 36 wherein the definitional data item comprises a rule specifying a display characteristic for the work item.
27. 38. The computer software of claim 36 wherein the definitional data item comprises information about a characteristic of the operator.
28. 39. The computer software of claim 36 wherein the definitional data item comprises information about a characteristic of a queue associated with the first node. The computer software of claim 36 wherein the definitional data item comprises information about a setup component associated with one of the nodes. S 41. The computer software of claim 40 wherein the setup component comprises an item-type code.
29. 42. The computer software of claim 40 wherein the setup component comprises a status code.
30. 43. The computer software of claim 40 wherein the setup component comprises a value group. S. P 31
31. 44. Computer software, residing on a computer- readable storage medium, comprising instructions for use in a computer system to control access to a work item, the work item being stored in a database of work items for subsequent execution by an operator in accordance with definitional data stored in the database, the instructions causing the system to: store in a first memory a networked data structure having networked entries, the networked data structure corresponding to an organization having nodes for manipulation of work items, the organization being organized hierarchally, each networked entry corresponding to one of the nodes; store in a second memory a process table specifying a sequence of steps for manipulating the work item; store in a third memory a first definitional data item associated with a first one of the nodes, the first node corresponding to a first one of the networked entries, the first networked entry defining a subset of the networked entries in the networked data structure, the subset consisting of the first networked entry and all networked entries dependent from the first networked entry; receive a request to store in a fourth memory a second definitional data item associated with a second one of the nodes, the second item relying on the first item, the second node corresponding to one of the steps in the sequence, the second node corresponding to a second one of the networked entries in the networked data structure; determine whether the second networked entry belongs to the subset of networked entries defined by the first networked entry; and 4 1 P.OPER\SSB2529682 Divisional 03-05-02.doc-03/05/02 -32- based on the outcome of the determination, store in the fourth memory the second definitional data item. DATED this 3rd day of May, 2002 FMR CORP. by DAVIES COLLISON CAVE Patent Attorneys for the Applicant