# US 8,751,280 B2 · Interactive graphics-based planning systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,751,280 B2
- Document ID: US8751280B2
- Status: Granted
- Kind: B2
- Application number: 13/546,609
- Filed: 2012-07-11
- Published: 2013-05-16
- Granted: 2014-06-10
- Earliest claimed: 2007-02-12
- Assignees: PMA Technologies, LLC
- Applicants: Gui Ponce de Leon
- Inventors: Gui Ponce de Leon
- Web page: https://patentgrep.com/patent/US8751280B2

## CPC

- G06Q 10/06313: {Resource planning in a project environment}
- G06Q 10/06: Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q 10/0631: Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q 10/0635: Risk analysis of enterprise or organisation activities
- G06Q 10/06375: {Prediction of business process outcome or impact based on a proposed change}
- Y10S 715/963: Calendar or scheduling
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## 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

### Claim 1

A computer program system relating to assisting at least one user relating to project planning and scheduling comprising the steps of:
a) permitting selecting at least one time-scaled calendar on at least one graphical user interface;
b) permitting identifying a plurality of activities relating to such at least one project having at least one initial estimated duration for each of such plurality of activities on such at least one graphical user interface;
c) permitting positioning at least one symbol representing each of 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;
d) permitting designating at least one time-dependent relationship between such at least two activities;
e) calculating at least one relationship float value relating to such at least one at least one time-dependent relationship;
f) displaying, continuously such calculated at least one relationship float value on such at least one time-scaled calendar on such at least one graphical user interface; and
g) storing at least one project plan, wherein such at least one project plan comprises at least
i. at least two of such activities relating to at least one project,
ii. such position of such at least one symbol representing such at least one activity on such selected at least on time-scaled calendar,
iii. such at least one initial estimated duration relating to such at least one activity,
iv. such at least one time-scaled calendar,
v. such at least one time-dependent relationship between such at least two activities, and
vi. such calculated at least one relationship float value.

### Claim 2 (depends on 1)

The computer program system according to claim 1, wherein such at least one relationship float value (Hij) calculation comprises Hij=Hj−Hb, where “Hj” denotes the connection date to at least one successor activity “J” of a plurality of such successor activities and “Hi” denotes the connection date from at least one predecessor activity “I” of a plurality of such predecessor activities.

### Claim 3 (depends on 2)

The computer program system according to claim 2, further comprising the steps of:
a) calculating at least one buffer float value relating to such at least one time-dependent relationship
b) wherein such calculation comprises BFi=min[Hij], 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 “Hij” denotes such at least one relationship float value relating to each and every such successor activity; and
c) displaying, continuously such at least one buffer float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 4 (depends on 2)

The computer program system according to claim 2, further comprising the steps of:
a) calculating at least one activity float value relating to such at least one time-dependent relationship
i. wherein such calculation comprises AFi=min[Hij+AFj], 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 “Hij” denotes such at least one relationship float value relating to each and every such successor activity; and
b) displaying, continuously such at least one activity float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 5 (depends on 4)

The computer program system according to claim 4, further comprising the steps of:
a) calculating at least one cut float value relating to such at least one time-dependent relationship
i. wherein such calculation comprises CFi=min [min[Hij+AFj], Hi,m], where “Hi,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 such at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 6 (depends on 5)

The computer program system according to claim 5, further comprising the steps of:
a) calculating at least one reverse float value relating to such at least one time-dependent relationship
i. wherein such calculation comprises RFj=min[RFi+Hij], 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 “Hij” 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.

### Claim 7 (depends on 6)

The computer program system according to claim 6, further comprising the steps of:
a) permitting re-positioning such at least one symbol representing each of 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 such at least one relationship float value relating to such at least one at least one time-dependent relationship; and
c) displaying, continuously, such re-calculated at least one relationship float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 8 (depends on 7)

The computer program system according to claim 7, further comprising the step of permitting revising such at least one initial estimated duration relating to such at least one activity having such at least one time-dependent relationship on such at least one graphical user interface.

### Claim 9 (depends on 8)

