Systems, methods and computer program products for compact scheduling

• US 8,533,023 B2
• Filed: 12/29/2005
• Issued: 09/10/2013
• Est. Priority Date: 12/29/2004
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Braun, Heinrich K., Engelmann, Thomas H., Hentschel, Martin D.
• Primary Examiner(s): FEENEY, BRETT A
• Application Number:
  US11/319,374
• Publication Number:
  US 20060143063A1
• Time in Patent Office: 2,812 Days
• Field of Search: None
• US Class Current: 705/7.24
• 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

Abstract

Methods, systems and computer program products are provided for allocating resources in a plannable process, wherein a number of resources is used for executing an order comprising a chain of related activities to be executed on the number of resources. In one implementation, a method comprises, for each order, identifying a first activity execution due date for executing a predetermined first activity in the order, scheduling an execution date for each activity according to a just-in-time criterion in correspondence with an activity execution due date of a related activity, identifying a second activity execution date for executing a predetermined second activity in the order that is scheduled according to the scheduling routine, and reversely scheduling an execution date for each activity according to a just-in-time criterion in correspondence with an activity execution due date of a reverse related activity, wherein the second activity execution date is kept fixed as a second activity execution due date.

Claims

1. A method of allocating resources in a plannable process, a predetermined number of resources being used for executing an order comprising a chain of related activities to be executed on the predetermined number of resources, the method being executed by a processor and comprising:

scheduling an activity execution date for each activity of the related activities according to a just-in-time criterion in correspondence with an activity execution due date of a related activity;

identifying a first activity execution due date for executing a predetermined first activity in the order;

identifying a second activity execution date for executing a predetermined second activity in the order that is scheduled according to a scheduling routine;

selecting a predefined scheduling constraint defining a relation between the predetermined first activity and the predetermined second activity;

associating a dummy activity with at least one of the predetermined first activity and the predetermined second activity;

determining a minimum lead time based on a sum of (i) a minimum wait time associated with at least one of the predetermined first activity and the predetermined second activity and (ii) a minimum execution time associated with at least one of the predetermined first activity and the predetermined second activity;

determining a maximum lead time based on a sum of (i) a product of the dummy activity and the minimum lead time and (ii) an offset value; and

reversely scheduling, by using the processor, the activity execution date for the each activity of the related activities according to the predefined scheduling constraint, the maximum lead time, and the just-in-time criterion in correspondence with an activity execution due date of a reverse related activity, wherein the second activity execution date is kept fixed.

2. A method according to claim 1, wherein the just-in-time criterion is evaluated in accordance with scheduling the activity execution date for the each activity of the related activities so that a time span between the scheduled activity execution date and a related activity execution due date is less than a predetermined minimum value.

3. A method according to claim 1, wherein the just-in-time criterion is evaluated in accordance with scheduling the activity execution date for the each activity of the related activities so that a time span between the scheduled activity execution date and a related activity execution due date is minimal.

4. A method according to claim 1, wherein scheduling is performed forward in time for related activities in succeeding order, and wherein reverse scheduling is performed backwards in time for related activities in preceding order.

5. A method according to claim 1, wherein the first activity execution due date is changed based on the just-in-time criterion.

6. A method according to claim 1, wherein the predetermined second activity is a succeeding activity and a succeeding activity execution date is scheduled according to a succeeding activity earliest start date in correspondence with a preceding activity start due date.

7. A method according to claim 1, wherein the first activity execution due date is an order start due date.

8. A method according to claim 7, wherein the second activity execution date is an earliest order finish date.

9. A method according to claim 1, wherein the first activity execution due date is an order finish due date.

10. A method according to claim 9, wherein the second activity execution date is a latest order start date.

11. A computer program product comprising a computer program stored on a non-transitory computer readable medium, the computer program comprising instructions, which when executed on a processor causes the processor to perform a method, the method comprising:

scheduling an activity execution date for each activity of the related activities according to a just-in-time criterion in correspondence with an activity execution due date of a related activity;

identifying a first activity execution due date for executing a predetermined first activity in the order;

identifying a second activity execution date for executing a predetermined second activity in the order that is scheduled according to a scheduling routine;

selecting a predefined scheduling constraint defining a relation between the predetermined first activity and the predetermined second activity;

associating a dummy activity with at least one of the predetermined first activity and the predetermined second activity;

determining a minimum lead time based on a sum of (i) a minimum wait time associated with at least one of the predetermined first activity and the predetermined second activity and (ii) a minimum execution time associated with at least one of the predetermined first activity and the predetermined second activity;

determining a maximum lead time based on a sum of (i) a product of the dummy activity and the minimum lead time and (ii) an offset value; and

reversely scheduling, by using the processor, the activity execution date for the each activity of the related activities according to the predefined scheduling constraint, the maximum lead time, and the just-in-time criterion in correspondence with an activity execution due date of a reverse related activity, wherein the second activity execution date is kept fixed.

12. A system for allocating resources in a plannable process, the system comprising a module for representing a predetermined number of resources to be used for executing an order comprising a chain of related activities to be executed on the predetermined number of resources, the system further comprising:

an input device for identifying a first activity execution due date for executing a predetermined first activity in the order;

a scheduling module for scheduling an activity execution date for each activity of the related activities according to a just-in-time criterion in correspondence with an activity execution due date of a related activity;

a processor executing an identification module for;

identifying a second activity execution date from the scheduling module for executing a predetermined second activity in the order;

selecting a predefined scheduling constraint defining a relation between the predetermined first activity and the predetermined second activity;

associating a dummy activity with at least one of the first activity and second activity;

determining a minimum lead time based on a sum of (i) a minimum wait time associated with at least one of the predetermined first activity and the predetermined second activity and (ii) a minimum execution time associated with at least one of the predetermined first activity and the predetermined second activity;

determining a maximum lead time based on a sum of (i) a product of the dummy activity and the minimum lead time and (ii) an offset value; and

submitting the identified second activity execution date to the scheduling module, and the scheduling module being adapted to schedule in reverse an execution date for the each activity of the related activities according to the predefined scheduling constraint, the maximum lead time, and the just-in-time criterion in correspondence with an activity execution due date of a reverse related activity, wherein the second activity execution date is kept fixed as identified by the identification module; and

an output device for outputting a scheduled order to a user interface.

13. A system according to claim 12, wherein the just-in-time criterion is evaluated in accordance with scheduling the activity execution date for the each activity of the related activities so that a time span between the scheduled activity execution date and a related activity execution due date is less than a predetermined minimum value.

14. A system according to claim 12, wherein the just-in-time criterion is evaluated in accordance with scheduling the activity execution date for the each activity of the related activities so that a time span between the scheduled activity execution date and a related activity execution due date is minimal.

15. A system according to claim 12, wherein scheduling is performed forward in time for related activities in succeeding order.

16. A system according to claim 12, wherein the first activity execution due date is changed based on the just-in-time criterion.

17. A system according to claim 12, wherein the predetermined second activity is a succeeding activity and a succeeding activity execution date is scheduled according to a succeeding activity earliest start date in correspondence with a preceding activity start due date.

18. A system according to claim 12, wherein the first activity execution due date is an order start due date.

19. A system according to claim 18, wherein the second activity execution date is an earliest order finish date.

20. A system according to claim 12, wherein the first activity execution due date is an order finish due date.

21. A system according to claim 20, wherein the second activity execution date is a latest order start date.