SYSTEM AND METHOD OF AUTOMATICALLY ALLOCATING TASKS

• US 20150112742A1
• Filed: 10/18/2013
• Published: 04/23/2015
• Est. Priority Date: 10/18/2013
• Status: Abandoned Application

• Current Assignee: Mitchell International Incorporated (Mitchell International Holding, Inc.)
• Original Assignee: Mitchell International Incorporated (Mitchell International Holding, Inc.)
• Inventors: Rivera, Marcos, Baierl, Scott, Durant, Bryan, Peters, Russell, Dattaray, Basab
• Application Number:
  US14/058,128
• Publication Number:
  US 20150112742A1
• Time in Patent Office: Days
• US Class Current: 705/7.14
• CPC Class Codes: G06Q 10/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/063114 Status monitoring or status determination for a person or group

Abstract

Systems and methods of allocating tasks to servicers are disclosed. The systems and methods select one of the servicers and one of the tasks based on selection criteria. The systems and methods then determine whether the selected task may be allocated to the selected servicer. If the selected task may be allocated to the selected servicer, the systems and methods allocate the task accordingly. If the selected task may not be allocated to the selected servicer, the systems and methods select another one of the servicers and another one of the tasks.

Claims

1. A computer implemented method of allocating a plurality of tasks to a plurality of servicers, the method comprising:

selecting a first servicer of the servicers;

selecting a first task of the tasks;

determining whether the selected first task is allocatable to the selected first servicer;

allocating the selected first task to the selected first servicer in response to the selected first task being allocatable to the selected first servicer; and

in response to the selected first task not being allocatable to the selected first servicer;

selecting a second servicer of the servicers,

selecting a second task of the tasks,

determining whether the selected second task is allocatable to the selected second servicer,

allocating the selected second task to the selected second servicer in response to the selected second task being allocatable to the selected second servicer, and

in response to the selected second task not being allocatable to the selected second servicer;

selecting a next servicer of the servicers.

2. The method of claim 1, wherein each servicer has a workload associated therewith, and selecting the first servicer comprises comparing the workloads of the servicers and selecting the servicer having the lightest workload.

3. The method of claim 1, wherein each task has a location associated therewith, and selecting the first task comprises comparing distances between the locations of a plurality of unallocated tasks and the location of the task most recently allocated to the first servicer, and selecting the unallocated task which is closest to the location of the task most recently allocated to the first server.

4. The method of claim 1, further comprising generating a list of eligible servicers for each task, wherein determining whether the selected first task is allocatable to the selected first servicer comprises determining whether the selected first servicer is included in the list of eligible service for the selected first task.

5. The method of claim 4, wherein determining whether the selected first task is allocatable to the selected first servicer further comprises determining whether the schedule of the appraiser accommodates the task.

6. The method of claim 5, wherein the schedule of the appraiser comprises an event having:

a duration,

an earliest start time, and

a latest end time.

7. The method of claim 1, further comprising:

determining a skill requirement attribute for the first task; and

determining a skill attribute for the first servicer,

wherein determining whether the selected first task is allocatable to the selected first servicer comprises determining whether the skill attribute of the first servicer corresponds with the skill requirement attribute of the first task.

8. A computer system, comprising:

a processor; and

a memory, comprising instructions, which when executed by the process cause the computer system to perform a method of allocating a plurality of tasks to a plurality of servicers, the method comprising;

selecting a first servicer of the servicers;

selecting a first task of the tasks;

determining whether the selected first task is allocatable to the selected first servicer; and

in response to the selected first task not being allocatable to the selected first servicer;

selecting a second servicer of the servicers,

selecting a second task of the tasks,

determining whether the selected second task is allocatable to the selected second servicer, and

allocating the selected second task to the selected second servicer in response to the selected second task being allocatable to the selected second servicer.

9. The computer system of claim 8, wherein each servicer has a workload associated therewith, and selecting the first servicer comprises comparing the workloads of the servicers and selecting the servicer having the lightest workload.

10. The computer system of claim 8, wherein each task has a location associated therewith, and selecting the first task comprises comparing distances between the locations of a plurality of unallocated tasks and the location of the task most recently allocated to the first servicer, and selecting the unallocated task which is closest to the location of the task most recently allocated to the first server.

11. The computer system of claim 8, the method further comprising generating a list of eligible servicers for each task, wherein determining whether the selected first task is allocatable to the selected first servicer comprises determining whether the selected first servicer is included in the list of eligible service for the selected first task.

12. The computer system of claim 11, wherein determining whether the selected first task is allocatable to the selected first servicer further comprises determining whether the schedule of the appraiser accommodates the task.

13. The computer system of claim 12, wherein the schedule of the appraiser comprises an event having:

a duration,

an earliest start time, and

a latest end time.

14. The computer system of claim 8, the method further comprising:

determining a skill requirement attribute for the first task; and

determining a skill attribute for the first servicer,

wherein determining whether the selected first task is allocatable to the selected first servicer comprises determining whether the skill attribute of the first servicer corresponds with the skill requirement attribute of the first task.

15. A computer readable medium comprising non-transient instructions, which, when executed by a computer, cause the computer to perform a method of allocating a plurality of tasks to a plurality of servicers, the method comprising:

selecting a first servicer of the servicers;

selecting a first task of the tasks;

determining whether the selected first task is allocatable to the selected first servicer; and

in response to the selected first task not being allocatable to the selected first servicer;

selecting a second servicer of the servicers,

selecting a second task of the tasks,

determining whether the selected second task is allocatable to the selected second servicer, and

allocating the selected second task to the selected second servicer in response to the selected second task being allocatable to the selected second servicer.

16. The computer readable medium of claim 15, wherein each servicer has a workload associated therewith, and selecting the first servicer comprises comparing the workloads of the servicers and selecting the servicer having the lightest workload.

17. The computer readable medium of claim 15, wherein each task has a location associated therewith, and selecting the first task comprises comparing distances between the locations of a plurality of unallocated tasks and the location of the task most recently allocated to the first servicer, and selecting the unallocated task which is closest to the location of the task most recently allocated to the first server.

18. The computer readable medium of claim 15, the method further comprising generating a list of eligible servicers for each task, wherein determining whether the selected first task is allocatable to the selected first servicer comprises determining whether the selected first servicer is included in the list of eligible service for the selected first task.

19. The computer readable medium of claim 18, wherein determining whether the selected first task is allocatable to the selected first servicer further comprises determining whether the schedule of the appraiser accommodates the task.

20. The computer readable medium of claim 19, wherein the schedule of the appraiser comprises an event having:

a duration,

an earliest start time, and

a latest end time.

21. The computer readable medium of claim 15, the method further comprising:

determining a skill requirement attribute for the first task; and

determining a skill attribute for the first servicer,

wherein determining whether the selected first task is allocatable to the selected first servicer comprises determining whether the skill attribute of the first servicer corresponds with the skill requirement attribute of the first task.