Interactive graphics-based planning systems

• US 8,249,906 B2
• Filed: 02/11/2008
• Issued: 08/21/2012
• Est. Priority Date: 02/12/2007
• Status: Active Grant

• Current Assignee: PMA Technoloiges, LLC
• Original Assignee: PMA Technoloiges, LLC
• Inventors: Ponce de Leon, Gui
• Primary Examiner(s): Reagan, James A
• Application Number:
  US12/029,372
• Publication Number:
  US 20080195452A1
• Time in Patent Office: 1,653 Days
• Field of Search: 705/8
• US Class Current: 705/7.18
• 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
• CPC Class Codes: G06Q 10/06313 Resource planning in a project environment
• CPC Class Codes: G06Q 10/0635 Risk analysis of enterprise or organisation activities
• CPC Class Codes: G06Q 10/06375 Prediction of business process outcome or impact based on a proposed change
• CPC Class Codes: Y10S 715/963 Calendar or scheduling

Abstract

This invention relates to providing a system for project planning and scheduling which supports simplified, interactive, graphics-based project planning and scheduling using new planning concepts, new scheduling concepts and new graphics-based software systems. Further, this invention permits an inexperienced user to simultaneously plan and schedule a project including establishing appropriate relationship (or dependency) links between activities, also commonly referred to as tasks, and between activities and milestones. This invention offers the simplest possible scheme of thought that can tie together activities, relationships and milestones, with or without deadlines, to yield a complete, correct network project schedule in the shortest possible time.

Claims

1. A planning method, relating to at least one project, comprising the steps of:

a) providing at least one computational device having at least one graphical user interface manipulable graphically by at least one human project planner;

b) identifying, by such least one human project planner, a plurality of activities relating to such at least one project, each activity of such plurality of activities having at least one initial estimated duration;

c) selecting, on such at least one computational device, by such at least one human project planner, at least one time-scaled calendar to display on such at least one graphical user interface;

d) positioning, by such at least one human project planner using such at least one computational device, of at least one symbol representing each of at least two such activities on such at least one time-scaled calendar on such at least one graphical user interface;

e) selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities;

f) calculating, by such at least one computational device, at least one relationship float value and at least one reverse float value relating to such at least one time-dependent relationship; and

displaying, continuously, by such at least one computational device, such at least one relationship float value and such at least one reverse float value on such at least one time-scaled calendar on such at least one graphical user interface.

2. The planning method according to claim 1 further comprising the steps of:

a) providing at least one relationship float value (H_i,j) calculation to calculate at least one relationship float value

i) wherein such at least one relationship float value (H_i,j) calculation comprises H_i,j=H_j−

H_i;

where “

H_j”

denotes the connection date to at least one successor activity “

J”

of a plurality of such successor activities and “

H_i”

denotes the connection date from at least one predecessor activity “

I”

of a plurality of such predecessor activities; and

b) displaying such at least one relationship float value, continuously, by such at least one computational device, on such at least one time-scaled calendar on such at least one graphical user interface.

3. The planning method according to claim 2, further comprising the steps of:

a) calculating, by such at least one computational device, at least one buffer float value relating to such at least one time-dependent relationship

i) wherein such calculation comprises BF_i=min [H_i,j], for all “

J”

, where “

J”

denotes each and every successor activity of a plurality of such successor activities to at least one “

I”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such successor activity; and

b) displaying, continuously, by such at least one computational device, such at least one buffer float value on such at least one time-scaled calendar on such at least one graphical user interface.

4. The planning method according to claim 3, further comprising the steps of:

a) calculating, by such at least one computational device, at least one activity float value relating to such at least one time-dependent relationship

i) wherein such calculation comprises AF_i=min [H_i,j+AF_j], for all “

J”

, where “

J”

denotes each and every successor activity of a plurality of such successor activities to at least one “

I”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such successor activity; and

b) displaying, continuously, by such at least one computational device, such at least one activity float value on such at least one time-scaled calendar on such at least one graphical user interface.

