System and method for determining a promise date for a demand in a business environment

• US 20030216952A1
• Filed: 05/16/2003
• Published: 11/20/2003
• Est. Priority Date: 05/17/2002
• Status: Active Grant

• Current Assignee: Kinaxis Incorporated
• Original Assignee: Kinaxis Holdings Incorporated
• Inventors: Ticala, Vasile Gelu, Crozman, James Robert, Klett, Robert Duncan
• Granted Patent: US 7,610,212 B2
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/06315 Needs-based resource requirements planning or analysis
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

The present invention provides a method and a system for determining a promise date for a demand whose supply depends on constraints in a business environment. According to the present invention, information related to the business environment is stored within a data storage means. The present invention provides a processor coupled to the data storage means from which it requests and retrieves data. The processor also determines a plan date for each supply in the supply structure. The plan date is determined, from a highest level to a lowest level in the supply structure, based on existing and planned supply in the supply structure. After determining a plan date, the processor determines an available date for each supply in the supply structure. The available date is determined, from the lowest level to the highest level in the supply structure, based on the availability of each supply in the supply structure, and the plan date determined for each supply. Finally, the processor generates a promise date for the demand for the item based on each available date determined for a corresponding supply in the supply structure. The present invention advantageously generates promise dates based on information available in real-time on both the supply structure and the capacity constraints for a given item.

Claims

1. A method of determining a promise date for a demand in a business environment based on a demand produced for an item and a supply structure for fulfilling the demand, the method comprising steps:

(a) for each supply in the supply structure, determining a plan date, based on existing and planned supply in the supply structure, from a highest level to a lowest level in the supply structure;

(b) for each supply in the supply structure, determining an available date, based on;

i) the availability of each supply in the supply structure, and ii) the plan date determined in step (a), from the lowest level to the highest level in the supply structure; and

(c) generating the promise date for the demand based on the available date determined in step (b).

2. The method according to claim 1, wherein in step (a) the plan date is determined based on the availability of at least one capacity constraint required to fulfill each supply.

3. The method according to claim 1, wherein in step (b) the available date is determined based on the availability of capacity constraints required to fulfill each supply.

4. The method according to claim 1, wherein the supply structure is selected from the group consisting of:

a product structure, a supply-chain structure, a project structure, and an organizational structure.

5. The method according to claim 2, wherein the supply structure is selected from the group consisting of:

a product structure, a supply-chain structure, a project structure, and an organizational structure.

6. The method according to claim 1, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

7. The method according to claim 2, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

8. The method according to claim 3, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

9. The method according to claim 1, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists;

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

10. The method according to claim 2, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists;

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

11. The method according to claim 3, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists;

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

12. The method according to claim 1, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b

     1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

13. The method according to claim 2, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

14. The method according to claim 3, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

15. The method according to claim 12, further including the step of, prior to step (b4), recording the allocation of each supply to the demand.

16. The method according to claim 13, further including the step of, prior to step (b4), recording the allocation of each supply to the demand.

17. The method according to claim 14, further including the step of, prior to step (b4), recording the allocation of each supply to the demand.

18. The method according to claim 12, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand

19. The method according to claim 13, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

20. The method according to claim 14, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

21. The method according to claim 12, wherein, in step (b3), determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

22. The method according to claim 13, wherein, in step (b3), determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

23. The method according to claim 14, wherein, in step (b3), determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

24. The method according to claim 2, wherein the availability of the at least one capacity constraint is time-phased per period.

25. The method according to claim 3, wherein the availability of the at least one capacity constraint is time-phased per period.

26. The method according to claim 2, wherein the at least one capacity constraint has an availability defined as a rate per period.

27. The method according to claim 3, wherein the at least one capacity constraint has an availability defined as a rate per period.

28. The method according to claim 24, wherein the at least one capacity constraint has an availability defined as a rate per period.

29. The method according to claim 25, wherein the at least one capacity constraint has an availability defined as a rate per period.

30. The method according to claim 2, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

31. The method according to claim 3, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

32. The method according to claim 24, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

33. The method according to claim 25, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

34. The method according to claim 26, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

35. The method according to claim 27, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

36. The method according to claim 2, wherein at least one capacity constraint has a cumulative maximum value.

37. The method according to claim 3, wherein at least one capacity constraint has a cumulative maximum value.

38. The method according to claim 24, wherein at least one capacity constraint has a cumulative maximum value.

39. The method according to claim 25, wherein at least one capacity constraint has a cumulative maximum value.

40. The method according to claim 26, wherein at least one capacity constraint has a cumulative maximum value.

41. The method according to claim 27, wherein at least one capacity constraint has a cumulative maximum value.

