Binary trees for detecting inventory problems in an enterprise model
First Claim
Patent Images
1. A system providing inventory requirements data, relative to on-hand inventory having a build-ahead time, comprising:
- a computer-readable memory storing a balanced binary tree representing inventory values in terms of a time varying function that is a series 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;
wherein each node of the tree has an associated time value and delta value representing a change in value of the time varying function, and each node stores either a producer delta or a consumer delta, with each producer delta having a positive value and each consumer delta having a negative value; and
an engine for accessing the tree, the engine using delta values to determine at least one function value representing inventory quantity at a certain time.
15 Assignments
0 Petitions
Accused Products
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).
-
Citations
12 Claims
-
1. A system providing inventory requirements data, relative to on-hand inventory having a build-ahead time, comprising:
-
a computer-readable memory storing a balanced binary tree representing inventory values in terms of a time varying function that is a series 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; wherein each node of the tree has an associated time value and delta value representing a change in value of the time varying function, and each node stores either a producer delta or a consumer delta, with each producer delta having a positive value and each consumer delta having a negative value; and an engine for accessing the tree, the engine using delta values to determine at least one function value representing inventory quantity at a certain time. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
Specification