Method for control, analysis and simulation of research, development, manufacturing and distribution processes

• US 7,707,145 B2
• Filed: 01/07/2005
• Issued: 04/27/2010
• Est. Priority Date: 07/09/2002
• Status: Active Grant

• Current Assignee: Gerald Mischke
• Original Assignee: Gerald Mischke
• Inventors: Mischke, Gerald
• Primary Examiner(s): Wong; Don
• Assistant Examiner(s): Hwa; Shyue Jiunn
• Application Number:
  US11/030,286
• Publication Number:
  US 20050192947A1
• Time in Patent Office: 1,936 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

A method for control, analysis and simulation of research, development, manufacturing and distribution processes, in which the data relevant for describing the process are mapped in a four-dimensional coordinate space with the orthogonal coordinate axes source, sink, object or service and time and are stored in a relational database with tree structure, wherein, for logical connection of the coordinates source, sink and object or service during performance of an analysis or simulation, there are provided a transaction table, in which time-related information on inventory changes of data stored in the coordinates source, sink and object or service is recorded, and a resource table, in which time-related information on costs and capacities of the process under consideration is recorded.

Claims

1. A computer-implemented method of classifying and recording data for one or more of controlling, analyzing or simulating a research, development, manufacturing and distribution process, comprising:

mapping, in a processor of a computer, electronic data relevant for describing the process into a four-dimensional coordinate space having the orthogonal coordinate axes (i) source, (ii) sink, (iii) object or service, and (iv) time, and

storing, in memory, the mapped data in a relational, object oriented or other database having a tree structure,

wherein the source, sink, and object or service data along the coordinate axes, in a computer-readable code that is readable by the processor, are represented by a transaction table in which time-related information on inventory changes of data stored in the coordinate axes source, sink and object or service are recorded for logical connection during performance of an analysis or simulation, and time-related information on costs and capacities of the process is recorded in a resource table,

wherein all data in each of dimensions of the four-dimensional coordinate space are collected and stored in a deepest, atomic layer stored in memory,

wherein one or more tree structured partitions that are arbitrary and complete down to the deepest, atomic storage layer may be specified, set up and stored, in memory, for each dimension of the four-dimensional coordinate space,

wherein all data relevant to the research, development, manufacturing and distribution processes is stored, in memory, in four dedicated data structures, of which one each is provided for the orthogonal coordinate axes source, sink, and object or service, a further data structure stores atomic transactions and if necessary an additional data structure stores resources in the three orthogonal coordinate axes source, sink, and object or service, wherein this additional data structure may be subdivided into three dedicated sub data structures or sub tables, respectively, separated for source, sink, and object or service.

2. The method according to claim 1, wherein all data relevant to the research, development, manufacturing and distribution processes is stored, in memory, in five to seven dedicated data structures and the structures are tables.

3. The method according to claim 1, wherein the structure or the correlation information of the respective atomic information units in each of the four dimensions of the four-dimensional coordinate space is stored, in memory, for arbitrary higher-level units of a real and hypothetical classification of the process, in separate data structures, the four tables corresponding to source, sink, object or service, and time.

4. The method according to claim 3, wherein the data structures are tree structures.

5. The method according to claim 1, wherein the atomic information entries are stored in four to seven data structures that may be logically connected by redirecting entries in appropriate correlation structures, to be analyzed or to be considered.

6. The method according to claim 5, wherein the correlation structures are columns.

7. The method according to claim 1, wherein the correlations of atomic transactions are stored, in memory, in hierarchical order separated from the stored electronic data of the process.

8. The method according to claim 1, wherein the stored atomic transactions in the data structure or structures and the corresponding data in the transaction table are of the same type or category.

9. The method according to claim 1, wherein the stored atomic transactions are completely stored, in memory, in the corresponding data structures so that the variation and the availability status of the corresponding resource can be determined at any time by a corresponding calculation program.

10. The method according to claim 1, further comprising:

identifying, with the processor, all those atomic transactions that are relevant for an analysis or consideration by dialog between a user and a navigation tool, on the basis of the data structures, and delivering a corresponding program for extracting and aggregating the respective data.

11. The method according to claim 10, wherein data necessary for responding to an arbitrary query or analysis task may be calculated, with the processor, from the indications of the navigation tool and in this way the information can be directly accessed.

12. The method according to claim 1, wherein data necessary for responding to an arbitrary query or analysis task may be calculated from the data stored, in memory, in the data structures.

13. The method according to claim 1, further comprising:

decomposing, with the processor, the overall system into arbitrary subsystems that are similar in structure to the overall system by the structure or correlation information filed in the data structures.

14. The method according to claim 13, further comprising:

editing and administering the subsystems into separate electronic data-processing systems.

15. The method according to claim 14, wherein the editing and administering is carried out with one or more conflict-resolution mechanisms or systems and the subsystems can be reassembled into a consistent overall system.

16. The method according to claim 1, wherein one or more electronic data-processing-supported reporting, analysis and development or integration tools connected to one another and the processor, and cooperating with one another, monitor and control the overall flow.

17. A computer-program product that can be directly loaded into the internal memory of a computer and that comprises software modules with which a method according to claim 1 is implemented for analysis and control of processes.

18. A computer-program product that is stored on a computer-compatible medium and that is provided with computer-readable programming means, which instruct the computer to implement a method according to claim 1 for analysis and control of the process.