42. The method according to claim 30, wherein at least one capacity constraint has a cumulative maximum value.

43. The method according to claim 31, wherein at least one capacity constraint has a cumulative maximum value.

44. The method according to claim 1, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

45. The method according to claim 2, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

46. The method according to claim 3, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

47. The method according to claim 1, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

48. The method according to claim 2, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

49. The method according to claim 3, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

50. The method according to claim 47, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

51. The method according to claim 48, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

52. The method according to claim 49, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

53. The method according to claim 47, further including the step of, prior to step (a), queuing the plurality of items according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which each supply and each demand for the item was requested.

54. The method according to claim 48, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which each supply and each demand for the item was requested.

55. The method according to claim 49, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which each supply and each demand for the item was requested.

56. The method according to claim 1, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

57. The method according to claim 2, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking each supply allocated to the demand, in step (dl), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

58. The method according to claim 3, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

144. The method according to claim 2, wherein in step (b) the available date is determined based on the availability of capacity constraints required to fulfill the each supply.

145. The method according to claim 144, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists;

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

146. The method according to claim 144, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating the each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

147. The method according to claim 146, further including the step of, prior to step (b4), recording the allocation of the each supply to the demand.

148. The method according to claim 146, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

149. The method according to claim 146, in step (b3), determining if the demand is fulfilled by the plan date, for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date, and for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

150. The method according to claim 144, wherein the availability of the at least one capacity constraint is time-phased per period.

151. The method according to claim 144, wherein the availability of the at least one capacity constraint has an availability defined as a rate per period.

152. The method according to claim 150, wherein the availability of the at least one capacity constraint has an availability defined as a rate per period.

153. The method according to claim 144, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

154. The method according to claim 144, wherein the at least one capacity constraint has a cumulative maximum value.

155. The method according to claim 150, wherein the at least one capacity constraint has a cumulative maximum value.

156. The method according to claim 153, wherein the at least one capacity constraint has a cumulative maximum value.

157. The method according to claim 144, wherein each supply in the supply structure has a plurality of sources for fulfilling the supply.

158. The computer-readable medium according to claim 144, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

159. The method according to claim 158, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

160. The method according to claim 159, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which the each supply and the each demand for the item was requested.

161. The method according to claim 144, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of the each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking the each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

59. A system for determining a promise date for a demand in a business environment based on a demand produced for the item and a supply structure for fulfilling the demand, the system comprising:

a data storage means for storing data information related to the business environment; and

a processing means for generating a promise date for the demand, the processing means being coupled to the data storage means;

whereby the processing means requests and retrieves data information related to the business environment from the data storage means, and

whereby the processing means determines a plan date for each supply in the supply structure based on an existing and planned supply in the supply structure, from a highest-level to a lowest-level in the supply structure, and determines an available date for each supply in the supply structure based on i) the availability of each supply in the supply structure, and ii) the plan date determined for each supply, from the lowest-level to the highest-level in the supply structure, and generates the promise date for the demand for the item based on the available date determined for each supply in the supply structure.

60. The system according to claim 59, wherein the plan date is determined based on the availability of at least one capacity constraint required to fulfill a supply.

61. The system according to claim 59, wherein the available date is determined based on the availability of capacity constraints required to fulfill the supply.

62. The system according to claim 60, wherein the available date is determined based on the availability of capacity constraints required to fulfill the supply

63. The system according to claim 59, wherein the supply structure is selected from the group consisting of:

a product structure, supply-chain structure, project-task structure, and an organizational structure.

64. The system according to claim 59, wherein the processing means assigns a priority value to the demand produced for the item.

65. The system according to claim 60, wherein the processing means assigns a priority value to the demand produced for the item.

66. The system according to claim 61, wherein the processing means assigns a priority value to the demand produced for the item.

67. The system according to claim 59, wherein the processing means determines the available date for each supply in the supply structure based on the priority value assigned to the demand.

68. The system according to claim 60, wherein the processing means determines the available date for each supply in the supply structure based on the priority value assigned to the demand.

69. The system according to claim 61, wherein the processing means determines the available date for each supply in the supply structure based on the priority value assigned to the demand.

70. The system according to claim 59, wherein the data information is memory resident.

71. The system according to claim 60, wherein the data information is memory resident.

72. The system according to claim 61, wherein the data information is memory resident.

73. The system according to claim 59, wherein the data storage means includes means for storing a plurality of versions of the data information.

74. The system according to claim 60, wherein the data storage means includes means for storing a plurality of versions of the data information.

75. The system according to claim 61, wherein the data storage means includes means for storing a plurality of versions of the data information.

76. The system according to claim 59, wherein the processing means and the data storage means are coupled to a plurality of data storage means that store information related to the business environment.

