Managing project schedule data using separate current and historical task schedule data and revision numbers

• US 7,941,445 B2
• Filed: 05/16/2008
• Issued: 05/10/2011
• Est. Priority Date: 05/16/2008
• Status: Active Grant

• Current Assignee: Ricoh Company Limited
• Original Assignee: Ricoh Company Limited
• Inventors: Motoyama, Tetsuro, Fong, Avery
• Primary Examiner(s): Thai; Hanh B
• Application Number:
  US12/122,442
• Publication Number:
  US 20090287718A1
• Time in Patent Office: 1,089 Days
• Field of Search: 707/790, 707/792, 707/802, 705 7- 9, 705/11, 705/35, 715/751, 715/963
• US Class Current: 707/790
• 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/109 Time management, e.g. calendars, reminders, meetings or time accounting
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes
• CPC Class Codes: Y10S 715/963 Calendar or scheduling

Abstract

A project management system manages project schedule data using separate current and historical task schedule data structures. In general, current schedule data is stored separately from historical schedule data, so that the current schedule data may be retrieved separately from the historical task schedule data. The project management system may also maintain unscheduled tasks as “to-do lists.” Tasks may be added to a member'"'"'s schedule without specifying any planned dates and the tasks are added to the database. The tasks have an associated revision number of 0 to indicate that the tasks were added, but not yet scheduled. The tasks are displayed in the member schedule editor and in Web page schedules. The tasks may then be displayed in the member schedule editor and in Web page schedules in a manner that allows a user to readily determine that the tasks are “to-do list” tasks.

Claims

1. A computer-implemented method for managing project schedule data, the computer-implemented method comprising:

generating schedule data for a task in the project;

determining whether the schedule data is the first schedule data for the task in the project;

if the schedule data is the first schedule data for the task in the project, then

storing the schedule data in a current task schedule data structure, and

generating and storing in association with the schedule data, version data that indicates that the schedule data is a first version of schedule data for the task in the project;

if the schedule data is not the first schedule data for the task in the project, then

determining whether the schedule data should be considered to be a new version of schedule data for the task in the project,

if the schedule data should be considered to be a new version of schedule data for the task in the project, then

moving existing schedule data from the current task schedule data structure to a historical task schedule data structure that is separate from the current task schedule data structure, and

storing the schedule data in the current task schedule data structure; and

wherein one or more of the steps are performed by one or more processors.

2. The computer-implemented method as recited in claim 1, further comprising if the schedule data should be considered to be a new version of schedule data for the task in the project, then generating and storing in association with the schedule data, version data that indicates that the schedule data is the most recent version of schedule data for the task in the project.

3. The computer-implemented method as recited in claim 1, wherein determining whether the schedule data should be considered to be a new version of schedule data for the task in the project includes comparing a first date on which the existing schedule data was created to a second data on which the schedule data was created.

4. The computer-implemented method as recited in claim 3, wherein the schedule data is considered to be a new version of schedule data for the task in the project if the second date is after the first date.

5. The computer-implemented method as recited in claim 1, further comprising if the schedule data should not be considered to be a new version of schedule data for the task in the project, then overwriting the existing schedule data in the current task schedule data structure with the schedule data.

6. The computer-implemented method as recited in claim 5, further comprising associating with the schedule data version data that was previously associated with the existing schedule data and indicated that the existing schedule data was the most recent version of schedule data for the task in the project.

7. The computer-implemented method as recited in claim 1, wherein determining whether the schedule data is the first schedule data for the task in the project includes examining version data associated with the schedule data to determine whether the schedule data is the first schedule data for the task in the project.

8. The computer-implemented method as recited in claim 1, wherein the current task schedule data structure is a current schedule data table and the historical task schedule data structure is a historical schedule data table.

9. A non-transitory computer-readable medium for managing project schedule data, the computer-readable medium carrying instructions which, when processed by one or more processors, cause:

generating schedule data for a task in the project;

determining whether the schedule data is the first schedule data for the task in the project;

if the schedule data is the first schedule data for the task in the project, then

storing the schedule data in a current task schedule data structure, and

generating and storing in association with the schedule data, version data that indicates that the schedule data is a first version of schedule data for the task in the project; and

if the schedule data is not the first schedule data for the task in the project, then