The computer program system according to claim 8, further comprising the steps of:
a) re-calculating at least one buffer float value relating to such at least one at least one time-dependent relationship; and
b) displaying, continuously, such re-calculated at least one buffer float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 10 (depends on 8)

The computer program system according to claim 8, further comprising the steps of:
a) re-calculating at least one activity float value relating to such at least one at least one time-dependent relationship; and
b) displaying, continuously, such re-calculated at least one activity float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 11 (depends on 8)

The computer program system according to claim 8, further comprising the steps of:
a) re-calculating at least one cut float value relating to such at least one at least one time-dependent relationship; and
b) displaying, continuously, such re-calculated at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 12 (depends on 8)

The computer program system according to claim 8, further comprising the steps of:
a) re-calculating at least one reverse float value relating to such at least one at least one time-dependent relationship; and
b) displaying, continuously, such re-calculated at least one reverse float value on such at least onetime-scaled calendar on such at least one graphical user interface.

### Claim 13 (depends on 1)

The computer program system according to claim 1, wherein such at least one time-dependent relationship includes such 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 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.

### Claim 14 (depends on 13)

The computer program system according to claim 13, wherein such at least one time-dependent relationship comprises at least one first activity start node to such at least one second activity embedded node relationship.

### Claim 15 (depends on 13)

The computer program system according to claim 13, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one second activity start node relationship.

### Claim 16 (depends on 13)

The computer program system according to claim 13, wherein such at least one time-dependent relationship comprises at least one first activity finish node to at least one second activity embedded node relationship.

### Claim 17 (depends on 13)

The computer program system according to claim 13, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one second activity finish node relationship.

### Claim 18 (depends on 13)

The computer program system according to claim 13, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one milestone deadline relationship.

### Claim 19 (depends on 13)

The computer program system according to claim 13, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one second activity embedded node relationship.

### Claim 20

A computer program system, relating to assisting at least one user relating to project planning and scheduling, comprising:
a) at least one first computer interface structured and arranged to permit selecting at least one time-scaled calendar on at least one graphical user interface;
b) at least one second computer interface structured and arranged to permit identifying a plurality of activities relating to such at least one project having at least one initial estimated duration
for each of such plurality of activities on such at least one graphical user interface;
c) at least one third computer interface structured and arranged to permit positioning of at least one symbol representing each of 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;
d) at least one fourth computer interface structured and arranged to permit designating at least one time dependent relationship between such at least two activities;
e) at least one first computer processor structured and arranged to calculate at least one relationship float value relating to such at least one time-dependent relationship;
f) at least one fifth computer interface structured and arranged to display, continuously, such calculated at least one relationship float value on such at least one time-scaled calendar on such at least one graphical user interface; and
g) at least one first computer data base structured and arranged to store at least one project plan wherein such at least one project plan comprises at least
i. at least two of such activities relating to at least one project,
ii. such position of such at least one symbol representing such at least one activity on such selected at least on time-scaled calendar,
iii. such at least one initial estimated duration relating to such at least one activity,
iv. such at least one time-scaled calendar,
v. such at least one time-dependent relationship between such at least two activities, and
vi. such calculated at least one relationship float value.

### Claim 21 (depends on 20)

The computer program system according to claim 20, wherein such at least one relationship float value (Hij) calculation comprises Hij=Hj·−Hi; where “Hij” denotes the connection date to at least one successor activity “J” of a plurality of such successor activities and “Hi” denotes the connection date from at least one predecessor activity “I” of a plurality of such predecessor activities.

### Claim 22 (depends on 20)

The computer program system according to claim 20, further comprising:
a) at least one second computer processor structured and arranged to calculate at least one buffer float value relating to such at least one time-dependent relationship
i. wherein such calculation comprises BFi=min[Hij], 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 “Hij” denotes such at least one relationship float value relating to each and every such successor activity; and
b) at least one sixth computer interface structured and arranged to display, continuously such at least one buffer float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 23 (depends on 21)

