PROJECT MAPPER

• US 20130159198A1
• Filed: 12/19/2011
• Published: 06/20/2013
• Est. Priority Date: 12/19/2011
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Cartan, John, Lin, Owen
• Application Number:
  US13/329,655
• Publication Number:
  US 20130159198A1
• Time in Patent Office: Days
• US Class Current: 705/301
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

Embodiments of the invention provide systems and methods for providing a graphical, interactive representation of activities within a project. According to one embodiment, a method for providing a graphical, interactive map representing a project can comprise reading a description of the project. The description can define a plurality of activities in the project and one or more milestones for the project. The plurality of activities and one or more milestones can comprise elements of the map. One or more ordered lists of elements can be generated based on the description. The one or more ordered lists can be arranged in one or more levels. The map can be drawn based on the levels of ordered lists.

Claims

1. A method for providing a graphical, interactive map representing a project, the method comprising:

reading a description of the project, the description defining a plurality of activities in the project and one or more milestones for the project, wherein the plurality of activities and one or more milestones comprise elements of the map;

generating one or more ordered lists of elements based on the description, the one or more ordered lists arranged in one or more levels; and

drawing the map based on the levels of ordered lists.

2. The method of claim 1, wherein generating one or more ordered lists of elements comprises:

determining for each element of the map and based on the description, a predecessor element, a start time, and an end time;

determining a flexible width for each of a plurality of time periods, the plurality of time periods together including the start times and end times of the elements of the map;

determining a position on the map and a width of a graphical representation of each element of the map;

identifying a terminus for each element of the map;

creating one or more ordered lists of successor elements based on the identified terminus of each element;

determining a level within the map for each of the one or more ordered lists;

identifying a float limit for each level.

3. The method of claim 2, further comprising collapsing a first level within the map and a second level within the map if the first level and the second level do not overlap.

4. The method of claim 2, wherein determining for each element of the map a predecessor element, a start time, and an end time comprises:

creating a table mapping an element identifier to a sequence number for each element of the map;

determining whether at least one starting element is represented in the table; and

in response to determining at least one starting element is represented in the table, setting predecessor, start time and end time for each starting element and any elements other than starting elements.

5. The method of claim 2, wherein determining the flexible width for each of the plurality of time periods comprises:

determining a width of each of a plurality of periods, each period including one or more elements, wherein determining the width of each of the plurality of periods is based on a duration of the activities in the period;

expanding the period width for any period including at least one milestone; and

determining a position in the map for each of the plurality of periods based on a sum of period widths for periods prior to each period.

6. The method of claim 2, wherein determining the position on the map and the width of the graphical representation of each element comprises:

setting margins between sequential elements to a predetermined amount;

setting position values for each activity based on start time, end time, and margin for each activity;

setting position values for each milestone based on start time and a predetermined milestone width; and

adjusting positions of predecessor elements of milestones based on the positions of the milestones and the predecessors.

7. The method of claim 2, wherein identifying the terminus for each element comprises:

identifying an element with a latest end time;

assigning the element with the latest end time as a terminus of itself;

assigning a terminus of preceding elements in the same sequence based on the sequence; and

repeating identifying an element with a latest end time, assigning the element with the latest end time as a terminus of itself, and assigning a terminus of preceding elements in the same sequence based on the sequence until all of the elements are assigned a terminus.

8. The method of claim 2, wherein creating the one or more ordered lists of successor elements comprises:

determining whether an element is an initial element in a sequence;

in response to determining the element is the initial element in the sequence, leaving the successor list empty;

in response to determining the element is not the initial element in the sequence, adding the element to the ordered list for the sequence based on the terminus of the element and the termini of other elements in the ordered list; and

repeating determining whether an element is an initial element in a sequence and leaving the successor list empty or adding the element to the ordered list for the sequence until all elements are added to an ordered list.

9. The method of claim 2, wherein determining the level within the map for each of the one or more ordered lists comprises:

identifying an element with a latest end time;

setting the identified element as a terminus of a longest remaining sequence;

adding immediate predecessors to the longest remaining sequence until an initial element is found; and

repeating identifying an element with a latest end time, setting the identified element as a terminus of a longest remaining sequence, and adding immediate predecessors to the longest remaining sequence until an initial element is found until all elements are assigned.

10. The method of claim 2, wherein identifying the float limit for each level comprises:

setting a float limit for a terminus of each ordered list based on an earliest start time for a predecessor element in the ordered list;

identifying a number of levels assigned based on a number of ordered lists;

determining whether the number of levels exceeds a predetermined threshold; and

in response to determining the number of levels exceeds the predetermined threshold, setting edge positions for each level, collapsing a first level within the map and a second level within the map if the map if the float limit for the first level is less than a start time of an initial element of the second level and a predetermined margin, and adjusting a space between levels.

