IP Library Granted Patent US 10,579,946
Granted Patent B2
US 10,579,946 · App. 15/983,987 · Granted Mar 3, 2020

Computation of optimal inventory targets in bill-of-materials in a multi-echelon supply chain

Inventors: Chandrashekar Srikantiah Konanur (North Potomac, MD); Ganesh Muthusamy (Tamil Nadu, IN); Probal Bardhan (Hyderabad, IN); Ardyanto Iskandar Alam (Centreville, VA)
Assignee: JDA Software Group, Inc.
G06Q10/0631G06Q10/04G06Q10/0875
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,579,946
App. No.
15/983,987
Granted
Mar 3, 2020
Kind
B2
Abstract

A system and method is disclosed for computing optimal inventory targets in bill of materials in a multi-echelon supply chain. The system includes one or more memory units and on or more processing units collectively configured to determine a delay time from at least one second plan level node in an at least second indenture plan level to at least one first plan level node in a first indenture plan level. The one or more memory units and on or more processing units is further collectively configured to determine a delay time from the at least one first plan level node in the first indenture plan level to a finished good.

Claims (49)

1. A system to reduce computational run time of a computer, the system comprising:

a supply chain network comprising two or more supply chain entities, two or more nodes, and two or more computers, the two or more nodes comprising an inventory of an article and the two or more computers each comprising one or more memory units and one or more processing units collectively configured to:

determine a first delay time from at least one second plan level node in an at least second indenture plan level to at least one first plan level node in a first indenture plan level, the at least one second plan level node comprising two or more second plan level nodes and the at least one first plan level node comprising two or more first plan level nodes, each of the two or more second plan level nodes comprising a second plan level source for at least one of the two or more first plan level nodes and each of the two or more first plan level nodes comprising a first plan level source for a finished good;

determine a second delay time from the at least one first plan level node in the first indenture plan level to the finished good; and

determine an optimal inventory target based, at least in part, on the first and second delay times thereby reducing computational run time of the two or more computers,

wherein at least one of the two or more supply chain entities adjusts the inventory based, at least in part, on the optimal inventory target.

2. The system of claim 1 , wherein determine the first delay time comprises:

determine a second plan level fulfillment problem variable (PPV) and second plan level PPV standard deviation between each second plan level source and each associated first plan level node;

determine a second plan level critical value between each second plan level source and each associated first plan level node; and

determine a second plan level delay utilizing a two sigma limit for any second plan level critical value less than or equal to two and the second plan level critical value as a sigma limit for any second plan level critical value greater than two, wherein a largest second level numerical delay comprises a second level bottleneck between the at least second plan level and the first level.

3. The system of claim 2 , wherein determine the second plan level PPV and the second plan level PPV standard deviation comprises determine a second mean lead time, a second lead time standard deviation, a second mean daily demand, and a second mean square error between each second plan level source and each associated first plan level node to compute the PPV and the PPV standard deviation between each second plan level source and each associated first plan level node.

4. The system of claim 3 , wherein determine the second delay time from the at least one first plan level node in the first indenture plan level to the finished good comprises:

add the lead time and the bottleneck lead time standard deviation of the bottleneck between the at least second plan level and the first level;

determine a first plan level PPV and a first plan level PPV standard deviation between each first plan level source and the finished good;

determine a first plan level critical value between each second plan level source and each associated first plan level node; and

determine a first plan level delay utilizing a two sigma limit for any first plan level critical value less than or equal to two and the first plan level critical value as a sigma limit for any first plan level critical value greater than two.

5. The system of claim 4 , wherein a largest first plan level numerical delay comprises a first plan level bottleneck between the at least first plan level and the finished good.

6. A computer-implemented method of determining optimal inventory targets in bill of materials in a multi-echelon supply chain network thereby reducing computational run time of a computer, the method comprising:

determining a first delay time from at least one second plan level node in an at least second indenture plan level to at least one first plan level node in a first indenture plan level, the at least one second plan level node comprising two or more second plan level nodes and the at least one first plan level node comprising two or more first plan level nodes, each of the two or more second plan level nodes comprising a second plan level source for at least one of the two or more first plan level nodes, and each of the two or more first plan level nodes comprising a first plan level source for a finished good;

determining a second delay time from the at least one first plan level node in the first indenture plan level to the finished good;

determining an optimal inventory target based, at least in part, on the first and second delay times thereby reducing computational run time of the computer; and

adjusting, by a supply chain entity in a supply chain network, an inventory of at least one node based, at least in part, on the optimal inventory target.

7. The method of claim 6 , wherein determining the first delay time comprises:

determining a second plan level fulfillment problem variable (PPV) and second plan level PPV standard deviation between each second plan level source and each associated first plan level node;

determining a second plan level critical value between each second plan level source and each associated first plan level node; and

determining a second plan level delay utilizing a two sigma limit for any second plan level critical value less than or equal to two and the second plan level critical value as a sigma limit for any second plan level critical value greater than two, wherein a largest second level numerical delay comprises a second level bottleneck between the at least second plan level and the first level.

