Process flow information management system

• US 5,321,605 A
• Filed: 06/01/1990
• Issued: 06/14/1994
• Est. Priority Date: 06/01/1990
• Status: Expired due to Term

• Current Assignee: Freescale Semiconductor, Inc. (NXP Semiconductors NV)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Zhu, Shoarong, Chapman, William, Chang, Gwo-Jer, Fox, DiAnn
• Primary Examiner(s): Envall, Jr., Roy N.
• Assistant Examiner(s): Bodendorf, A.
• Application Number:
  US07/532,310
• Time in Patent Office: 1,474 Days
• Field of Search: 364/DIG. 1, 364/DIG. 2, 364/401, 364/402, 364/403, 364/468, 395/600, 395/650
• US Class Current: 705/7.22
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/0633 Workflow analysis
• CPC Class Codes: G06Q 10/0875 Itemisation or classification of parts, supplies or services, e.g. bill of materials

Abstract

A memory structure and related method for collecting and maintaining data descriptive of a multiplicity of interrelated process flows is disclosed. A complex memory structure includes job entities, operation entities, and process entities. Operation entities are subordinate to job entities, and process entities are subordinate to operation entities. These entities are represented by tables which are linked together to indicate their position in the hierarchy and their sequencing within a process flow. The process entities describe specific activities accomplished by an organization in achieving organizational goals. Typically, resources are either consumed or released, or both, during a process. Bill-of-resource tables are subordinate to process entities and populated with data which identify resources consumed by corresponding processes in the process flow. Attribute tables are subordinate to the resources listed in the bill-of-resources tables and populated with data which identify attribute limitations, durations for which resources are used, and quantities of resources consumed. Branch and condition entities are positioned between operation entities or process entities to initiate alternate process flows to be taken when specified conditions are met. In addition, condition entities may specify conditions to be met before including particular bill-of-resource and attribute tables within a process flow.

Claims

1. A method of associating information comprising the steps of:

translating data descriptive of demand for resources into a generic form comprising said first, second, and third process tables;

constructing a first table, to store data descriptive of a first processes which is to be performed in accomplishing both of said first and second tasks;

constructing a bill-of-resources memory structure which includes a bill-of-resources table;

linking said bill-of-resources memory structure to said first table;

listing, in said bill-of-resources table, a plurality of initially consumed resources which are consumed in said first process;

constructing a second table, to store data descriptive of a second process which is to be performed after said first process in accomplishing only said first task;

constructing a third table, to store data descriptive of a third process which is to be performed after said first task in accomplishing only said second task;

linking said first data to said second data through first condition data;

linking said first data to said third data through second condition data, said first and second condition data operating to distinguish said first and second tasks from one another;

controlling a commitment to use of resource capabilities based on said first data, said second data, said third data, said first condition data and said second condition data; and

performing the preceding steps using a computer, according to a set of predetermined instructions stored in said computer.

2. A method as claimed in claim 1 wherein said bill-of-resources memory structure includes a second bill-of-resources table, and said method additionally comprises the steps of:

defining a rule which operates to associate said bill-of-resources table with said first task and said second bill-of-resources table with said second task; and

associating said rule with one of said first, second, and third tables.

3. A method as claimed in claim 1 additionally comprising the steps of:

constructing an attribute table, said attribute table including a data element describing resource attribute capabilities required of said initially consumed resources by at least one of said first and second tasks; and

linking said attribute table to said bill-of-resources table.

4. A method as claimed in claim 3 additionally comprising the steps of:

constructing a second attribute table, said second attribute table including a data element describing alternate resource attribute capabilities required of said initially consumed resources by said at least one of said first and second tasks;

linking said second attribute table to said bill-of-resources table;

defining a rule which operates to associate said attribute table with said first task and said second attribute table with said second task; and

associating said rule with said bill-of-resources table.

5. A method as claimed in claim 1 additionally comprising the steps of:

constructing a release list, said release list including a least one data element describing a resource released at the end of said first process by at least one of said first and second tasks; and

linking said release list to said first table.

7. A method for managing comprehensive information comprising the steps of:

providing a computer having a programmable memory;

constructing a first memory structure within said computer memory to store data descriptive of resources used in said plurality of interrelated tasks;

constructing a first table for storing data descriptive of a job to be performed by at least one of said tasks, said first table including a data element which describes resources released in accomplishing said plurality of interrelated tasks;