77. The system according to claim 59, wherein the processing means runs continuously.

78. The system according to claim 59, wherein the processing means requests and retrieves data only when the information related to the business environment has been updated.

79. A computer-readable medium having stored thereon, computer-readable and computer-executable instructions which, when executed by a processor, cause the processor to perform the steps of:

(a) for each supply in the supply structure, determining a plan date, based on an existing and planned supply in the supply structure, from a highest level to a lowest level in the supply structure;

(b) for each supply in the supply structure, determining an available date, based on;

i) the availability of each supply in the supply structure, and ii) the plan date determined in step (a), from the lowest level to the highest level in the supply structure; and

(c) generating the promise date for the demand based on the available date determined in step (b).

80. The computer-readable medium according to claim 79, further containing computer-readable and computer executable instructions, wherein in step (a) the plan date is determined based on the availability of at least one capacity constraint required to fulfill the supply.

81. The computer-readable medium according to claim 79, further containing computer-readable and computer executable instructions, wherein in step (b) the available date is determined based on the availability of at least one capacity constraint required to fulfill the supply.

82. The computer-readable medium according to claim 80, further containing computer-readable and computer executable instructions, wherein in step (b) the available date is determined based on the availability of at least one capacity constraint required to fulfill the supply.

83. The computer-readable medium according to claim 79, further containing computer-readable and computer executable instructions, wherein the supply structure is selected from the group consisting of:

a product structure, a supply-chain structure, a project structure, and an organizational structure.

84. The computer-readable medium according to claim 80, further containing computer-readable and computer executable instructions, wherein the supply structure is selected from the group consisting of:

a product structure, a supply-chain structure, a project structure, and an organizational structure

85. The computer-readable medium according to claim 79, further containing computer-readable and computer executable instructions, wherein, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

86. The computer-readable medium according to claim 80, further containing computer-readable and computer executable instructions, wherein, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

87. The computer-readable medium according to claim 81, further containing computer-readable and computer executable instructions, wherein, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

88. The computer-readable medium according to claim 82, further containing computer-readable and computer executable instructions, wherein, further including the step of, prior to step (a), assigning a priority value to the demand for the item.

89. The computer-readable medium according to claim 79 further containing computer-readable and computer executable instructions, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists; and

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

90. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists; and

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

91. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists; and

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

92. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein step (a) further comprises subsequent steps:

(a1) generating a demand list and a supply list for fulfilling the demand for the item;

(a2) for the first demand in the demand list, determining if a supply for fulfilling the demand exists; and

(a3) if a supply for fulfilling the demand exists, determining the plan date for the supply as in step (a); and

(a4) if a supply for fulfilling the demand does not exist, planning a new supply for fulfilling the demand and determining the plan date for the supply as in step (a)

wherein the steps (a2) through (a4) are executed for each demand in the demand list.

93. The computer-readable medium according to claim 79 further containing computer-readable and computer executable instructions, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating the each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

94. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

95. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating the each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

96. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein step (b) further comprises subsequent steps:

(b1) for each item in the supply structure, sorting a supply list by the available date;

(b2) for each item in the supply structure, sorting a demand list by the plan date of the demand;

(b3) allocating the each supply to each demand; and

(b4) propagating the available date from the lowest level to a next lowest level in the supply structure to provide a next lowest level available date;

wherein steps (b1) through (b4) are executed for each item in the supply structure from the lowest level to the highest level in the supply structure.

97. The computer-readable medium according to claim 93 further containing computer-readable and computer executable instructions, further including the step of, prior to step (b4), recording the allocation of the each supply to the demand.

98. The computer-readable medium according to claim 94 further containing computer-readable and computer executable instructions, further including the step of, prior to step (b4), recording the allocation of the each supply to the demand.

99. The computer-readable medium according to claim 95 further containing computer-readable and computer executable instructions, further including the step of, prior to step (b4), recording the allocation of the each supply to the demand.

100. The computer-readable medium according to claim 96 further containing computer-readable and computer executable instructions, further including the step of, prior to step (b4), recording the allocation of the each supply to the demand.

101. The computer-readable medium according to claim 93 further containing computer-readable and computer executable instructions, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

102. The computer-readable medium according to claim 94 further containing computer-readable and computer executable instructions, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

103. The computer-readable medium according to claim 95 further containing computer-readable and computer executable instructions, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

104. The computer-readable medium according to claim 96 further containing computer-readable and computer executable instructions, wherein, in step (b3), allocating each supply to the demand is based on the plan date for each demand.

105. The computer-readable medium according to claim 93 further containing computer-readable and computer executable instructions, wherein, in step (b3), determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