8. The method of claim 7 , wherein determining the second plan level PPV and the second plan level PPV standard deviation comprises determining a second mean lead time, a second lead time standard deviation, a second mean daily demand, and a second mean square error between each second plan level source and each associated first plan level node to compute the PPV and the PPV standard deviation between each second plan level source and each associated first plan level node.

9. The method of claim 8 , wherein determining the second delay time from the at least one first plan level node in the first indenture plan level to the finished good comprises:

adding the lead time and the bottleneck lead time standard deviation of the bottleneck between the at least second plan level and the first level;

determining a first plan level PPV and a first plan level PPV standard deviation between each first plan level source and the finished good;

determining a first plan level critical value between each second plan level source and each associated first plan level node; and

determining a first plan level delay utilizing a two sigma limit for any first plan level critical value less than or equal to two and the first plan level critical value as a sigma limit for any first plan level critical value greater than two.

10. The method of claim 9 , wherein a largest first plan level numerical delay comprises a first plan level bottleneck between the at least first plan level and the finished good.

11. A non-transitory computer-readable medium embodied with software to reduce computational run time of a computer, the software when executed by one or more computers is configured to:

determine a first delay time from at least one second plan level node in an at least second indenture plan level to at least one first plan level node in a first indenture plan level, the at least one second plan level node comprising two or more second plan level nodes and the at least one first plan level node comprising two or more first plan level nodes, each of the two or more second plan level nodes comprising a second plan level source for at least one of the two or more first plan level nodes, and each of the two or more first plan level nodes comprising a first plan level source for a finished good;

determine a second delay time from the at least one first plan level node in the first indenture plan level to the finished good;

determine an optimal inventory target based, at least in part, on the first and second delay times thereby reducing computational run time of the computer; and

adjust an inventory of at least one node based, at least in part, on the optimal inventory target.

12. The computer-readable medium of claim 11 , wherein determine the first delay time comprises:

determine a second plan level fulfillment problem variable (PPV) and second plan level PPV standard deviation between each second plan level source and each associated first plan level node;

determine a second plan level critical value between each second plan level source and each associated first plan level node; and

determine a second plan level delay utilizing a two sigma limit for any second plan level critical value less than or equal to two and the second plan level critical value as a sigma limit for any second plan level critical value greater than two, wherein a largest second level numerical delay comprises a second level bottleneck between the at least second plan level and the first level.

13. The computer-readable medium of claim 12 , wherein determine the second plan level PPV and the second plan level PPV standard deviation comprises determine a mean lead time, a second lead time standard deviation, a second mean daily demand, and a second mean square error between each second plan level source and each associated first plan level node to compute the PPV and the PPV standard deviation between each second plan level source and each associated first plan level node.

14. The computer-readable medium of claim 13 , wherein determine the second delay time from the at least one first plan level node in the first indenture plan level to the finished good comprises:

add the lead time and the bottleneck lead time standard deviation of the bottleneck between the at least second plan level and the first level;

determine a first plan level PPV and a first plan level PPV standard deviation between each first plan level source and the finished good;

determine a first plan level critical value between each second plan level source and each associated first plan level node; and

determine a first plan level delay utilizing a two sigma limit for any first plan level critical value less than or equal to two and the first plan level critical value as a sigma limit for any first plan level critical value greater than two.

15. The computer-readable medium of claim 14 , wherein a largest first plan level numerical delay comprises a first plan level bottleneck between the at least first plan level and the finished good.

Assignments (5)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053383/0117) Recorded Nov 3, 2021
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: BLUE YONDER GROUP, INC.
Reel/Frame 058794/0776 →
RELEASE OF SECURITY INTEREST Recorded Sep 16, 2021
From: JPMORGAN CHASE BANK, N.A.
To: BLUE YONDER GROUP, INC.; BLUE YONDER, INC.; JDA SOFTWARE SERVICES, INC.; I2 TECHNOLOGIES INTERNATIONAL SERVICES, LLC; MANUGISTICS SERVICES, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; REDPRAIRIE COLLABORATIVE FLOWCASTING GROUP, LLC; JDA SOFTWARE RUSSIA HOLDINGS, INC.; REDPRAIRIE SERVICES CORPORATION; BY BOND FINANCE, INC.; BY NETHERLANDS HOLDING, INC.; BY BENELUX HOLDING, INC.
Reel/Frame 057724/0593 →
SECURITY AGREEMENT Recorded Aug 3, 2020
From: BLUE YONDER GROUP, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 053383/0117 →
CHANGE OF NAME Recorded Apr 10, 2020
From: JDA SOFTWARE GROUP, INC.
To: BLUE YONDER GROUP, INC.
Reel/Frame 052373/0227 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 23, 2018
From: KONANUR, CHANDRASHEKAR SRIKANTIAH; MUTHUSAMY, GANESH; BARDHAN, PROBAL; ALAM, ARDYANTO ISKANDAR
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 045883/0084 →
Continuity (2)
Continuation 13327718 · Dec 15, 2011
Related Publication 20180268330A1 · Sep 20, 2018