| CPC G06Q 10/06315 (2013.01) [G06Q 10/087 (2013.01)] | 20 Claims |
|
1. A system for dynamic resource demand pegging within a network graph data structure comprising:
at least one processor; and
memory comprising instructions that, when executed by the at least one processor, cause the at least one processor to perform operations to:
generate a node graph within the network graph data structure that includes a set of material nodes, a set of activity nodes, and a set of capacity nodes, wherein the node graph is generated based on edges between members of the set of material nodes, members of the set of activity nodes, and members of the set of capacity nodes along the network graph data structure, wherein at least one of the edges represent an outflow of a particular material node in the set of material nodes to an inflow of a corresponding particular activity node in the set of activity nodes, wherein the set of material nodes are buffer nodes that include attributes for a supply of a resource, and wherein the set of activity nodes are no-carry nodes between respective members of the set of material nodes and members of the set of capacity nodes through which supply attributes flow;
receive an identification of a first demand to be pegged, the identification including attributes that include identification of a material node of the set of material nodes, a unit quantity attribute, and a time bucket attribute for the first demand, wherein the unit quantity attribute is based in part on output of a downstream activity node of the set of activity nodes that shares a downstream edge with the material node, and wherein the time bucket attribute represents a period of consumption of units of the resource by the material node;
in real-time in parallel with a set of other demand pegging processes, independently process the first demand to be pegged by:
in real-time using parallel processing threads that independently execute demand pegging calculations simultaneously without dependency on sequential processing of other demands, wherein the independently processing includes dynamically managing memory allocation by:
calculating a first demand pegging without storing output of the demand pegging calculations in memory simultaneously, and selectively flushing completed peggings to disk storage based on available memory allocation;
identifying a set of other demands for the material node during a time period defined by the time bucket attribute;
determining a priority level attribute for the first demand based on a priority level attribute for at least one activity node corresponding to the first demand and at least one particular demand in the set of other demands based one a priority level attribute for at least one activity node corresponding to the at least one particular demand;
determining a resource available inventory attribute for the material node for the time period, the resource available inventory attribute determined in part based on output of an upstream activity node of the set of activity nodes that shares an upstream edge with the material node and an upstream capacity node of the set of capacity nodes that shares an upstream edge with the material node and in part based on the set of other demands having a higher priority attribute value than the first demand;
calculating a quantity to be pegged attribute based on the unit quantity attribute;
calculating a quantity to skip attribute based on a sum of demand units corresponding to members of the set of other demands having a lower priority attribute value than the first demand pegged to a quantity of the resource corresponding to the resource available inventory attribute;
identifying a supply set of units of the resource for the time period;
generating a pegged subset of the supply set of units of the resource by skipping members of the supply set of units equal to the quantity to skip attribute, wherein a number of members in the pegged subset is equal to the quantity to be pegged attribute; and
storing a respective quantity to be pegged attribute at each material node associated with the pegged subset;
automatically calculating an alternative inventory path for the supply based on the supply set of units, wherein the alternative inventory path defines a secondary supply of the units to be directed to the material node; and
displaying an interactive pegging visualization graphical user interface including a graphical representation of the supply set of units and the secondary supply of the units, wherein the graphical representation is dynamically updated.
|