106. The computer-readable medium according to claim 94 further containing computer-readable and computer executable instructions, wherein, in step (b3), determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

107. The computer-readable medium according to claim 95 further containing computer-readable and computer executable instructions, wherein, in step (b3), determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

108. The computer-readable medium according to claim 96 further containing computer-readable and computer executable instructions, determining if the demand is fulfilled by the plan date;

for a demand fulfilled by the plan date, allocating each supply to the demand based on the plan date; and

for a demand not fulfilled by the plan date, allocating each supply to the demand based on the priority value assigned to the demand.

109. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased per period.

110. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased per period.

111. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein the at least one capacity constraint has an availability defined as a rate per period.

112. The computer-readable medium to claim 81 further containing computer-readable and computer executable instructions, wherein the at least one capacity constraint has an availability defined as a rate per period.

113. The computer-readable medium according to claim 109 further containing computer-readable and computer executable instructions, wherein the at least one capacity constraint has an availability defined as a rate per period.

114. The computer-readable medium according to claim 110 further containing computer-readable and computer executable instructions, wherein the at least one capacity constraint has an availability defined as a rate per period.

115. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

116. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

117. The computer-readable medium according to claim 109 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

118. The computer-readable medium according to claim 110 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

119. The computer-readable medium according to claim 111 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

120. The computer-readable medium according to claim 112 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

121. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

122. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

123. The computer-readable medium according to claim 109 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

124. The computer-readable medium according to claim 110 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

125. The computer-readable medium according to claim 111 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

126. The computer-readable medium according to claim 112 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

127. The computer-readable medium according to claim 115 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

128. The computer-readable medium according to claim 116 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

129. The computer-readable medium according to claim 79 further containing computer-readable and computer executable instructions, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

130. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

131. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

132. The computer-readable medium according to claim 79 further containing computer-readable and computer executable instructions, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

133. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

134. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

135. The computer-readable medium according to claim 132 further containing computer-readable and computer executable instructions, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

136. The computer-readable medium according to claim 133 further containing computer-readable and computer executable instructions, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

137. The computer-readable medium according to claim 134 further containing computer-readable and computer executable instructions, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

138. The computer-readable medium according to claim 132 further containing computer-readable and computer executable instructions, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which the each supply and the each demand for the item was requested.

139. The computer-readable medium according to claim 133 further containing computer-readable and computer executable instructions, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the demand, wherein the sub-priority value is defined by the sequence in which the each supply and the each demand for the item was requested.

140. The computer-readable medium according to claim 134 further containing computer-readable and computer executable instructions, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which the each supply and the each demand for the item was requested.

141. The computer-readable medium according to claim 79 further containing computer-readable and computer executable instructions, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of the each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking the each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

142. The computer-readable medium according to claim 80 further containing computer-readable and computer executable instructions, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of the each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking the each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

143. The computer-readable medium according to claim 81 further containing computer-readable and computer executable instructions, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of the each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking the each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.

162. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased per period.

163. The computer-readable medium to claim 82 further containing computer-readable and computer executable instructions, wherein the at least one capacity constraint has an availability defined as a rate per period.

164. The computer-readable medium according to claim 162 further containing computer-readable and computer executable instructions, wherein the at least one capacity constraint has an availability defined as a rate per period.

165. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein the availability of the at least one capacity constraint is time-phased and has an availability defined as a rate per period.

166. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

167. The computer-readable medium according to claim 162 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

168. The computer-readable medium according to claim 163 further containing computer-readable and computer executable instructions, wherein at least one capacity constraint has a cumulative maximum value.

169. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein the each supply in the supply structure has a plurality of sources for fulfilling the supply.

170. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein the method is repeated for a next item, and wherein the item is a plurality of items.

171. The computer-readable medium according to claim 170 further containing computer-readable and computer executable instructions, wherein a priority value is assigned to each supply and demand for each item of the plurality of items.

172. The computer-readable medium according to claim 171 further containing computer-readable and computer executable instructions, further including the step of, prior to step (a), queuing the plurality of demands according to a sub-priority value assigned to each supply and each demand for the item, wherein the sub-priority value is defined by the sequence in which the each supply and the each demand for the item was requested.

173. The computer-readable medium according to claim 82 further containing computer-readable and computer executable instructions, wherein, following step (c), further comprising the steps of:

(d1) retrieving the allocation record of the each supply;

(d2) providing at least one peg record for each link determined from the highest level demand to a next highest demand;

(d3) tracking the each supply allocated to the demand, in step (d1), as a path of links, from the highest level to the lowest level in the supply structure; and

(d4) maintaining a record for the path of links determined in step (d3);

wherein steps (d2) is repeated for the highest level to the lowest level of the supply structure.