constructing a second table for storing data descriptive of a process to be performed by said at least one of said tasks, said process being a component of said job and representing an activity to be performed by said organization in accomplishing said at least one of said tasks;

linking said first and second tables together within said computer memory;

constructing a third table for storing data which identify at least one of said resources described by data included in said first memory structure, said at least one resource being consumed at said process;

linking said second and third tables together within said computer memory;

linking said third table to said first memory structure within said computer memory; and

performing the preceding steps using said computer, according to a set of predetermined instructions stored in said computer.

8. A method as claimed in claim 7 additionally comprising the step of constructing a fourth table for storing data descriptive of an operation to be performed by said at least one of said tasks, said operation being a component of said job, and said process being a component of said operation.

9. A method as claimed in claim 7 wherein said process is performed by first and second ones of said plurality of tasks, and said method additionally comprises the steps of:

constructing a fourth table for receiving data descriptive of a second process to be performed by al of said plurality of tasks except for said first task, said second process being a component of said job;

constructing a fifth table for storing data descriptive of a third process to be performed by all of said plurality of tasks except for said second task, said second process being a component of said job;

linking said second table to said fourth table within said computer memory;

linking said second table to said fifth table within said computer memory; and

defining a rule, associated with said second table, which operates to associate said fourth table with all of said plurality of tasks except for said first task and to associate said fifth table with all of said plurality of tasks except for said second task.

10. A method as claimed in claim 7 additionally comprising the steps of:

constructing a fourth table for storing data which describe capabilities required of said at least one of said resources; and

linking said fourth table to said third table within said computer memory.

11. An apparatus for associating information comprising:

a memory for storing a first, second, and third process table and a branch table;

said first process table storing a data element describing a first process utilized by both said first and second tasks and for storing a first out-flow pointer data element identifying said branch table, and wherein said first process table includes a data element describing a release list, said release list including a data element describing resources released at said first process;

said branch table storing first and second condition elements corresponding to second and third out flow pointers, said second out flow pointer identifying said second process table and said third out flow pointer identifying said third process table;

said second process table storing a data element describing a second process which is performed to accomplish said first task;

said third process table storing a data element describing a third process which is performed to accomplish said second task; and

a computer which translates data descriptive of demand for resources into a generic form comprising said first, second, and third process tables and which further acts to control allocation of said resources in a manner determined by said first, second, and third process tables.

6. A method as claimed in claim 11 wherein each of said first, second, and third tables is associated with a job table, and said method additionally comprises the step of associating a unique identifier with said job table and said first, second, and third processes may be collectively referenced by said unique identifier.

12. An apparatus as claimed in claim 11 wherein:

said first process table stores a pointer to a bill-of-resources memory structure;

said bill-of-resources memory structure stores a pointer to a bill-of-resources table; and

said bill-of-resources table stores a pointer to a plurality of initially consumed resources which are consumed at said first process.

13. An apparatus as claimed in claim 12 wherein said bill-of-resources memory structure includes:

a second bill-of-resources table; and

a rule data element, coupled to said first process table, said bill-of-resources table, and to said second bill-of-resources table, for associating said bill-of-resources table with said first task and said second bill-of-resources table with said second task.

14. An apparatus as claimed in claim 12 wherein:

said bill-of-resources table includes an attribute pointer data element; and

said apparatus additionally comprises an attribute table configured to be identified by said attribute pointer data element, said attribute table including a data element describing resource attribute capabilities required of said initially consumed resources by at least one of said first and second tasks.

15. An apparatus as claimed in claim 14 wherein said bill-of-resources table includes a second attribute pointer data element, and said apparatus additionally comprises:

a second attribute table stores a pointer to said second attribute pointer data element, said second attribute table including a data element describing alternate resource attribute capabilities required of said initially consumed resources by said at least one of said first and second tasks; and

a rule data element, coupled to said bill-of-resources table, said attribute table, and said second attribute table, for associating said attribute table with said first task and said second attribute table with said second task.

16. An apparatus as claimed in claim 11 wherein each of said first, second, and third process tables and said branch table is associated with a job table, said job table including a data element describing a job collectively performed by said first, second, and third processes.

17. An apparatus as claimed in claim 11 wherein:

each of said first, second, and third process tables and said branch table are associated with an operation table, said operation table storing a data element describing an operation collectively performed by said first, second, and third processes;

said operation table stores a pointer to a set of additional process tables; and

said operation table and said additional process tables stores a pointer to a job table, said job table including a data element describing a job collectively performed by said operation table and said additional processes.