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

Patent metadata

Field	Value
Publication number	US-9978026-B1
Application number	US-201113327718-A
Country	US
Kind code	B1
Filing date	Dec 15, 2011
Priority date	Dec 15, 2011
Publication date	May 22, 2018
Grant date	May 22, 2018

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 one 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 one 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.

First claim

What is claimed is:

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 the finished good, 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;

determine a second delay time from the at least one first plan level node in the first indenture plan level to a 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 two or more computers; and

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 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.

3. The system of claim 2 , 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, 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.

4. 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 the finished good, 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;

determining a second delay time from the at least one first plan level node in the first indenture plan level to a 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.

5. The method of claim 4 , 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.

6. The method of claim 5 , 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, 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.

7. 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 compri

Assignees

• Konanur Chandrashekar Srikantiah
• Muthusamy Ganesh
• Bardhan Probal
• Alam Ardyanto Iskandar
• Jda Software Group Inc

Inventors

• Konanur Chandrashekar Srikantiah
• Muthusamy Ganesh
• Bardhan Probal
• Alam Ardyanto Iskandar

Classifications

• G06Q10/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 title

• G06Q10/0631 Primary

  Resource planning, allocation, distributing or scheduling for enterprises or organisations · CPC title

• G06Q10/0875

  Itemisation or classification of parts, supplies or services, e.g. bill of materials · CPC title