Methods and computer systems for reducing runtimes in material requirements planning

• US 7,653,452 B2
• Filed: 09/09/2004
• Issued: 01/26/2010
• Est. Priority Date: 09/09/2003
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Von Bergen, Axel, Schwarz, Arne, Sauermann, Volker, Lokowandt, Bernhard
• Primary Examiner(s): Zeender; F.
• Assistant Examiner(s): SHAAWAT, MUSSA A
• Application Number:
  US10/936,532
• Publication Number:
  US 20050080690A1
• Time in Patent Office: 1,965 Days
• Field of Search: None
• US Class Current: 700/106
• CPC Class Codes: G06Q 10/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 Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/0875 Itemisation or classification of parts, supplies or services, e.g. bill of materials

Abstract

Methods and computer systems are provided for reducing the runtime of a material requirements planning run. In one embodiment, a computer system loads a plurality of bills of materials into a data structure. The computer system may analyze parent-child relationships between components of the plurality of bills of materials in the data structure and set for each component in the data structure a counter value that indicates the number of parent components for each component. The counter value of a specific child component may be decremented when the planning of a parent component of the specific child component is completed. The computer system may then proceed with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.

Claims

1. A method for material requirements planning, the method being executed by a computer and comprising:

loading, by using a processor of the computer, a plurality of bills of materials into a data structure stored in a storage device of the computer, the bills of materials having components with planning levels and the components being arranged in parent-child relationships, wherein the components include a specific child component having a specific planning level;

analyzing, by using the processor, parent-child relationships between components of the plurality of bills of materials in the data structure;

setting, by using the processor, for each component in the data structure a counter value that indicates a number of parent components for each component, the counter values including a specific counter value for the specific child component, wherein the specific counter value has a value different from a value of the specific planning level if a number of parent components of the specific child component are greater than or less than the value of the specific planning level;

decrementing, by using the processor, the counter value of a specific child component when a planning of the parent component of the specific child component is completed, the counter value being decremented by a number used to count the parent component in the counter value during the setting of the counter value, wherein the specific planning level is subordinate to the planning level of an other component included in the bills of materials, the other component having the same planning level as the planning level of a parent component of the specific child component;

setting, by using the processor, a planning flag for the specific child component; and

proceeding, by using the processor, with the planning of the specific child component even if planning of the other component, which is at a higher planning level than the specific planning level, is not complete and if the planning flag is set for the specific child component.

2. The method of claim 1, wherein the counter values are set for each component having a planning flag.

3. The method of claim 1 further comprising proceeding with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.

4. The method of claim 1, wherein the proceeding step is performed by a first process executed by a first processor at the subordinate planning level and the planning of the other component is performed by a second process executed by a second processor arranged in parallel.

5. The method of claim 1, wherein the data structure is implemented as a non-relational table using pointers to reflect the parent-child relationships between components.

6. The method of claim 5, wherein a planning duration for each component is stored in the data structure.

7. The method of claim 6, wherein the planning duration for each component from a previous execution of the method is used to bundle components into packages for optimized parallel processing.

8. A computer program product tangibly embodied in a storage memory for material requirements planning, the storage memory comprising a instructions which when executed on a processor of a computer system cause the processor to perform a method, the method comprising:

loading a plurality of bills of materials into a data structure, the bills of materials having components with planning levels and the components being arranged in parent-child relationships, wherein the components include a specific child component having a specific planning level;

analyzing parent-child relationships between components of the plurality of bills of materials in the data structure;

setting for each component in the data structure a counter value that indicates a number of parent components for each component, the counter values including a specific counter value for the specific child component, wherein the specific counter value has a value different from a value of the specific planning level if a number of parent components of the specific child component are greater than or less than the value of the specific planning level;

decrementing the counter value of a specific child component when a planning of the parent component of the specific child component is completed, the counter value being decremented by a number used to count the parent component in the counter value during the setting of the counter value, wherein the specific planning level is subordinate to the planning level of an other component included in the bills of materials, the other component having the same planning level as the planning level of a parent component of the specific child component;

setting a planning flag for the specific child component; and

proceeding with the planning of the specific child component even if planning of the other components, which is at a higher planning level than the specific planning level, is not complete and if the planning flag is set for the specific child component.

9. The computer program product of claim 8, wherein the data structure is implemented as a non-relational table using pointers to reflect the parent-child relationships between components.

10. The computer program product of claim 8, wherein the counter values are set for each component having a planning flag.

11. The computer program product of claim 8 further comprising proceeding with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.

17. The computer program product of claim 8, wherein a planning duration for each component is stored in the data structure.

18. The computer program product of claim 17, wherein the planning duration for each component from a previous execution of the method is used to bundle components into packages for optimized parallel processing.

12. A computer system for material requirements planning, the computer system comprising:

a first storage component for storing a plurality of bills of materials;

a second storage component for loading the plurality of bills of materials into a data structure, the bills of materials having components with planning levels and the components being arranged in parent-child relationships, wherein the components include a specific child component having a specific planning level; and

a processor that is adapted to;

analyze parent-child relationships between components of the plurality of bills of materials in the data structure;

set for each component in the data structure a counter value that indicates a number of parent components for each component, the counter values including a specific counter value for the specific child component, wherein the specific counter value has a value different from a value of the specific planning level if a number of parent components of the specific child component are greater than or less than the value of the specific planning level;

decrement the counter value of a specific child component when a planning of the parent component of the specific child component is completed, the counter value being decremented by a number used to count the parent component in the counter value during the setting of the counter value, wherein the specific planning level is subordinate to the planning level of an other component included in the bills of materials, the other component having the same planning level as the planning level of a parent component of the specific child component;

set a planning flag for the specific child component; and

proceed with the planning of the specific child component even if planning of the other component, which is at a higher planning level than the specific planning level, is not complete and if the planning flag is set for the specific child component.

13. The computer system of claim 12, wherein the counter values are set for each component having a planning flag.

14. The computer system of claim 12, wherein the processor proceeds with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.

15. The computer system of claim 12, wherein the processor performs the planning of multiple components in parallel processes.

16. The computer system of the claim 12, wherein the data structure in the second storage component is implemented as a non-relational table using pointers to reflect the parent-child relationships between components.

19. The computer system of the claim 12, wherein a planning duration for each component is stored in the data structure.

20. The computer system of claim 19, wherein the planning duration for each component from a previous execution of the method is used to bundle components into packages for optimized parallel processing.