Systems and methods for production planning with sequence independent setup activities

• US 7,454,260 B2
• Filed: 10/13/2006
• Issued: 11/18/2008
• Est. Priority Date: 10/24/2005
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Schulz, Thomas, Riepp, Carmen, Kulick, Thorsten, Glania, Christoph, Biegler, Hans-Juergen, Embacher, Christian, Jacob, Nikolaus
• Primary Examiner(s): DeCady; Albert
• Assistant Examiner(s): Lee; Douglas S
• Application Number:
  US11/580,090
• Publication Number:
  US 20070093923A1
• Time in Patent Office: 767 Days
• Field of Search: 700/97, 700/99, 700/100, 700/101, 700/103, 700/104, 705/8
• US Class Current: 700/99
• 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/06316 Sequencing of tasks or work

Abstract

Systems, methods, and computer program products are provided for planning production processes. In one implementation, a method is provided that includes the steps of planning a sequence of processes running on a resource, where the planning takes into account setup times for the resource for a process depending at least on predecessor process information, storing the sequence of processes, and defining time intervals for the resource within which setup times for processes are held constant independently of the predecessor process information.

Claims

1. A computer-implemented method for planning production processes, the method comprising:

planning a sequence of processes running on a resource, the planning taking into account setup times for the resource for a process depending at least on predecessor process information;

storing the sequence of processes in a computer-readable storage medium;

defining time intervals for the resource within which setup times for processes are held constant independently of the predecessor process information; and

using the sequence and the defined time intervals to execute the processes.

2. The computer-implemented method of claim 1, further comprising retrieving the stored sequence of processes for execution on the resource.

3. The computer-implemented method of claim 1, further comprising storing the predecessor process information.

4. The computer-implemented method of claim 1, further comprising storing the sequence of processes and the predecessor process information within one database.

5. The computer-implemented method claim 1, wherein defining time intervals comprises utilizing a heuristic to find time intervals on the resource within which the setup times can be held constant.

6. The computer-implemented method of claim 1, wherein the time intervals are within the range of at least one of hours, days, weeks, and months.

7. The computer-implemented method of claim 1, wherein defining time intervals comprises determining time intervals near the execution time.

8. The computer-implemented method of claim 1, wherein the predecessor process information comprises at least one of a predecessor process and the progress of a predecessor process.

9. The computer-implemented method of claim 1, wherein planning the sequence order comprises planning a sequence of processes on a resource to minimize setup times depending on predecessor process information.

10. A computer readable medium comprising program code instructions which, when executed by a processor, perform a method for planning production processes, the method comprising:

planning a sequence of processes running on a resource, the planning taking into account setup times for the resource for a process depending at least on predecessor process information;

storing the sequence of processes; and

defining time intervals for the resource within which setup times for processes are held constant independently of the predecessor process information.

11. The computer readable medium of claim 10, further comprising storing the sequence of processes and the predecessor process information within one database.

12. The computer readable medium of claim 10, wherein defining time intervals comprises utilizing a heuristic to find time intervals on the resource within which the setup times can be held constant.

13. The computer readable medium of claim 10, wherein defining time intervals comprises determining time intervals near the execution time.

14. The computer readable medium of claim 10, wherein the predecessor process information comprises at least one of a predecessor process and the progress of a predecessor process.

15. The computer readable medium of claim 10, wherein planning the sequence order comprises planning a sequence of processes on a resource to minimize setup times depending on predecessor process information.

16. A system for planning production processes, the system comprising:

a scheduling unit arranged for planning a sequence of processes running on a resource, the planning taking into account setup times for the resource for a process depending at least on predecessor process information;

a storage unit arranged for storing the sequence of processes;

a fixing unit arranged for defining time intervals for the resource within which setup times for processes are held constant independently of the predecessor process information; and

an execution unit arranged for retrieving the sequence order from the storage unit, executing the processes on the resource, and reporting process progress to the storing unit.

17. The system claim 16, wherein the fixing unit defines the time intervals utilizing a heuristic to find time intervals on the resource within which the setup times can be held constant.

18. The system of claim 16, wherein the fixing unit defines the time intervals within the range of at least one of hours, days, weeks, and months.

19. The system of claim 16, wherein the fixing unit defines the time intervals by determining time intervals near the execution time.

20. The system of claim 16, wherein the predecessor process information comprises at least one of a predecessor process and the progress of a predecessor process.

21. The method of claim 16, wherein the scheduling unit plans the sequence order by planning a sequence of processes on a resource to minimize setup times depending on predecessor process information.