5. The planning method according to claim 4, further comprising the steps of:

a) calculating, by such at least one computational device, at least one cut float value relating to such at least one time-dependent relationship

i) wherein such calculation comprises CF_j=min [min[H_ij+AF_j], H_i,m], where “

H_i,m”

denotes the such at least one relationship float value between such at least one “

I”

activity and a connected, one milestone deadline; and

b) displaying, continuously, by such at least one computational device, such at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.

6. The planning method according to claim 5, further comprising the steps of:

a) calculating, by such at least one computational device, at least one reverse float value relating to such at least one time-dependent relationship

i) wherein such calculation comprises RF_j=min [RF_i+H_i,j], for all “

I”

, where “

I”

denotes each and every predecessor activity, of a plurality of such predecessor activities to at least one “

J”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such predecessor activity; and

b) displaying, continuously, by such at least one computational device, such at least one reverse float value on such at least one time-scaled calendar on such at least one graphical user interface.

7. The planning method according to claim 6, further comprising the steps of:

a) re-positioning, by such at least one human project planner using such at least one computational device, such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

b) re-calculating, by such at least one computational device, such at least one relationship float value relating to such at least one time-dependent relationship; and

c) displaying, continuously, by such at least one computational device, such recalculated at least one relationship float value on such at least one time-scaled calendar on such at least one graphical user interface.

8. The planning method according to claim 7, further comprising the step of revising, by such at least one human project planner using such at least one computational device, such at least one initial estimated duration for such at least one activity having such at least one time dependent relationship on such at least one graphical user interface.

9. The planning method according to claim 8, further comprising the steps of:

a) re-calculating, by such at least one computational device, at least one relationship float value relating to such at least one at least one (revised) time-dependent relationship; and

b) displaying, continuously, by such at least one computational device, such recalculated at least one relationship float value on such at least one time-scaled calendar on such at least one graphical user interface.

10. The planning method according to claim 8, further comprising the steps of:

a) re-calculating, by such at least one computational device, at least one buffer float value relating to such at least one at least one (revised) time-dependent relationship; and

b) displaying, continuously, by such at least one computational device, such recalculated at least one buffer float value on such at least one time-scaled calendar on such at least one graphical user interface.

11. The planning method according to claim 8, further comprising the step of:

a) associating at least one daily resource requirement, by such at least one human project planner using such at least one computational device, with such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

b) re-positioning, by such at least one human project planner using such at least one computational device, such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

c) re-calculating, by such at least one computational device, increment and daily resource requirements, for at least one distinct resource, relating to at least one such activity repositioning; and

d) displaying, continuously, by such at least one computational device, recalculated daily resource requirement values on such at least one time-scaled calendar on such at least one graphical user interface.

12. The planning method according to claim 11, further comprising the step of:

a) providing at least one daily resource requirement calculation to calculate at least one increment in daily resource requirements, for at least one distinct resource, relating to the positioning of at least one such activity

i) wherein such calculation comprises RES_n=RES_n+R_i, where “

n”

denotes every day between the planned dates for activity “

I” and

“

Ri”

denotes the resource daily rate for activity “

I;

”

b) calculating, by such at least one computational device, the at least one increment in daily resource requirements, for at least one distinct resource, relating to the positioning of at least one such activity and

c) displaying, continuously, by such at least one computational device, such at least one resource requirement value on such at least one time-scaled calendar on such at least one graphical user interface.

13. The planning method according to claim 11, wherein each activity of such plurality of activities further comprises any of the following:

a) estimated daily resource rates;

b) initial estimated time-cost data; and

c) initial duration probability distribution function.

14. The planning method according to claim 8, further comprising the steps of:

a) re-calculating, by such at least one computational device, at least one activity float value relating to such at least one at least one (revised) time-dependent relationship; and

b) displaying, continuously, by such at least one computational device, recalculated at least one activity float value on such at least one time-scaled calendar on such at least one graphical user interface.

15. The planning method according to claim 8, further comprising the steps of:

