Handling unscheduled tasks in a scheduling process

• US 7,210,119 B2
• Filed: 03/01/2001
• Issued: 04/24/2007
• Est. Priority Date: 03/31/2000
• Status: Expired due to Term

• Current Assignee: Trimble MRM Ltd. (Trimble Inc.)
• Original Assignee: @Road Incorporated (Trimble Inc.)
• Inventors: Laithwaite, Robert N W, Pothos, Dionisios, Alletson, Ian S
• Primary Examiner(s): Vo; Ted T.
• Assistant Examiner(s): CHOW, CHIH CHING
• Application Number:
  US10/239,087
• Publication Number:
  US 20030041087A1
• Time in Patent Office: 2,245 Days
• Field of Search: 717101-106, 705 7- 9, 718/100, 709/229, 708/102
• US Class Current: 717/102
• 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/1097 Task assignment

Abstract

Tasks (T) such as repair jobs on a telecommunications system, that are to be performed by a plurality of resources such as field engineers (E), at different locations in a geographical area (2), are scheduled by means of a scheduler (10) at a work manager server (5). The scheduler provides schedule data (11) corresponding to schedules of the tasks that individual ones of the resources are to carry out, from task data (4) concerning the tasks to be carried out and resource data (6) concerning characteristics of resources available to carry out the tasks over a given period. Not all the tasks are scheduled, resulting in unscheduled task data (11a). The schedule data (11) is downloaded to a workstation (7) together with the unscheduled task data. The downloaded data is analysed at the workstation to determine a candidate resource (E) to perform the task (T) corresponding to the unscheduled task data.

Claims

1. A computer-implemented apparatus for scheduling tasks to be performed using a plurality of resources, comprising:

a first processing system arranged to generate schedule data comprising a plurality of schedules, each of the schedules comprising data indicative of tasks that individual ones of the resources are to carry out, prepared from task data concerning the tasks to be carried out and resource data concerning characteristics of resources available to carry out the tasks over a given period, said characteristics including location of the resource, wherein the first processing system is arranged to provide unscheduled task data concerning a task not included in the schedules, and to transmit the schedule data and the unscheduled task data to a second, different, processing system;

said second processing system being arranged to review the schedule data so as to identify at least one candidate resource to perform the unscheduled task corresponding to the unscheduled task data,

wherein the second processing system is responsive to selection of said unscheduled task so as to identify two or more said candidate resources to perform the unscheduled task and to assign a ranking to each said candidate resources on the basis of the location the task and the location of the candidate resource, the second processing system being arranged to display data indicative of the identified two or more candidate resources.

2. The computer implemented apparatus according to claim 1 wherein the second processing system is arranged to compute the distance of the resources from the unscheduled task and to rank the candidate resources according to distance therefrom.

3. The computer implemented apparatus according to claim 1, wherein the second processing system is arranged to compute the time travel to the unscheduled task for the resources individually and to rank the candidate resources according to the computed travel time.

4. The computer implemented apparatus according to claim 1, wherein the second processing system is arranged to make an initial search for a group of resources to be considered as candidate resources on the basis of specified criteria.

5. The computer implemented apparatus according to claim 4, wherein the criteria include a resource skill level and the second processing system is arranged to identify those candidate resources having the specified skill level.

6. The computer implemented apparatus according to claim 4, wherein the second processing system is arranged to identify candidate resources to perform a plurality of unscheduled tasks, wherein said plurality of unscheduled tasks are to be performed at different locations in a geographical area by the resources, and the criteria include a preferred working area for each resource within the geographical area.

12. A storage medium carrying computer readable code representing instructions for causing one or more computers to operate as the computer implemented apparatus according to claim 1.

7. A computer-implemented method of scheduling tasks to be performed using a plurality of resources, the method comprising a first scheduling process and a second scheduling process:

the first scheduling process comprising;

generating schedule data comprising a plurality of schedules, each of the schedules comprising data indicative of tasks that individual ones of the resources are to carry out, prepared from task data concerning the tasks to be carried out and resource data concerning characteristics of resources available to carry out the tasks over a given period, said characteristics including location of the resources; and

identifying unscheduled task data concerning a task not included in the schedules;

the second scheduling process comprising;

receiving the schedule data and the identified unscheduled task data;

selecting an unscheduled task from the unscheduled task data;

reviewing the schedule data so as to identify a plurality of candidate resources to perform the unscheduled task;

ranking the identified resources on the basis of the location of the task and the location of the candidate resource; and

displaying data indicative of the identified two or more candidate resources.

8. A computer implemented method according to claim 7, including computing the distance of the candidate resources from the unscheduled task and ranking them according to distance therefrom.

9. A computer implemented method according to claim 7, including computing the time to travel to the unscheduled task for the candidate resources individually and ranking the candidate resources according to the computed travel time.

10. A computer implemented method according to claim 7, including making an initial search for a group of resources to be considered as candidate resources on the basis of specified criteria.

11. A computer implemented method according to claim 10, wherein the criteria include a candidate resource skill level and the search identifies those resources having the specified skill level.

13. A storage medium carrying computer readable code representing instructions for causing one or more computers to perform the computer implemented method according to claim 7 when the instructions are executed by the computer or computers.