Automated time budgeting

• US 20090089129A1
• Filed: 09/27/2007
• Published: 04/02/2009
• Est. Priority Date: 09/27/2007
• Status: Abandoned Application

• Current Assignee: Mac Gregory Newbold, Mark Terrance Polson
• Original Assignee: Mac Gregory Newbold, Mark Terrance Polson
• Inventors: Newbold, Mac Gregory, Polson, Mark Terrance
• Application Number:
  US11/904,535
• Publication Number:
  US 20090089129A1
• Time in Patent Office: Days
• US Class Current: 705/8
• 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/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/109 Time management, e.g. calendars, reminders, meetings or time accounting

Abstract

Dynamic schedules are created by using a budgeting process for allocating time. Time available is first allocated to the system. Once time resources are allocated, fixed tasks are subtracted out of the time resources, leaving only flexible time which the user will use for all other tasks. Variable tasks may be added by entering due date, task description, task dependencies, and priority. An algorithm is used to maximize the user'"'"'s schedule. The algorithm schedules rapidly, prevents late tasks, and readjusts to accommodate for unplanned events or new tasks.

Claims

1. A method for scheduling tasks or events whereby a plurality of tasks or events, each receiving an estimate of the time required to perform such task or the time of duration of such event, is organized into a schedule or calendar, suitable as a guide in performing said tasks and events.

2. The method of claim 1 wherein the schedule is organized by means of a computerized program or algorithm whereby said method can be automated.

3. The method of claim 1 wherein tasks can be reorganized in said calendar as tasks are added or deleted, while maintaining specific tasks or events in a fixed position in the schedule as needed.

4. The method of claim 1 wherein a network of computer systems, including but not limited to the internet, is utilized whereby said tasks or events may be submitted, or said schedule may be transmitted.

5. The method of claim 1 wherein a web site is used whereby said tasks or events may be submitted, or said schedule may be transmitted.

6. The method of claim 1 wherein said tasks or events receive a due date whereby the schedule can be made to reflect the completion of each task or event on or prior to its respective due date.

7. The method of claim 1 wherein said tasks or events receive one or more classifications whereby tasks or events having different classifications can be given preferential or other special or unique treatment relative to other tasks or events.

8. The method of claim 1 wherein said tasks or events may be designated as being required to occur on a specific date or at a specific time, whereby to allow said tasks or events to be respectively organized into the corresponding timeframe in said schedule or calendar.

9. The method of claim 1 wherein said tasks or events may be subdivided into a plurality of task portions, such that the sum of the time estimates for the task portions is equal to the time estimate for the entire task, whereby said task portions can be organized into said schedule or calendar in multiple dates or timeframes such that each task portion can be performed independently, and said entire task is considered performed when all its respective task portions have been performed.

10. The method of claim 1 wherein said tasks or events are organized into a schedule or calendar such that said tasks or events do not overlap or occur simultaneously when performed according to said schedule or calendar.