System and method supply chain demand satisfaction
View Patent ↗Systems and methods for supply chain management and identification of feasible plans. Identification of feasible plans includes simultaneous breadth and depth satisfaction of demands. Demands are satisfied using multiple sources of supply, consideration of substitute items, generation of supply, and/or reallocation of supply previously pegged for satisfaction of a lower priority demand. Reallocation optionally includes consideration of items and demands associated with multiple level codes.
1. A computer implemented method of satisfying a demand, the method comprising:
collecting demands for one or more items, the one or more items having the same level code, and at least one item of the one or more items being associated with one or more dependant demands at a higher level code; and
for each of the collected demands,
determining a first demand shortage quantity, the first demand shortage quantity indicating a first quantity of the collected demand that has not been satisfied at the level code of the collected demand,
searching for available unallocated supply of the collected demand, at the level code of the collected demand, responsive to the first demand shortage quantity,
determining a second demand shortage quantity, the second demand shortage quantity indicating a second quantity of the collected demand that could not be satisfied at the level code of the collected demand or from the available unallocated supply, and
creating supply, the creation of supply being responsive to the second demand shortage quantity and the creation of supply including satisfying a dependent demand at the higher level code of the one or more dependant demands that are associated with the collected demand; wherein the steps of collecting, determining, and searching are executed in a computer.
2. The method of claim 1 , wherein satisfying a dependent demand at a higher level code includes performing a feasible plan search relating to items assigned the higher level code.
3. The method of claim 2 , wherein the feasible plan search includes determining a first dependent demand shortage quantity, searching for available unallocated supply responsive to the first dependent demand shortage quantity, and determining a second dependent demand shortage quantity.
4. The method of claim 3 , wherein the feasible plan search further includes creating supply responsive to the second dependent demand shortage quantity.
5. The method of claim 1 , further including reallocating previously allocated supply.
6. The method of claim 5 , wherein the supply is reallocated from a lower priority demand.
7. The method of claim 5 , wherein the previously allocated supply is reallocated from a candidate demand to a member of the collected demands, the candidate demand having a level code different than a level code of the member of the collected demands.
8. The method of claim 7 , wherein the reallocation is responsive to an optimization algorithm.
9. The method of claim 6 , wherein the priority of the lower priority demand is determined using a mathematical optimization algorithm.
10. The method of claim 6 , wherein the priority of the lower priority demand is determined using a rule based algorithm.
11. The method of claim 1 , wherein, for each of the collected demands, supply is created in an order of priority.
12. The method of claim 1 , wherein searching for available unallocated supplies for each of the collected demands is performed in order of demand priority.
13. The method of claim 1 , wherein searching for available unallocated supplies of a first member of the collected demands is performed using a first algorithm different from a second algorithm used in searching for available unallocated supplies of a second member of the collected demands.
14. A computer program product embedded in a computer-readable medium for satisfying a demand, the computer program product comprising instructions that, when executed by a processor, cause the processor to:
collect demands for one or more items, the one or more items having the same level code, and at least one item of the one or more items being associated with one or more dependant demands at a higher level code; and
for each of the collected demands,
select the demand,
determine a first demand shortage quantity, the first demand shortage quantity indicating a first quantity of the demand that has not been satisfied at the level code of the demand,
locate available unallocated supplies of the demand, at the level code of the demand, responsive to the first demand shortage quantity,
determine a second demand shortage quantity, the second demand shortage quantity indicating a second quantity of the demand that could not be satisfied at the level code of the demand or from the available unallocated supply, and
create supply, the creation of supply being responsive to the second demand shortage quantity and further including satisfying a dependent demand at the higher level code of the one or more dependant demands that are associated with the demand.
15. The computer program product of claim 14 , wherein satisfying a dependent demand at a higher level code includes performing a feasible plan search relating to items assigned the higher level code.
16. The computer program product of claim 15 , wherein the feasible plan search includes determining a first dependent demand shortage quantity, searching for available unallocated supply responsive to the first dependent demand shortage quantity, and determining a second dependent demand shortage quantity.
17. The computer program product of claim 16 , wherein the feasible plan search further includes creating supply responsive to the second dependent demand shortage quantity.
18. The computer program product of claim 14 , wherein the computer program product further comprises instructions that, when executed by a processor, cause the processor to reallocate previously allocated supply.
19. The computer program product of claim 18 , wherein the supply is reallocated from a lower priority demand.
20. The computer program product of claim 18 , wherein the previously allocated supply is reallocated from a candidate demand to a member of the collected demands, the candidate demand having a level code different than a level code of the member of the collected demands.
21. The computer program product of claim 20 , wherein the reallocation is responsive to an optimization algorithm.
22. The computer program product of claim 19 , wherein the priority of the lower priority demand is determined using a mathematical optimization algorithm.
23. The computer program product of claim 19 , wherein the priority of the lower priority demand is determined using a rule based algorithm.
24. The computer program product of claim 14 , wherein, for each of the collected demands, supply is created in an order of priority.
25. The computer program product of claim 14 , wherein searching for available unallocated supplies for each of the collected demands is performed in order of demand priority.
26. The computer program product of claim 14 , wherein searching for available unallocated supplies of a first member of the collected demands is performed using a first algorithm different from a second algorithm used in searching for available unallocated supplies of a second member of the collected demands.