Multiple project scheduling system

• US 7,089,193 B2
• Filed: 05/09/2001
• Issued: 08/08/2006
• Est. Priority Date: 05/09/2001
• Status: Expired due to Fees

• Current Assignee: Prochain Solutions Incorporated
• Original Assignee: Prochain Solutions Incorporated
• Inventors: Newbold, Robert C.
• Primary Examiner(s): Jeanty, Romain
• Application Number:
  US09/851,142
• Publication Number:
  US 20020169647A1
• Time in Patent Office: 1,917 Days
• Field of Search: 705/7, 705/8, 705/9
• US Class Current: 705/7.27
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/0633 Workflow analysis
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

A method for determining where in time to schedule a project in a computerized system for scheduling multiple projects operates in conjunction with a database composed of schedules for individual projects with resources assigned to some tasks. A user specifies the resources to be used for a new project, the loading caused by projects whose dates are already determined, the earliest possible start times for the new project, and the maximum amount of expansion in flow time (start to finish time) allowed for the new project, with considering inter-project resource contention. The new project is delayed only long enough to allow contention for the selected resources to be resolved, while not violating the flow time expansion restriction.

Claims

1. A computer-implemented method for scheduling a project, comprising the steps of:

i) determining resources required to perform the project and an amount of time to be allocated to each resource;

ii) calculating, in a computer, a first flow time value for completing the project when there are no inter-project constraints on the resources;

iii) defining a flow expansion coefficient value for the project;

iv) designating a proposed start time for the project;

v) calculating, in the computer, a second flow time value for completing the project from said proposed start time, in accordance with existing inter-project constraints on the resources;

vi) determining, in the computer, whether said second flow time is greater than the product of said first flow time and said coefficient value;

vii) determining a new proposed start time if said second flow time is greater than said product;

viii) iteratively repeating steps v–

vii until said second flow time is less than or equal to said product; and

ix) setting the start time for the project in accordance with the proposed start time designated during the final iteration of steps v–

vii.

2. The method of claim 1, wherein said new proposed start time is determined in the computer during step vii by adjusting the prior start time by an amount equal to the difference between said second flow time and said product.

3. The method of claim 2 further including the step of defining a minimum amount of time for incrementing the proposed start time, and adjusting the prior start time by the larger of said minimum and said difference.

4. The method of claim 2 wherein step vii includes the steps of setting the new proposed start time to a preliminary value equal to the start time at which the earliest task of said project would be scheduled in accordance with the prior start time and existing inter-project constraints on the resources, and then adjusting said preliminary value in accordance with said difference.

5. The method of claim 2 wherein said new proposed start time is determined by adding said difference to the prior proposed start time, so that the new proposed start time is later than the prior proposed start time.

6. The method of claim 2 wherein said new proposed start time is determined by subtracting said difference from the prior proposed start time, so that the new proposed start time is earlier than the prior proposed start time.

7. The method of claim 6, wherein a project start time is obtained by reversing the process flow and determining a latest project finish time.

8. The method of claim 1, wherein said project is a set of a manufacturing activities.

9. A system for determining the start time of a project in a multiple project environment, comprising:

means for storing an amount of time to be allocated to each resource required to perform the project;

means for receiving a user-defined flow expansion coefficient value;

means for calculating whether the product of said flow expansion coefficient value and a first flow time for completing the project in the absence of inter-project constraints on the resources is greater than a second flow time for completing the project when existing inter-project constraints on the resources are considered, for a given start time; and

means for designating a different start time if said product is not greater than or equal to said second flow time.

10. The system of claim 9 wherein said designating means iteratively designates different start times on an incremental basis until said product is greater than or equal to said second flow time.

11. The system of claim 10 wherein said incremental basis is equal to the difference between said second flow time and said product.

12. The system of claim 11 wherein said incremental basis is equal to the greater of said difference and a predetermined minimum value.

13. The system of claim 10 wherein said different start times are successively later in time.

14. The system of claim 10 wherein said different start times are successively earlier in time.

15. A computer-readable medium containing a program for determining the start time of a project in a multiple project environment, that causes a computer to execute the following steps:

calculating whether the product of a user-defined flow expansion coefficient value and a first flow time for completing the project in the absence of inter-project constraints on resources required to perform the project is greater than a second flow time for completing the project when existing inter-project constraints on the resources are considered, for a given start time; and

calculating a different start time if said product is not greater than or equal to said second flow time.

16. The computer-readable medium of claim 15 wherein said program iteratively calculates different start times on an incremental basis until said product is greater than or equal to said second flow time.

17. The computer-readable medium of claim 16 wherein said incremental basis is equal to the difference between said second flow time and said product.

18. The computer-readable medium of claim 17 wherein said incremental basis is equal to the greater of said difference and a predetermined minimum value.

19. The computer-readable medium of claim 16 wherein said different start times are successively later in time.

20. The computer-readable medium of claim 16 wherein said different start times are successively earlier in time.