Binary trees for detecting inventory problems in an enterprise model

• US 7,752,245 B2
• Filed: 12/05/2009
• Issued: 07/06/2010
• Est. Priority Date: 09/17/1999
• Status: Expired due to Fees

• Current Assignee: JDA Software Group Incorporated (Panasonic Holdings Corporation)
• Original Assignee: i2 Technologies US Incorporated (Panasonic Holdings Corporation)
• Inventors: Cline, Kevin A.
• Primary Examiner(s): Zeender, F. Ryan
• Assistant Examiner(s): SHAAWAT, MUSSA A
• Application Number:
  US12/631,825
• Publication Number:
  US 20100088200A1
• Time in Patent Office: 213 Days
• Field of Search: None
• US Class Current: 707/736
• 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. The delta values represent inventory consumers or producers. The time values of trees used for inventory requirements problems are shifted in accordance with build-ahead times.

Claims

1. A system providing inventory requirements data, relative to on-hand inventory having a constant build-ahead time, comprising:

a computer-readable memory storing a balanced binary tree representing inventory requirements in terms of a time varying function that is a set of time value and function value pairs, 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, each function value representing an inventory quantity at a paired time value;

wherein each node of the tree has an associated time value and delta value representing a change in inventory quantity, and wherein each node stores 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; and

an engine for accessing the binary tree, the engine using delta values to determine at least one inventory requirements function value.

2. The system of claim 1, further comprising a user interface delivering query data to the engine, and providing data output derived from the function value, in response to the query.

3. The system of claim 1, wherein the build-ahead time is a minimum build-ahead time and the engine determines when the function value is negative.

4. The system of claim 1, wherein the build-ahead time is a maximum build-ahead time, and the engine determines when the function value is positive.

5. The system of claim 1, wherein each node further stores a net subtree value representing the sum of deltas in a net subtree associated with the node.

6. The system of claim 1, wherein the inventory requirements function is a step function.

7. A system providing inventory requirements data, relative to on-hand inventory having varying build-ahead times, comprising:

a computer-readable memory storing a balanced binary tree representing inventory requirements in terms of a time varying function that is a set of time value and function value pairs, 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, each function value representing an inventory quantity at a paired time value;

wherein each node of the tree has an associated time value and delta value representing a change in inventory quantity, and each node stores 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 tree thereby representing an inventory requirements function; and

an engine for accessing the binary tree, the engine using delta values to determine at least one inventory requirements function value.

8. The system of claim 7, further comprising a user interface delivering query data to the engine, and provides data output derived from the function value, in response to the query.

9. The system of claim 7, wherein the build-ahead time is a minimum build-ahead time and the engine determines when the function value is negative.

10. The system of claim 7, wherein the build-ahead time is a maximum build-ahead time, and the engine determines when the function value is positive.

11. The system of claim 7, wherein each node further stores a net subtree value representing the sum of deltas in a net subtree associated with the node.

12. The system of claim 7, wherein the inventory requirements function is a step function.