a) re-calculating, by such at least one computational device, at least one cut float value relating to such at least one at least one (revised) time-dependent relationship; and

;

b) displaying, continuously, by such at least one computational device, such recalculated at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.

16. The planning method according to claim 8, further comprising the steps of:

a) re-calculating, by such at least one computational device, at least one reverse float value relating to such at least one at least one (revised) time-dependent relationship; and

b) displaying, continuously, by such at least one computational device, such re-calculated at least one reverse float value on such at least one time-scaled calendar on such at least one graphical user interface.

17. The planning method according to claim 8, further comprising the step of:

a) associating time-cost data, by such at least one human project planner using such at least one computational device, with such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

b) re-positioning, by such at least one human project planner using such at least one computational device, such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

c) re-calculating, by such at least one computational device, such time-cost data, relating to at least one such activity repositioning, to provide at least one re-calculated time-cost profile; and

d) displaying, continuously, by such at least one computational device, such at least one re-calculated time-cost profile on such at least one time-scaled calendar on such at least one graphical user interface.

18. The planning method according to claim 8, further comprising the step of:

a) associating duration probability distribution functions, by such at least one human project planner using such at least one computational device, with such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

b) re-positioning, by such at least one human project planner using such at least one computational device, such at least one symbol representing each such activity of such at least two activities of such plurality of activities on such at least one time-scaled calendar on such at least one graphical user interface;

c) re-calculating, by such at least one computational device, such duration probability distribution functions, relating to at least one such activity repositioning, to provide at least one project risk profile; and

d) displaying, continuously, by such at least one computational device, such at least one project risk profile on such at least one time-scaled calendar on such at least one graphical user interface.

19. The planning method according to claim 1, wherein such step of selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities comprises the step of selecting, on such at least one computational device, such at least one time-dependent relationship between any first activity embedded node, intermediate of the start and finish nodes of such at least one first activity, and any of the following:

a) at least one activity start node of at least one second activity;

b) at least one activity finish node of such at least one second activity;

c) at least one milestone deadline; and

d) at least one second activity embedded node, intermediate of the start and finish nodes of such at least one second activity.

20. The planning method according to claim 19, wherein such at least one time-dependent relationship comprises “

from such at least one first activity start node to such at least one second activity embedded node”

relationship.

21. The planning method according to claim 19, wherein such at least one time-dependent relationship comprises “

from such at least one first activity embedded node to such at least one second activity start node”

relationship.

22. The planning method according to claim 19, wherein such at least one time-dependent relationship comprises “

from such at least one first activity finish node to such at least one second activity embedded node”

relationship.

23. The planning method according to claim 19, wherein such at least one time-dependent relationship comprises “

from such at least one first activity embedded node to such at least one second activity finish node”

relationship.

24. The planning method according to claim 19, wherein such at least one time-dependent relationship comprises “

from such at least one first activity embedded node to such at least one milestone deadline”

relationship.

25. The planning method according to claim 19, wherein such at least one time-dependent relationship comprises “

from such at least one first embedded node to such at least one second embedded node”

relationship.

26. A planning method, relating to at least one project, for use by at least one human project planner, comprising the steps of:

a) providing at least one computational device having at least one graphical user interface manipulable graphically by at least one human project planner;

b) identifying, by such least one human project planner, a plurality of activities relating to such at least one project, each activity of such plurality of activities having at least one initial estimated duration;

c) selecting on such at least one computational device, by such at least one human project planner, at least one time-scaled calendar to display on such at least one graphical user interface;

d) positioning, by such at least one human project planner using such at least one computational device, of at least one symbol representing each of at least two such activities on such at least one time-scaled calendar on such at least one graphical user interface;

e) selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities;

f) calculating, by such at least one computational device, at least one relationship float value relating to such at least one time-dependent relationship, wherein such calculation comprises H_i,j=H_j−

H_i;

where “

H_j”

denotes the connection date to at least one successor activity “

J”

of a plurality of such successor activities and “

H_i”

denotes the connection date from at least one predecessor activity “