determining whether the schedule data should be considered to be a new version of schedule data for the task in the project,

if the schedule data should be considered to be a new version of schedule data for the task in the project, then

moving existing schedule data from the current task schedule data structure to a historical task schedule data structure that is separate from the current task schedule data structure, and

storing the schedule data in the current task schedule data structure.

10. The non-transitory computer-readable medium as recited in claim 9, further comprising additional instructions which, when processed by the one or more processors, cause if the schedule data should be considered to be a new version of schedule data for the task in the project, then generating and storing in association with the schedule data, version data that indicates that the schedule data is the most recent version of schedule data for the task in the project.

11. The non-transitory computer-readable medium as recited in claim 9, wherein determining whether the schedule data should be considered to be a new version of schedule data for the task in the project includes comparing a first date on which the existing schedule data was created to a second data on which the schedule data was created.

12. The non-transitory computer-readable medium as recited in claim 11, wherein the schedule data is considered to be a new version of schedule data for the task in the project if the second date is after the first date.

13. The non-transitory computer-readable medium as recited in claim 9, further comprising additional instructions which, when processed by the one or more processors, cause if the schedule data should not be considered to be a new version of schedule data for the task in the project, then overwriting the existing schedule data in the current task schedule data structure with the schedule data.

14. The non-transitory computer-readable medium as recited in claim 13, further comprising additional instructions which, when processed by the one or more processors, cause associating with the schedule data version data that was previously associated with the existing schedule data and indicated that the existing schedule data was the most recent version of schedule data for the task in the project.

15. The non-transitory computer-readable medium as recited in claim 9, wherein determining whether the schedule data is the first schedule data for the task in the project includes examining version data associated with the schedule data to determine whether the schedule data is the first schedule data for the task in the project.

16. The non-transitory computer-readable medium as recited in claim 9, wherein the current task schedule data structure is a current schedule data table and the historical task schedule data structure is a historical schedule data table.

17. An apparatus for managing project schedule data, the apparatus comprising:

one or more processors; and

a memory storing instructions which, when processed by the one or more processors, cause;

generating schedule data for a task in the project;

determining whether the schedule data is the first schedule data for the task in the project;

if the schedule data is the first schedule data for the task in the project, then

storing the schedule data in a current task schedule data structure, and

generating and storing in association with the schedule data, version data that indicates that the schedule data is a first version of schedule data for the task in the project; and

if the schedule data is not the first schedule data for the task in the project, then

determining whether the schedule data should be considered to be a new version of schedule data for the task in the project,

if the schedule data should be considered to be a new version of schedule data for the task in the project, then

moving existing schedule data from the current task schedule data structure to a historical task schedule data structure that is separate from the current task schedule data structure, and

storing the schedule data in the current task schedule data structure.

18. The apparatus as recited in claim 17, wherein the memory further stores additional instructions which, when processed by the one or more processors, cause if the schedule data should be considered to be a new version of schedule data for the task in the project, then generating and storing in association with the schedule data, version data that indicates that the schedule data is the most recent version of schedule data for the task in the project.

19. The apparatus as recited in claim 17, wherein determining whether the schedule data should be considered to be a new version of schedule data for the task in the project includes comparing a first date on which the existing schedule data was created to a second data on which the schedule data was created.

20. The apparatus as recited in claim 19, wherein the schedule data is considered to be a new version of schedule data for the task in the project if the second date is after the first date.

21. The apparatus as recited in claim 17, wherein the memory further stores additional instructions which, when processed by the one or more processors, cause if the schedule data should not be considered to be a new version of schedule data for the task in the project, then overwriting the existing schedule data in the current task schedule data structure with the schedule data.

22. The apparatus as recited in claim 21, wherein the memory further stores additional instructions which, when processed by the one or more processors, cause associating with the schedule data version data that was previously associated with the existing schedule data and indicated that the existing schedule data was the most recent version of schedule data for the task in the project.

23. The apparatus as recited in claim 17, wherein determining whether the schedule data is the first schedule data for the task in the project includes examining version data associated with the schedule data to determine whether the schedule data is the first schedule data for the task in the project.

24. The apparatus as recited in claim 17, wherein the current task schedule data structure is a current schedule data table and the historical task schedule data structure is a historical schedule data table.