11. The method of claim 2, wherein drawing the map comprises:

drawing a time scale based on the plurality of time periods;

drawing the elements based on the ordered lists;

drawing the determined float limits based on the time scale; and

drawing successor lines between the elements based on the ordered lists.

12. A computer-readable memory having stored thereon a sequence of instructions which, when executed by a processor, causes the processor to provide a graphical, interactive map representing a project by:

reading a description of the project, the description defining a plurality of activities in the project and one or more milestones for the project, wherein the plurality of activities and one or more milestones comprise elements of the map;

determining for each element of the map and based on the description, a predecessor element, a start time, and an end time;

determining a flexible width for each of a plurality of time periods, the plurality of time periods together including the start times and end times of the elements of the map;

determining a position on the map and a width of a graphical representation of each element of the map;

identifying a terminus for each element of the map;

creating one or more ordered lists of successor elements based on the identified terminus of each element;

determining a level within the map for each of the one or more ordered lists;

identifying a float limit for each level;

collapsing a first level within the map and a second level within the map if the first level and the second level do not overlap; and

drawing the map based on the levels of ordered lists.

13. The computer-readable memory of claim 12, wherein determining for each element of the map a predecessor element, a start time, and an end time comprises:

creating a table mapping an element identifier to a sequence number for each element of the map;

determining whether at least one starting element is represented in the table; and

in response to determining at least one starting element is represented in the table, setting predecessor, start time and end time for each starting element and any elements other than starting elements.

14. The computer-readable memory of claim 12, wherein determining the flexible width for each of the plurality of time periods comprises:

determining a width of each of a plurality of periods, each period including one or more elements, wherein determining the width of each of the plurality of periods is based on a duration of the activities in the period;

expanding the period width for any period including at least one milestone; and

determining a position in the map for each of the plurality of periods based on a sum of period widths for periods prior to each period.

15. The computer-readable memory of claim 12, wherein determining the position on the map and the width of the graphical representation of each element comprises:

setting margins between sequential elements to a predetermined amount;

setting position values for each activity based on start time, end time, and margin for each activity;

setting position values for each milestone based on start time and a predetermined milestone width; and

adjusting positions of predecessor elements of milestones based on the positions of the milestones and the predecessors.

16. The computer-readable memory of claim 12, wherein identifying the terminus for each element comprises:

identifying an element with a latest end time;

assigning the element with the latest end time as a terminus of itself;

assigning a terminus of preceding elements in the same sequence based on the sequence; and

repeating identifying an element with a latest end time, assigning the element with the latest end time as a terminus of itself, and assigning a terminus of preceding elements in the same sequence based on the sequence until all of the elements are assigned a terminus.

17. The computer-readable memory of claim 12, wherein creating the one or more ordered lists of successor elements comprises:

determining whether an element is an initial element in a sequence;

in response to determining the element is the initial element in the sequence, leaving the successor list empty;

in response to determining the element is not the initial element in the sequence, adding the element to the ordered list for the sequence based on the terminus of the element and the termini of other elements in the ordered list; and

repeating determining whether an element is an initial element in a sequence and leaving the successor list empty or adding the element to the ordered list for the sequence until all elements are added to an ordered list.

18. The computer-readable memory of claim 12, wherein determining the level within the map for each of the one or more ordered lists comprises:

identifying an element with a latest end time;

setting the identified element as a terminus of a longest remaining sequence;

adding immediate predecessors to the longest remaining sequence until an initial element is found; and

repeating identifying an element with a latest end time, setting the identified element as a terminus of a longest remaining sequence, and adding immediate predecessors to the longest remaining sequence until an initial element is found until all elements are assigned.

19. The computer-readable memory of claim 12, wherein identifying the float limit for each level comprises:

setting a float limit for a terminus of each ordered list based on an earliest start time for a predecessor element in the ordered list;

identifying a number of levels assigned based on a number of ordered lists;

determining whether the number of levels exceeds a predetermined threshold; and

in response to determining the number of levels exceeds the predetermined threshold, setting edge positions for each level, collapsing a first level within the map and a second level within the map if the map if the float limit for the first level is less than a start time of an initial element of the second level and a predetermined margin, and adjusting a space between levels.

20. A system comprising:

a processor; and

a memory communicatively coupled with and readable by the processor and having stored therein a sequence of instructions which, when executed by the processor, cause the processor to provide a graphical, interactive map representing a project by reading a description of the project, the description defining a plurality of activities in the project and one or more milestones for the project, wherein the plurality of activities and one or more milestones comprise elements of the map, generating one or more ordered lists of elements based on the description, the one or more ordered lists arranged in one or more levels, and drawing the map based on the levels of ordered lists.