I”

of a plurality of such predecessor activities; and

g) calculating, by such at least one computational device, at least one reverse float value relating to such at least one time-dependent relationship, wherein such calculation comprises RF_j=min [RF_i+H_i,j], for all “

I”

, wherein “

I”

denotes each and every predecessor activity of a plurality of such predecessor activities to at least one “

J”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such predecessor activity.

27. The planning method according to claim 26, further comprising the step of calculating, by such at least one computational device, at least one buffer float value relating to such at least one time-dependent relationship wherein such calculation comprises BF_i=min [H_i,j], for all “

J”

, where “

J”

denotes each and every successor activity of a plurality of such successor activities to at least one “

I”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such successor activity.

28. The planning method according to claim 27, further comprising the step of calculating, by such at least one computational device, at least one activity float value relating to such at least one time-dependent relationship wherein such calculation comprises AF_i=min [H_i,j+AF_j], for all “

J”

, wherein “

J”

denotes each and every successor activity of a plurality of such successor activities to at least one “

I”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such successor activity.

29. The planning method according to claim 28, further comprising the step of calculating, by such at least one computational device, at least one cut float value relating to such at least one time-dependent relationship wherein such calculation comprises CF_i=min [min[H_i,j+AF_j], H_i,m], wherein “

H_i,m”

denotes the such at least one relationship float value between such at least one “

I”

activity and a connected, one milestone deadline.

30. A planning method, relating to at least one project, comprising the steps of:

a) identifying a plurality of activities relating to such at least one project, each activity of such plurality of activities having at least one initial estimated duration;

b) selecting at least one time-scaled calendar to display on such at least one graphical user interface;

c) positioning of at least one symbol representing each of at least two such activities on such at least one time-scaled calendar on such at least one graphical user interface;

d) selecting at least one time-dependent relationship between such at least two activities;

e) calculating, by such at least one computational device, at least one relationship float value relating to at least one time-dependent relationship, wherein the at least one relationship float value is calculated based on planned dates where such planned dates are selected by at least one human project planner.

31. The planning method according to claim 30 further comprising the steps of:

a. providing at least one relationship float value (H_i,j) calculation to calculate such at least one relationship float value, wherein such at least one relationship float value (H_i,j) calculation comprises H_i,j=H_j−

H_i;

where “

H_j”

denotes the connection date to at least one successor activity “

J”

of a plurality of such successor activities and “

H_i”

denotes the connection date from at least one predecessor activity “

I”

of a plurality of such predecessor activities.

32. The planning method according to claim 30, further comprising the steps of:

a. calculating, by such at least one computational device, at least one buffer float value relating to such at least one time-dependent relationship, wherein such calculation comprises BF_i=min [H_i,j], for all “

J”

, where “

J”

denotes each and every successor activity of a plurality of such successor activities to at least one “

I”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such successor activity.

33. The planning method according to claim 30, further comprising the steps of:

a. calculating, by such at least one computational device, at least one activity float value relating to such at least one time-dependent relationship, wherein such calculation comprises AF_i=min [H_i,j+AF_j], for all “

J”

, where “

J”

denotes each and every successor activity of a plurality of such successor activities to at least one “

I”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such successor activity.

34. The planning method according to claim 30, further comprising the steps of:

a. calculating, by such at least one computational device, at least one cut float value relating to such at least one time-dependent relationship, wherein such calculation comprises CF_j=min [min[H_i,j+AF_j], H_i,m], where “

H_i,m”

denotes the such at least one relationship float value between such at least one “

I”

activity and a connected, one milestone deadline.

35. The planning method according to claim 30, further comprising the steps of:

a. calculating, by such at least one computational device at least one reverse float value relating to such at least one time-dependent relationship, wherein such calculation comprises RF_j=min [RF_i+H_i,j], for all “

I”

, where “

I”

denotes each and every predecessor activity of a plurality of such predecessor activities to at least one “

J”

activity and “

H_i,j”

denotes such at least one relationship float value relating to each and every such predecessor activity.