The computer program system according to claim 21, further comprising:
a) at least one second computer processor structured and arranged to calculate at least one activity float value relating to such at least one time-dependent relationship
i. wherein such calculation comprises AFi=min[Hij+AFj], 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 “Hij” denotes such at least one relationship float value relating to each and every such successor activity; and
b) at least one seventh computer interface structured and arranged to display, continuously such at least one activity float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 24 (depends on 23)

The computer program system according to claim 23, further comprising:
a) at least one fourth computer processor structured and arranged to calculate at least one cut float value relating to such at least one time-dependent relationship
1. wherein such calculation comprises CFi=min[min[Hij+AFj], Hi·m], where “Hi,m” denotes the such at least one relationship float value between such at least one “I” activity and a connected, later at least one milestone; and
b) at least one eighth computer interface structured and arranged to display, continuously such at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 25 (depends on 24)

The computer program system according to claim 24, further comprising:
a) at least one fifth computer processor structured and arranged to calculate at least one reverse float value relating to such at least one time-dependent relationship
i. wherein such calculation comprises RFj=min[RFi+Hij], 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 “Hij” denotes such at least one relationship float value relating to each and every such predecessor activity; and
b) at least one ninth computer interface structured and arranged to display, 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.

### Claim 26 (depends on 25)

The computer program system according to claim 25, further comprising:
a) at least one tenth computer interface structured and arranged to permit re-positioning such at least one symbol representing each of 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; and
b) at least one sixth computer processor structured and arranged to re-calculate such at least one relationship float value relating to such at least one at least one time-dependent relationship; and
c) at least one eleventh computer interface structured and arranged to display, continuously, such recalculated at least one relationship float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 27 (depends on 26)

The computer program system according to claim 26, further comprising at least one twelfth computer interface structured and arranged to permit revising such at least one initial estimated duration relating to such at least one activity having such at least one time-dependent relationship on such at least one graphical user interface.

### Claim 28 (depends on 27)

The computer program system according to claim 27, further comprising:
a) at least one seventh computer processor structured and arranged to re-calculate such at least one buffer float value relating to such at least one at least one time-dependent relationship; and
b) at least one thirteenth computer interface structured and arranged to display, continuously, such recalculated at least one buffer float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 29 (depends on 27)

The computer program system according to claim 27, further comprising:
a) at least one eighth computer processor structured and arranged to re-calculate such at least one activity float value relating to such at least one at least one time-dependent relationship; and
b) at least one fourteenth computer interface structured and arranged to display, continuously, such recalculated at least one activity float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 30 (depends on 27)

The computer program system according to claim 27, further comprising:
a) at least one ninth computer processor structured and arranged to re-calculate such at least one cut float value relating to such at least one at least one time-dependent relationship; and
b) at least one fifteenth computer interface structured and arranged to display, continuously, such recalculated at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 31 (depends on 27)

The computer program system according to claim 27, further comprising:
a) at least one tenth computer processor structured and arranged to re-calculate such at least one reverse float value relating to such at least one at least one time-dependent relationship; and
b) at least one sixteenth computer interface structured and arranged to display, continuously, such recalculated at least one reverse float value on such at least one time-scaled calendar on such at least one graphical user interface.

### Claim 32 (depends on 20)

The computer program system according to claim 20, wherein such at least one time-dependent relationship includes such 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 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 at least one second activity.

### Claim 33 (depends on 32)

The computer program system according to claim 32, wherein such at least one time-dependent relationship comprises at least one first activity start node to such at least one second activity embedded node relationship.

### Claim 34 (depends on 32)

The computer program system according to claim 32, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one second activity start node relationship.

### Claim 35 (depends on 32)

The computer program system according to claim 32, wherein such at least one time-dependent relationship comprises at least one first activity finish node to at least one second activity embedded node relationship.

### Claim 36 (depends on 32)

The computer program system according to claim 32, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one second activity finish node relationship

### Claim 37 (depends on 32)

The computer program system according to claim 32, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one milestone deadline relationship.

### Claim 38 (depends on 32)

The computer program system according to claim 32, wherein such at least one time-dependent relationship comprises at least one first activity embedded node to at least one second activity embedded node relationship.