Methods and systems for a multi-level scheduling framework

• US 8,073,722 B2
• Filed: 12/30/2004
• Issued: 12/06/2011
• Est. Priority Date: 06/24/2004
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAG AG
• Inventors: Biegler, Hans-Juergen, Kulick, Thorsten, Negash, Tesfaldet, Ostermeier, Jan S., Scheuer, Tobias, Schulz, Thomas, Wedner, Stefan
• Primary Examiner(s): Jasmin, Lynda
• Assistant Examiner(s): Singh, Gurkanwaljit
• Application Number:
  US11/024,878
• Publication Number:
  US 20050288983A1
• Time in Patent Office: 2,532 Days
• Field of Search: 705/8
• US Class Current: 705/7.12
• 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/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 50/188 Electronic negotiation

Abstract

A method for providing a planning framework for use in managing a project to be planned in a supply chain, comprising providing a first software layer for storing and manipulating planning data relative to the planning project; providing a second software layer for communicating with the first software layer, the second layer arranged for pre processing, preparing and post processing a predetermined planning method. By such a multilayered framework, the invention is able to execute a planning algorithms to solve multi-level planning problems, wherein generic modules can be executed as fast modules in an environment that is highly optimized in terms of load on time and system resources and specifically adapted modules are embodying a particular planning strategy that can operate on a different level that is highly flexible.

Claims

1. A computer-implemented method for providing a planning framework for use to solve a planning problem comprising the steps, performed by a processor, of:

providing, using the processor, a first software layer as a data layer of the planning framework for storing and manipulating planning data relative to a planning project;

providing, using the processor, a second software layer for communicating with the first software layer; and

performing a plurality of generic procedures on the first software layer and performing a plurality of adapted procedures on a second software layer in an alternate manner, such that each procedure performed on the first software layer is followed by a procedure performed on the second software layer,

wherein performing the plurality of generic procedures and performing the plurality of adapted procedures comprise;

executing a general initializing procedure, on the first software layer, for generating planning activities in the planning project, wherein the planning activities are formed as nodes in a planning network and planning activity dependencies are formed as borders of the planning network, both the nodes and the borders executing on the data layer of the planning framework;

executing a preprocessing procedure, on the second software layer, for determining at least one planning parameter associated with the planning activities in the planning network;

executing a planning procedure, on the first software layer, for returning source activities among the planning activities from the planning network;

executing a preparing procedure, on the second software layer, for selecting a plurality of planning activities to be scheduled at a present iteration from the source activities returned in the planning procedure based on the at least one planning parameter;

setting aside at least one planning activity among the source activities returned in the planning procedure for a next iteration; and

executing a schedule setting procedure, on the second software layer, for determining the order in which the planning activities selected in the preparing procedure are to be scheduled.

2. The computer-implemented method according to claim 1, wherein said preparing procedure is a heuristic planning method.

3. The computer-implemented method according to claim 1, wherein the generic procedures performed on the first software layer are optimized for processing the planning data, and wherein the adapted procedures performed on the second software layer are adaptable for a specific heuristic planning method.

4. The computer-implemented method according to claim 3, wherein the procedures performed on the first software layer and the procedures performed on the second software layer are configurable.

5. The computer-implemented method according to claim 2, wherein the heuristic planning method is a multi-level planning problem.

6. The computer-implemented method according to claim 1, further comprising allocating a valid planning status to a planning activity that is valid with respect to said preparing procedure.

7. The computer-implemented method according to claim 1, wherein the general initializing procedure, the preprocessing procedure, and the planning procedure are performed iteratively until a predetermined criterion is met.

8. The computer-implemented method according to claim 6, wherein the general initializing procedure, the preprocessing procedure, and the planning procedure are performed iteratively until a predetermined criterion is met, and the predetermined criterion are a maximum of iterations, a predetermined optimization parameter, or every planning activity is allocated a valid planning status.

9. The computer-implemented according to claim 6, wherein at least some of the planning activities in said planning network are temporarily allocated an invalid planning status.

10. The computer-implemented method according to claim 1, wherein the schedule setting procedure further comprises a scheduling adjustment for a scheduling window of a planning activity in a resource.

11. The computer-implemented method according to claim 1, wherein only a selected number of activities are planned according to the schedule setting procedure.

15. The computer-implemented method according to claim 1, wherein the source activities are not predecessed by an unplanned activity.

12. A computer system for providing a planning framework for use to solve a planning problem, comprising:

a computer processor;

a computer-readable storage medium;

a first software layer as a data layer of the planning framework embodied on the computer-readable storage medium comprising a plurality of generic modules, executed by the computer processor, for storing and manipulating planning data relative to a planning project, said plurality of generic modules comprising;

a preprocessing module for determining at least one planning parameter, and

a preparing module for selecting a plurality of planning activities to be scheduled at a present iteration from source activities returned in a planning procedure based on the at least one planning parameter, and setting aside at least one planning activity among the source activities returned in the planning procedure for a next iteration;

a second software layer embodied on the computer-readable medium comprising a plurality of modules adaptable for a predetermined planning method for communicating with the first software layer, said plurality of adapted modules comprising;

a general initializing module for generating planning activities in the planning project, wherein the planning activities are formed as nodes in a planning network and planning activity dependencies are formed as borders of the planning network, both the nodes and the borders executing on the data layer of the planning framework;

a planning module for returning the source activities from the planning network, and

a schedule setting module for determining the order in which the planning activities selected in the preparing procedure are to be scheduled; and

an interface comprising a user interface, combining said first and second software layers and controlling the program flow between said plurality of generic and said plurality of adapted modules in an alternate manner, such that each procedure performed on the first software layer is followed by a procedure performed on the second software layer.

13. The computer system according to claim 12, comprising a client-system comprising a user interface and at least one server-system communicatively connected to said client-system, the server-system arranged for running at least said first or second software layer.

16. The computer system according to claim 12, wherein the source activities are not predecessed by an unplanned activity.

14. A computer program product, comprising a non-transitory computer-usable medium having a computer-readable program code embodied therein, the computer-readable program code adapted to be executed by a computer processor to implement a method for solving a business problem, the method comprising:

providing a first software layer as a data layer of the planning framework for storing and manipulating planning data relative to a planning project;

providing a second software layer for communicating with the first software layer; and

performing a plurality of generic procedures on the first software layer and performing a plurality of adapted procedures on the second software layer in an alternate manner, such that each procedure performed on the first software layer is followed by a procedure performed on the second software layer,

wherein performing the plurality of generic procedures and performing the plurality of adapted procedures comprise;

executing a general initializing procedure, on the first software layer, for generating planning activities in the planning project, wherein the planning activities are formed as nodes in a planning network and planning activity dependencies are formed as borders of the planning network, both the nodes and the borders executing on the data layer of the planning framework;

executing a preprocessing procedure, on the second software layer, for determining at least one planning parameter associated with the planning activities in the planning network;

executing a planning procedure, on the first software layer, for returning source activities among the planning activities from the planning network;

executing a preparing procedure, on the second software layer, for selecting a plurality of planning activities to be scheduled at a present iteration from the source activities returned in the planning procedure based on the at least one planning parameter;

setting aside at least one planning activity among the source activities returned in the planning procedure to a next iteration; and

executing a schedule setting procedure, on the second software layer, for determining the order in which the planning activities selected in the preparing procedure are to be scheduled.

17. The computer program product according to claim 14, wherein the source activities are not predecessed by an unplanned activity.