METHOD FOR ORGANIZING PROCESSES

• US 20100017244A1
• Filed: 07/16/2008
• Published: 01/21/2010
• Est. Priority Date: 07/16/2008
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Shaikh, Anees A., Saha, Debanjan, Sahoo, Ramendra K.
• Application Number:
  US12/174,130
• Publication Number:
  US 20100017244A1
• Time in Patent Office: Days
• US Class Current: 705/8
• 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/06393 Score-carding, benchmarking or key performance indicator [KPI] analysis

Abstract

Techniques for generating a target process are provided. The techniques include identifying at least one of one or more steps and one or more artifacts within a target process and one or more other processes, pre-fetching the at least one of one or more atomic steps, one or more decision steps and splits and one or more merges to be used in the target process from the one or more other processes, and associating the at least one of one or more atomic steps, one or more decision steps and splits and one or more merges to be used in the target process at one or more decision points to generate the target process.

Claims

1. A method for generating a target process, comprising the steps of:

identifying at least one of one or more steps and one or more artifacts within a target process and one or more other processes;

pre-fetching the at least one of one or more steps and one or more artifacts within a target process and one or more other processes; and

associating the at least one of one or more steps and one or more artifacts to be used in the target process at one or more decision points to generate the target process.

2. The method of claim 1, further comprising cataloging the at least one of one or more steps and one or more artifacts within a target process and one or more other processes.

3. The method of claim 1, further comprising warehousing the at least one of one or more steps and one or more artifacts within a target process and one or more other processes.

4. The method of claim 1, wherein the one or more steps comprise at least one of one or more atomic steps and one or more decision steps.

5. The method of claim 1, wherein the one or more steps comprise at least one of one or more process-related dependent steps and one or more process-related independent steps.

6. The method of claim 1, wherein the one or more artifacts comprise at least one of a time measure, one or more splits and one or more merges.

7. The method of claim 1, further comprising determining one or more decision points in the target process.

8. The method of claim 1, further comprising representing one or more processes, one or more cost structures and one or more role annotations, wherein the one or more processes, one or more cost structures and one or more role annotations are synchronized at a smallest indivisible task.

10. The method of claim 1, further comprising backlogging prevention and dynamic rerouting within a process chain operation to meet one or more needs of a user.

11. The method of claim 10, wherein the user comprises a customer.

9. The method of claim l, further comprising defining one or more relationships and one or more transaction locks between two or more process steps.

12. A computer program product comprising a computer readable medium having computer readable program code for generating a target process, said computer program product including:

computer readable program code for identifying at least one of one or more steps and one or more artifacts within a target process and one or more other processes;

computer readable program code for pre-fetching the at least one of one or more steps and one or more artifacts within a target process and one or more other processes; and

computer readable program code for associating the at least one of one or more steps and one or more artifacts to be used in the target process at one or more decision points to generate the target process.

13. The computer program product of claim 12, wherein the one or more steps comprise at least one of one or more atomic steps and one or more decision steps.

14. The computer program product of claim 12, wherein the one or more steps comprise at least one of one or more process-related dependent steps and one or more process-related independent steps.

15. The computer program product of claim 12, wherein the one or more artifacts comprise at least one of a time measure, one or more splits and one or more merges.

16. The computer program product of claim 12, further comprising computer readable program code for cataloging the at least one of one or more steps and one or more artifacts within a target process and one or more other processes.

17. The computer program product of claim 12, further comprising computer readable program code for warehousing the at least one of one or more steps and one or more artifacts within a target process and one or more other processes.

18. The computer program product of claim 12, further comprising computer readable program code for determining one or more decision points in the target process.

19. The computer program product of claim 12, further comprising computer readable program code for representing one or more processes, one or more cost structures and one or more role annotations, wherein the one or more processes, one or more cost structures and one or more role annotations are synchronized at a smallest indivisible task.

20. The computer program product of claim 12, further comprising computer readable program code for defining one or more relationships and one or more transaction locks between two or more process steps.

21. The computer program product of claim 12, further comprising computer readable program code for backlogging prevention and dynamic rerouting within a process chain operation to meet one or more needs of a user.

22. The computer program product of claim 21, wherein the user comprises a customer.

23. An apparatus for generating a target process, comprising:

a memory; and

at least one processor coupled to said memory and operative to;

identify at least one of one or more steps and one or more artifacts within a target process and one or more other processes;

pre-fetch the at least one of one or more steps and one or more artifacts within a target process and one or more other processes; and

associate the at least one of one or more steps and one or more artifacts to be used in the target process at one or more decision points to generate the target process.

24. The apparatus of claim 23, wherein the one or more steps comprise at least one of one or more atomic steps and one or more decision steps.

25. The apparatus of claim 23, wherein the one or more steps comprise at least one of one or more process-related dependent steps and one or more process-related independent steps.

26. The apparatus of claim 23, wherein the one or more artifacts comprise at least one of a time measure, one or more splits and one or more merges.

27. The apparatus of claim 23, wherein the at least one processor coupled to said memory is further operative to catalogue the at least one of one or more steps and one or more artifacts within a target process and one or more other processes.

28. The apparatus of claim 23, wherein the at least one processor coupled to said memory is further operative to warehouse the at least one of one or more steps and one or more artifacts within a target process and one or more other processes.

29. The apparatus of claim 23, wherein the at least one processor coupled to said memory is further operative to determine one or more decision points in the target process.

30. The apparatus of claim 23, wherein the at least one processor coupled to said memory is further operative to represent one or more processes, one or more cost structures and one or more role annotations, wherein the one or more processes, one or more cost structures and one or more role annotations are synchronized at a smallest indivisible task.

31. The apparatus of claim 23, wherein the at least one processor coupled to said memory is further operative to define one or more relationships and one or more transaction locks between two or more process steps.

32. The apparatus of claim 23, wherein the at least one processor coupled to said memory is further operative to backlog prevention and dynamic rerouting within a process chain operation to meet one or more needs of a user.

33. The apparatus of claim 32, wherein the user comprises a customer.