Binary trees for detecting inventory problems in an enterprise model

• US 6,944,598 B1
• Filed: 09/17/1999
• Issued: 09/13/2005
• Est. Priority Date: 09/17/1999
• Status: Expired due to Fees

• Current Assignee: JDA Software Group Incorporated (RedPrairie Holding Incorporated)
• Original Assignee: i2 Technologies US Incorporated (Panasonic Holdings Corporation)
• Inventors: Cline, Kevin
• Primary Examiner(s): Walsh, Donald P.
• Assistant Examiner(s): SHAPIRO, JEFFREY ALAN
• Application Number:
  US09/397,818
• Time in Patent Office: 2,188 Days
• Field of Search: 705/28, 705/29, 705/22, 705/8, 705/7, 707/100, 707/101, 707/3
• US Class Current: 705/28
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 10/067 Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders
• CPC Class Codes: G06Q 10/0875 Itemisation or classification of parts, supplies or services, e.g. bill of materials
• CPC Class Codes: G06Q 20/203 Inventory monitoring
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A binary tree structure for detecting inventory problems. A first embodiment detects on-hand inventory problems. A second embodiment detects inventory requirements problems. Both embodiments use a binary tree whose nodes store time values and delta values. (FIG. 2). The delta values represent inventory consumers or producers. (FIG. 6). The time values of trees used for inventory requirements problems are shifted in accordance with build-ahead times. (FIG. 6).

Claims

1. A computer-readable medium for storing programming operable to provide on-hand inventory data, by performing the steps of:

representing the on-hand inventory in terms of a time varying function comprising a series of time value and function value pairs;

creating a balanced binary tree;

the balanced binary tree comprising a plurality of nodes, at least one of the nodes associated with a time span defined by a position of the node in the balanced binary tree; and

each node of the tree having an associated time value and delta value representing a change in value of the time varying function, and each node storing a producer delta or a consumer delta, with each producer delta having a positive value and each consumer delta having a negative value;

accessing the balanced binary tree in response to a query; and

using delta values obtained during the accessing step to determine at least one function value that represents an on-hand inventory quantity at a certain time.

2. The medium of claim 1, wherein the accessing is performed to search the tree to locate a time value when the function value changes to a negative value.

3. The medium of claim 1, wherein the accessing is performed to search the tree to locate a time value when the function value drops below a specified minimum on-hand value.

4. The medium of claim 1, wherein the accessing is performed to search the tree to locate a time value when the function value changes to a specified maximum on-hand value.

5. The medium of claim 1, wherein the programming further performs the step of outputting data representing the function value.

6. A computer-readable medium for storing programming operable to provide inventory requirements data, relative to on-hand inventory having a constant build-ahead time, by performing the steps of:

representing the on-hand inventory in terms of an on-hand inventory time varying function comprising a series of time value and function value pairs, each function value representing an inventory quantity at a paired time value;

creating a balanced binary tree;

the balanced binary tree comprising a plurality of nodes, at least one of the nodes associated with a time span defined by a position of the node in the balanced binary tree; and

each node of the balanced binary tree storing an associated time value and delta value representing a change in value of the time varying function, and each node storing a producer delta or a consumer delta, each producer delta having a positive value and each consumer delta having a negative value, and wherein the time values of consumer deltas are shifted in accordance with the build-ahead time, the tree thereby representing an inventory requirements function;

accessing the balanced binary tree; and

using delta values obtained during the accessing step to determine at least one inventory requirements function value.

7. The medium of claim 6, wherein the build-ahead time is a minimum build-ahead time, and the process determines when the function is negative.

8. The medium of claim 6, wherein the build-ahead time is a maximum build-ahead time, and the process determines when the function is positive.

9. The medium of claim 6, wherein the programming is further operable to output data representing the inventory requirements function value.

10. A computer-readable medium for storing programming operable to provide inventory requirements data, relative to on-hand inventory having varying build-ahead times, by performing the steps of:

representing on-hand inventory in terms of an on-hand inventory time varying function comprising a set of time value and function value pairs, each function value representing an inventory quantity at a paired time value;

creating a balanced binary tree;

the balanced binary tree comprising a plurality of nodes, at least one of the nodes associated with a time span defined by a position of the node in the balanced binary tree; and

each node of the tree storing an associated time value and delta value representing a change in value of the time varying function, and each node storing a producer delta or a consumer delta, with each producer delta having a positive value and each consumer delta having a positive value or a negative value;

wherein the consumer deltas have negative or positive values as determined by the relative values of the build-ahead times, and wherein the time values of the consumer deltas nodes are shifted in accordance with the build-ahead times, the balanced binary tree thereby representing an inventory requirements function;

accessing the balanced binary tree; and

using delta values obtained during the accessing step to determine at least one inventory requirements function value.

11. The medium of claim 10, wherein the build-ahead time is a minimum build-ahead time, and the process determines when the function is negative.

12. The medium of claim 10, wherein the build-ahead time is a maximum build-ahead time, and the process determines when the function is positive.

13. The medium of claim 10, wherein the programming is further operable to output data representing the inventory requirements function value.