System and method for constructing a schedule that better achieves one or more business goals

• US 20050216324A1
• Filed: 02/09/2005
• Published: 09/29/2005
• Est. Priority Date: 03/24/2004
• Status: Abandoned Application

• Current Assignee: Clevor Technologies Incorporated
• Original Assignee: Clevor Technologies Incorporated
• Inventors: Lee, Howard, McConaghy, Trent, Zhou, Yin, McKee, Adam, Maithell, Ravi, Zhou, Joe
• Application Number:
  US11/052,883
• Publication Number:
  US 20050216324A1
• 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/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/06313 Resource planning in a project environment
• CPC Class Codes: G06Q 10/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/0637 Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
• CPC Class Codes: G06Q 10/06375 Prediction of business process outcome or impact based on a proposed change

Abstract

A system and method for constructing a schedule that better achieves one or more business goals by generating a schedule optimized for at least one business goal comprising either a business objective or a business constraint. The present system and method, in addition to using information about the set of tasks, any information about constraints about the tasks, the available resources, the time to complete the tasks, all costs and any additional information in relation to the available resources, the present method, also uses information about the costs associated with the project, the sales revenues or fees earned by the project, customer satisfaction and alternative resources, in order to generate an optimized schedule meeting one or more defined business goals.

Claims

1. A method of building an optimized schedule to complete at least one project, the schedule being optimized for at least one business goal, said method comprising:

parsing said at least one project into a plurality of tasks;

in respect of each task;

defining fixed costs associated with the task;

defining task constraints associated with the task;

defining at least one resource capable of completing the task and in respect of the resource;

defining the time to complete the task using the at least one resource;

defining costs associated with the at least one resource;

and defining resource constraints associated with the at least one resource;

defining at least one business goal;

generating a set of alternate schedules containing at least one alternate schedule, each alternate schedule being feasible based on any task constraints and any resource constraints and determining an optimization score for each alternative schedule based on the at least one business goal; and

determining the alternate schedule with the best optimization score, being the optimized schedule; and

returning the optimized schedule.

2. The method of claim 1 wherein the at least one business goal comprises a business objective and the business objective comprises a defined variable to be maximized in the optimized schedule.

3. The method of claim 1 wherein the at least one business goal comprises a business objective and the business objective comprises a defined variable to be minimized in the optimized schedule.

4. The method of claim 1 wherein the at least one business goal comprises a business constraint and the business constraint comprises a defined value and wherein a defined variable in the optimized schedule must have a value lower than the defined value.

5. The method of claim 1 wherein the at least one business goal comprises a business constraint and the business constraint comprises a defined value and wherein a defined variable in the optimized schedule must have a value higher than the defined value.

6. The method of claim 1 wherein the at least one business goal comprises a business constraint and the business constraint comprises a defined value and wherein a defined variable in the optimized schedule must have the same value as the defined value.

7. The method of claim 1 comprising defining any global costs associated with the at least one project

8. The method of claim 1 comprising defining any project costs associated with the at least one project.

9. The method of claim 1 comprising allowing a user to choose from a range of alternate schedules with different optimization scores and returning an optimized schedule based on the user'"'"'s selection.

10. The method of claim 6 wherein the number of schedules is a nondominated set of schedules.

11. The method of claim 1 further comprising defining operation operators and use of the optimization operators in the generation of said set of alternate schedules to alter said alternate schedules.

12. The method of claim 1 comprising defining at least one alternative resource that can be used to complete at least one of the tasks and defining the time required to complete the task using the at least one alternative resource, the costs associated with the at least one alternative resource and the resource constraints associated with the at least one alternative resource.

13. The method of claim 1 wherein in respect of a resource, defining for each resource the minimum and maximum number of that resource available and defining the time required to complete the task for each number of resources between the minimum and maximum number.

14. The method of claim 1 wherein the task constraints for a task comprises a precedence relationships between the task and another task.

15. The method of claim 1 further comprising:

partially executing the at least one project in accordance with the optimized schedule;

for each task that has been completed, redefining the fixed costs the task constraints and for each resource defined for the task redefining the time to complete the task using the at least one resource, costs associated with at least one resource and the resource constraints, using actual numbers based on the real results incurred completing the task;

for each task that has been partially completed, redefining the fixed costs and the task constraints and for each resource defined for the task redefining the time to complete the task using the at least one resource, costs associated with at least one resource and the resource constraints using actual numbers based upon the real results incurred in partially completing the task and multiplying the number by the percentage the task is completed.

