Task manager

• US 6,445,968 B1
• Filed: 07/12/1999
• Issued: 09/03/2002
• Est. Priority Date: 07/12/1999
• Status: Expired due to Fees

• Current Assignee: Maharaj K. Jalla
• Original Assignee: Maharaj K. Jalla
• Inventors: Jalla, Maharaj K.
• Primary Examiner(s): COURTENAY III, ST JOHN
• Application Number:
  US09/351,155
• Time in Patent Office: 1,149 Days
• Field of Search: 709/100, 709/103, 709/318, 705/7-9, 700/99-104
• US Class Current: 700/101
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

The present invention relates to a process of planning, scheduling and control of the tasks of all members of an organization by an overall manager of the organization through a computer program. In this program, the overall manager feeds in the tasks all of members with each task having parameters that include member'"'"'s name, start date, estimated time, priority number and weightage number. At the start of any working day, the program processes the tasks of each member in the order of decreasing priority and produces a complete schedule of all uncompleted tasks of the member starting from the same working day. The process also allows new tasks to be added or the parameters of any incomplete previous task of any member to be altered at the start of any subsequent working day before obtaining a complete schedule starting from this subsequent working day.

Claims

1. A process of scheduling a plurality of tasks of any member of an organization through a computer program, comprising the steps of:

inserting start date, estimated time, priority number and weightage number of each of said tasks of the member,

said each start date not earlier than the system date of the computer at the time of insertion,

said each estimated time not being less than a minute,

said each priority number being an integer number equal to or greater than one, with the priority value of said priority number decreasing as said priority number increases,

said each weightage number being an integer number

between one and hundred;

storing all said tasks in a separate storage area, with the tasks of same said priority value being grouped together; and

allotting time to all said tasks from the beginning of any initial working day by assigning said initial working day as current working day, and by also assigning the greatest priority value of all said tasks as current priority value, and then by following steps that comprise;

(a) summing up the weightage numbers of the tasks with the current priority value,

(b) dividing the weightage number of each of the tasks with the current priority value task with the sum of the weightage numbers of the tasks with the current priority value, and then multiplying with the total working hours of the current working day so as to obtain the time allotted to corresponding said each task in the current working day,

(c) assigning the following working day as the current working day and repeating steps (a) and (b) till all the tasks of the current priority value have been scheduled,

(d) assigning the next lower priority value of all said tasks as the current priority value, and dividing any unused working hours of the current working day to the tasks of the current priority value by following the procedure of steps (a) and (b),

(e) assigning the next working day as the current working day, and repeating steps (a) to (e) as many times as required until all said tasks are scheduled in working days that follow said initial working day, thereby producing a complete schedule of all said tasks of said member starting from said initial working day.

2. A process of scheduling a plurality of tasks of any member of an organization through a computer program as in claim 1, wherein additional tasks of the member can be inserted or the parameters of any incomplete, previously-inserted task can be altered at the start of any initial working day before allotting time for producing a complete schedule of all said tasks from said initial working day.