Computation of supply chain planning process efficiency
First Claim
1. A method for computing a supply chain planning process efficiency E, comprising the steps of:
- receiving input data beginning at a time T0, wherein the input data includes supply input data and demand input data;
setting an iteration index R equal to 0;
incrementing R by 1;
adjusting the input data;
executing a central planning engine, using the input data;
analyzing results of executing the central planning engine; and
deciding whether to iterate or to stop, and if deciding to iterate then repeating the incrementing, adjusting, executing, analyzing, and deciding, or if deciding to stop then computing followed by stopping, wherein the computing comprises computing at time TE the efficiency E as a function of Q, C, and RP/T, wherein Q is a manual edit ratio in conjunction with said adjusting the input data, wherein C=S/D, wherein S is supply, wherein D is demand, wherein T=TE−
T0, and wherein P is a real number.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and system for computing a supply chain planning process efficiency E in relation to manufacturing activities of an organization. Input data, including supply and demand input data, is received beginning at time T0. An iteration index R is set equal to 0. Then the method and system implements: incrementing R by 1; adjusting the input data (i.e., changing, deleting, or updating the input data); executing a central planning engine (CPE), using the input data; analyzing results of executing the CPE; and iterating, or computing and stopping. The iterating repeats the incrementing, adjusting, executing, and analyzing. The computing computes E. E may be a function of Q, C, and RP/T. Q is a manual edit ratio in conjunction with adjusting the input data, C=S/D, S is supply, D is demand, T=TE−T0, and P is a real number.
-
Citations
30 Claims
-
1. A method for computing a supply chain planning process efficiency E, comprising the steps of:
-
receiving input data beginning at a time T0, wherein the input data includes supply input data and demand input data;
setting an iteration index R equal to 0;
incrementing R by 1;
adjusting the input data;
executing a central planning engine, using the input data;
analyzing results of executing the central planning engine; and
deciding whether to iterate or to stop, and if deciding to iterate then repeating the incrementing, adjusting, executing, analyzing, and deciding, or if deciding to stop then computing followed by stopping, wherein the computing comprises computing at time TE the efficiency E as a function of Q, C, and RP/T, wherein Q is a manual edit ratio in conjunction with said adjusting the input data, wherein C=S/D, wherein S is supply, wherein D is demand, wherein T=TE−
T0, and wherein P is a real number.- View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system for computing a supply chain planning process efficiency (E), comprising a supply database, a demand database, and an algorithm adapted to:
-
receive input data beginning at a time T0, wherein the input data includes supply input data from the supply database and demand input data from the demand database;
set an iteration index R equal to 0;
increment R by 1;
adjust the input data;
execute a central planning engine, using the input data;
analyze results of having executed the central planning engine; and
decide whether to iterate or to stop, and if having decided to iterate then the algorithm adapted to again increment, adjust, execute, analyze, and decide, or if having decided to stop then the algorithm adapted to compute and to stop, wherein to compute comprises to compute at time TE the efficiency E as a function of Q, C, and RP/T, wherein Q is a manual edit ratio in conjunction with said to adjust the input data, wherein C=S/D, wherein S is supply, wherein D is demand, wherein T=TE−
T0, and wherein P is a real number.- View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A computer program product, comprising a computer usable medium having a computer readable program code embodied therein for computing a supply chain planning process efficiency (E), said computer readable program code including an algorithm adapted to:
-
receive input data beginning at a time T0, wherein the input data includes supply input data and demand input data;
set an iteration index R equal to 0;
increment R by 1;
adjust the input data;
execute a central planning engine, using the input data;
analyze results of having executed the central planning engine; and
decide whether to iterate or to stop, and if having decided to iterate then the algorithm adapted to again increment, adjust, execute, analyze, and decide, or if having decided to stop then the algorithm adapted to compute and to stop, wherein to compute comprises to compute at time TE the efficiency E as a function of Q, C, and RP/T, wherein Q is a manual edit ratio in conjunction with said to adjust the input data, wherein C=S/D, wherein S is supply, wherein D is demand, wherein T=TE−
T0, and wherein P is a real number.- View Dependent Claims (23, 24, 25, 26, 27, 28, 29, 30)
-
-
21. A method for computing a supply chain planning process efficiency E, comprising the steps of:
-
receiving input data, wherein the input data includes supply input data and demand input data;
setting an iteration index R equal to 0;
incrementing R by 1;
adjusting the input data;
executing a central planning engine, using the input data;
analyzing results of executing the central planning engine; and
deciding whether to iterate or to stop, and if deciding to iterate then repeating the incrementing, adjusting, executing, analyzing, and deciding, or if deciding to stop then computing followed by stopping, wherein the computing comprises computing the efficiency E.
-
-
22. A system for computing a supply chain planning process efficiency (E), comprising a supply database, a demand database, and an algorithm adapted to:
-
receive input data, wherein the input data includes supply input data from the supply database and demand input data from the demand database;
set an iteration index R equal to 0;
increment R by 1;
adjust the input data;
execute a central planning engine, using the input data;
analyze results of having executed the central planning engine; and
decide whether to iterate or to stop, and if having decided to iterate then the algorithm adapted to again increment, adjust, execute, analyze, and decide, or if having decided to stop then the algorithm adapted to compute and to stop, wherein to compute comprises to compute the efficiency E.
-
Specification