using the redefined values, regenerating a set of alternate schedules containing at least one alternate schedule, each alternate schedule being feasible based on any revised task constraints and any revised resource constraints and determining an optimization score for each alternative schedule based on the at least one business goal; and

determining the alternate schedule with the best optimization score, being the optimized schedule; and

returning the optimized schedule

16. The method of claim 1 comprising, until a set of stopping conditions are met:

generating an additional set of alternative schedules to complete said at least one project, the set of alternative schedules containing at least one alternative schedule, the additional set of schedules being feasible, based on the task constraints and resource constraints and determining an optimization score for each said alternate schedule;

determining the alternate schedule with the best optimization score, being the optimized schedule; and

returning the optimized schedule.

17. The method of claim 1 comprising defining the risks related to the at least one project and factoring the risks into generating the set of schedules.

18. The method of claim 1 comprising defining a first business goal and a second goal and the optimization score for each alternative schedule is based on the first business goal and the second goal.

19. The method of claim 15 wherein the first business goal comprises a business objective.

20. The method of claim 15 wherein the first business goal comprises a business constraint.

21. The method of claim 15 wherein the second goal comprises a business goal.

22. The method of claim 15 wherein the second goal comprises a business objective.

23. The method of claim 15 wherein the second goal comprises a business constraint.

24. The method of claim 15 wherein the second goal comprises an operational goal.

25. The method of claim 15 wherein the second goal comprises an operational objective.

26. The method of claim 15 wherein the second goal comprises an operational constraint.

27. The method of claim 1 wherein there is a first project and a second project and the set of tasks need to complete both the first project and the second project make up the set of tasks.

28. The method of claim 1 wherein the business goal is total cost of the schedule and a smaller cost is more desirable than a larger cost.

29. The method of claim 1 wherein the business goal is maximum total profit of the schedule.

30. The method of claim 1 wherein the business goal is total sale value of the schedule and a larger total sales value is more desirable than a smaller total sales value.

31. The method of claim 1 wherein the business goal is customer satisfaction and greater customer satisfaction is more desirable than lesser customer satisfaction.

32. The method of claim 1 wherein an operational goal is project completion time and smaller project completion time is more desirable than larger project completion time.

33. The method of claim 1 wherein an operational goal is resource utilization.

34. A method for determining a schedule to complete at least one project, the schedule being optimized for a goal and comprising:

breaking down the project into a set of tasks and for each task defining any fixed costs, any additional information and any constraints associated with the task;

identifying and defining, for each of the tasks, a first resource able to complete the task and for each first resource defining the time to complete the task using the first resource, any costs associated with the first resource and any additional information associated with the first resource;

identifying and defining, for at least one of the tasks, a second resource capable of completing the at least one of the tasks and for the second resource defining the time to complete the at least one of the tasks using the second resource, any costs associated with the second resource and any additional information associated with the second resource;

defining at least one goal;

generating a set of schedules containing at least one schedule, the set of schedules being feasible and each schedule comprising the set of tasks which comprises the at least one task associated with either the first resource or the second resource;

calculating the value of the at least one goal for each schedule in the set of schedules and determining the schedule with the best value for the at least one goal in the set of schedules; and

returning the schedule with the best value of the at least one goal.

35. A method for determining a schedule to complete at least one project, the schedule being optimized for a goal and comprising:

breaking down the project into a set of tasks and for each task defining any fixed costs, any additional information and any constraints associated with the task;

identifying and defining, for each of the tasks, a resource able to complete the task and for each first resource defining the time to complete the task using the first resource, any costs associated with the first resource and any additional information associated with the first resource;

identifying and defining, for at least one of the tasks, a maximum number of a resource capable of completing the at least one of the tasks and a minimum number of the resource and defining the time to complete the at least one of the tasks using the different number of available resources, any costs associated with the second resource and any additional information associated with the second resource;

defining at least one goal;

generating a set of schedules containing at least one schedule, the set of schedules being feasible and each schedule comprising the set of tasks which comprises the at least one task associated with either the first resource or the second resource;

calculating the value of the at least one goal for each schedule in the set of schedules and determining the schedule with the best value for the at least one goal in the set of schedules; and

returning the schedule with the best value of the at least one goal.

37. The computer system of claim 35 wherein the display device is operative to display the schedule with the best value for the at least one business objective.

38. The computer system of claim 35 wherein the memory storage device is operative to store the schedule with the best value for the at least one business objective.

39. The computer system of claim 35 wherein business goal comprises a business objective.

40. The computer system of claim 35 wherein the business goal comprises a business constraint.

41. The computer system of claim 35 wherein the input information further comprises any global costs associated with the at least one project.

42. The computer system of claim 35 wherein the input information further comprises any project costs associated with the at least one project.

43. The computer system of claim 35 wherein the program module is operative to return a number of schedules with different values for the at least one business goal and allowing a user to pick one of the returned schedules.

44. The computer system of claim 42 wherein the number of schedules is a nondominated set of schedules.

45. The computer system of claim 35 wherein optimization operators are inputted using the input device and the processing unit generates schedules that are altered based on the optimization operators.

46. The computer system of claim 35 wherein the input information further comprises at least one alternative resource that can be used for one of the tasks and the time required to complete the task using the at least one alternative resource.

47. The computer system of claim 35 wherein the input information further comprises for each resource the minimum and maximum number of that resource available and the time required to complete the task for each number of resources between the minimum and maximum number.

48. The computer system of claim 35 wherein the any additional information inputted for each task comprises any precedence relationships.

49. The computer system of claim 35 wherein the processing unit, until a set or stopping conditions are met, can generate an additional set of schedules containing at least one schedule, the additional set of schedules being feasible, based on any additional information and any constraints defined for each project task and any additional information associated with each resource and calculating the value of the at least one business goal for each schedule in the additional set of schedules and determining the schedule with the value for the at least one business goal in the additional set of schedules.

50. The computer system of claim 35 wherein the input information further comprises risk information related to the at least one project and the processing unit is operative to factor the risk information into generating the set of schedules.

51. The computer system of claim 35 wherein the input information comprises a first business goal and a second goal and the processing unit is operative to calculate the value of the first business goal and the second goal for each schedule in the set of schedules and determine the schedule with the best value for the first business objective in the set of schedules and determine the schedule with the best value for the second goal in the set of schedules.

52. The computer system of claim 50 wherein the processing unit is operative to return the schedule with the best value for the first business goal in the set of schedules and the schedule with the best value for the second goal.

53. The computer system of claim 50 wherein the first business goal comprises a business objective.

54. The computer system of claim 50 wherein the first business goal comprises a business constraint.

55. The computer system of claim 50 wherein the second goal comprises a business goal.

56. The computer system of claim 50 wherein the second goal comprises a business objective.

57. The computer system of claim 50 wherein the second goal comprises a business constraint.

58. The computer system of claim 50 wherein the second goal comprises an operational goal.

59. The computer system of claim 50 wherein the second goal comprises an operational objective.

60. The computer system of claim 50 wherein the second goal comprises an operational constraint.

61. The computer system of claim 35 wherein the input information comprises a first project and a second project and the set of tasks need to complete both the first project and the second project make up the set of tasks.

62. The computer system of claim 35 wherein the business goal is total cost of the schedule and a smaller cost is more desirable than a larger cost.

63. The computer system of claim 35 wherein the business goal is maximum total profit of the schedule.

64. The computer system of claim 35 wherein the business goal is total sale value of the schedule and a larger total sales value is more desirable than a smaller total sales value.

65. The computer system of claim 35 wherein the business goal is customer satisfaction and greater customer satisfaction is more desirable than lesser customer satisfaction.

66. The computer system of claim 35 wherein an operational goal is project completion time and smaller project completion time is more desirable than larger project completion time.

67. The computer system of claim 35 wherein an operational goal is resource utilization.

36. A computer system for creating a schedule to complete at least one project, the schedule being optimized for a business goal and comprising:

a processing unit;

a memory storage device operatively connected to the processing unit;

an input device operatively connected to the processing unit wherein the input device is operative to transmit information to the processing unit;

a display device operative for displaying data and operatively connected to the processing unit; and

a program module stored in the memory storage device operative for providing instructions to the processing unit, the processing unit responsive to the instructions of the program module, the program module operative for;

receiving, from the input device, input information comprising;

a set of tasks necessary to complete at least one project and for each of the tasks any fixed costs, any additional information and any constraints associated with the task;

the resources necessary to complete each task and for each resource the time to complete the task using the resource, any costs associated with the resource and any additional information associated with the resource;

at least one business goal;

generating a set of schedules containing at least one schedule, the set of schedules being feasible, based on any additional information and any constraints defined for each project task and any additional information associated with each resources;

calculating the value of the at least one business goal for each schedule in the set of schedules and determining the schedule with the best value for the at least one business objective in the set of schedules; and

returning the schedule with the best value for the at least one business objective.