METHOD AND SYSTEM FOR ALLOCATING PERSONNEL AND RESOURCES TO EFFICIENTLY COMPLETE DIVERSE WORK ASSIGNMENTS

• US 20020065700A1
• Filed: 04/19/1999
• Published: 05/30/2002
• Est. Priority Date: 04/19/1999
• Status: Abandoned Application

• Current Assignee: Epicron, Inc.
• Original Assignee: Epicron, Inc.
• Inventors: LANE, MARK T., POWELL, G. EDWARD, INDSETH, RUNAR
• Application Number:
  US09/294,251
• Publication Number:
  US 20020065700A1
• Time in Patent Office: Days
• US Class Current: 705/9
• 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/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/063116 Schedule adjustment for a person or group
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

The present invention provides a method for processing multiple work assignments to a mobile workforce having a plurality of mobile workforce members. The steps of this method include receiving a first work assignment. This work assignment is then examined to determine the type of work assignment, a service assignment or a pooled assignment. If the work assignment is a pooled work assignment, the work assignment is placed within a pooled work assignment queue. Similarly, if the work assignment is a service work assignment, that assignment is placed within a service work assignment queue. The process is iterative and additional work assignments may be received and sorted into the proper queue. A schedule may then be created for each individual work force member according to the assignments within the service queue. These scheduled are examined and periods of availability or slack times are identified. These periods of availability or slack time are then filled with work assignments from the pooled queue.

Claims

1. A method for processing work assignments of diverse types to a workforce having a plurality of members, wherein the method is accomplished with a scheduling software engine, comprising the steps of:

receiving a first work assignment;

determining a type for the first work assignment;

creating a type queue for each diverse type of work assignment wherein a priority is assigned to each type queue;

placing the first work assignment in the type queue corresponding to the type of the first work assignment;

processing a subsequent work assignment as the first work assignment;

creating a schedule for each workforce member based on the type queue which has a highest priority;

determining availability in the schedule for each workforce member; and

assigning work assignment of a different type from a type queue having a next highest priority within the availability in the schedule for each mobile workforce member from the type queue having the next highest priority.

2. The method of claim 1, further comprising:

dividing an area to be serviced by the workforce into a grid of smaller blocks;

assigning to each work assignment a priority;

assigning to each work assignment a smaller block; and

ordering the work assignments placed in their type queue according to their priority within the type queue.

3. The method of claim 2, further comprising:

assigning to each work assignment a required skill level;

assigning to each workforce member a skill level; and

only scheduling those workforce members having a skill level equal to or greater than the required skill level to each work assignment.

4. The method of claim 2, wherein the step of creating a schedule for each individual workforce member further comprises looping the work assignments in the type queue which has a highest priority to create an optimized loop of work assignments for each workforce member.

5. The method of claim 4, wherein the step of assigning work assignments comprises:

determining which work assignments from the next highest priority queue can be completed within the availability of the workforce member and retaining those work assignments in a first group;

scheduling the work assignments from the first group for an individual workforce member until there is no availability within the individual workforce member schedule; and

reiterating the above steps until there are no work assignments within the first group.

6. The method of claim 5, further comprising:

retaining work assignments within the first group according to a user-defined priority assigned to the work assignment.

7. The method of claim 5, wherein the priority of the work assignments within the first group is increased until the work assignment is completed.

8. The method of claim 7, wherein the work assignments from the first group can be removed from the schedule and replaced by emergent work assignments from the type queue having the highest priority.

9. The method of claim 2, further comprising:

receiving subsequent work assignments;

reiterating the steps of processing the work assignment wherein current workforce member schedules are evaluated and revised if necessary; and

distributing the revised workforce member schedules to the workforce members.

10. A method for processing a plurality of work assignments to a mobile workforce having a plurality of mobile workforce members, comprising the steps of:

receiving a first work assignment;

determining if the first work assignment is a service assignment or a pooled assignment;

placing the service assignment in a service queue;

placing the pooled assignment in a pooled queue;

processing a subsequent work assignment as the first work assignment;

creating a schedule for each mobile workforce member based on the service queue;

determining periods of availability in the schedule for each mobile workforce member; and

assigning pooled work assignment where there are periods of availability in the schedule for each mobile workforce member from the pooled queue.

11. The method of claim 10, further comprising:

dividing a geographic location to be serviced by the mobile workforce into a grid of smaller geographic blocks;

assigning to each work assignment a priority;

assigning to each work assignment a geographic block; and

ordering the work assignments placed in the service queue and the pooled queue according to their priority.

12. The method of claim 11, further comprising:

assigning to each work assignment a required skill level; and

assigning to each mobile workforce member a skill level.

13. The method of claim 11, wherein the step of creating a schedule for each individual workforce member further comprises looping the service work assignments in the service queue to create an optimized geographic loop for each mobile workforce member comprising a path of geographic blocks.

14. The method of claim 13, wherein the step of assigning pooled work assignments comprises:

determining which pooled work assignments can be completed within the availability of the workforce member;

retaining pooled work assignments in a first group which are in the geographic blocks forming the path of the looping service work assignments;

scheduling the pooled work assignments from the first group for an individual workforce member until there are no periods of availability within the individual workforce member'"'"'s schedule; and

reiterating the above steps until there are no pooled work assignments with the first group.

15. The method of claim 14, further comprising:

retaining pooled work assignments within the first group according to a user-defined priority assigned to the work assignment; and

retaining poled work assignments within the first group that are located in geographic blocks adjacent to those blocks forming the path of the service work assignments.

16. The method of claim 14, wherein the priority of the pooled work assignments is increased until the work assignment is completed.

17. The method of claim 15, wherein the pooled work assignments can be removed from the schedule and replaced by an emergent service work assignment.

18. The method of claim 11, further comprising:

receiving subsequent work assignments;

reiterating the steps of processing the work assignment wherein current workforce member schedules are evaluated and revised if necessary; and

distributing the revised workforce member schedules to the workforce members.

19. The method of claim 18, wherein the subsequent work assignment is an emergency work assignment.

20. A computer system directed by a computer program operable to schedule a plurality of diverse work assignments, the computer system comprising:

a storage device operable to store program data;

a memory operable to store a computer program;

a processor coupled to the storage device and the memory, the processor operable to execute the computer program such that the computer is directed by the computer program to schedule the plurality of diverse work assignments for a mobile workforce having a plurality of mobile workforce members;

receive a first work assignment;

determine if the first work assignment is a service assignment or a pooled assignment;

place the service assignment in a service queue;

place the pooled assignment in a pooled queue;

receive and process a subsequent work assignment as the first work assignment;

create a schedule for each mobile workforce member based on the work assignments in the service queue;

determine the availability in the schedule for each mobile workforce member;

assign work assignments in the pooled queue to individual workforce members;

a communication system to distribute a work assignment schedule to the workforce members; and

a user interface used by the user to a access the computer program wherein the user may enter subsequent work assignments and workforce member schedules.

21. The computer system of claim 20, wherein the computer system is further directed by the computer program to:

divide a geographic area to be serviced by the mobile workforce into a grid of smaller geographic blocks;

assign to each work assignment a priority;

assign to each work assignment a geographic block; and

order the work assignments placed in the service queue and the pooled queue according to their priority.

22. The computer system of claim 21, wherein the computer system is further directed by the computer program to:

loop the work assignments in a queue to create an optimized geographic loop for each mobile workforce member comprising a path of geographic blocks.

23. The computer system of claim 22, wherein the computer system is further directed by the computer program to:

determine which pooled work assignments can be completed within the availability period of the workforce member;

place these pooled work assignments within an available queue for the workforce member;

retain pooled work assignments in the available queue which are in the geographic blocks forming the path of the looping service work assignments; and

schedule the pooled work assignments for the individual workforce member from the available queue until there are no periods of availability.

24. The computer system of claim 23, wherein the computer system is further directed by the computer program to:

retain pooled work assignments within the available queue according to a user-defined priority assigned to the work assignment; and

retain pooled work assignments within the available queue that are located in geographic blocks adjacent to those blocks forming the path of the service work assignments.

25. The computer system of claim 22, wherein the computer system is further directed by the computer program to:

increase the priority of the pooled work assignments until the work assignment is completed.

26. The computer system of claim 23, wherein the computer system is further directed by the computer program to:

remove pooled work assignments from the schedule when an emergent service work assignments is placed in the service queue.

28. The method of claim 27, further comprising:

dividing an area to be serviced by the workforce into a grid of smaller blocks;

assigning to each work assignment a priority;

assigning to each work assignment a smaller block; and

ordering the work assignments placed in their type queue according to their priority within the type queue.

29. The method of claim 28, further comprising:

assigning to each work assignment a required skill level;

assigning to each workforce member a skill level; and

only scheduling those workforce members having a skill level equal to or greater than the required skill level to each work assignment.

30. The method of claim 28, wherein the step of creating a schedule for each individual workforce member further comprises looping the work assignments in the type queue which has a highest priority to create an optimized loop of work assignments for each workforce member.

31. The method of claim 30, wherein the step of assigning work assignments comprises:

determining which work assignments from the next highest priority queue can be completed within the availability of the workforce member and retaining those work assignments in a first group;

scheduling the work assignments from the first group for an individual workforce member until there is no availability within the individual workforce member schedule; and

reiterating the above steps until there are no work assignments within the first group.

32. The method of claim 31, further comprising:

retaining work assignments within the first group according to a user-defined priority assigned to the work assignment.

33. The method of claim 31, wherein the priority of the work assignments within the first group is increased until the work assignment is completed.

34. The method of claim 33, wherein the work assignments from the first group can be removed from the schedule and replaced by emergent work assignments from the type queue having the highest priority.

35. The method of claim 28, further comprising:

receiving subsequent work assignments;

reiterating the steps of processing the work assignment wherein current workforce member schedules are evaluated and revised if necessary; and

distributing the revised workforce member schedules to the workforce members.

27. A method for processing work assignments of diverse types to a workforce having a plurality of members, comprising the steps of:

receiving a first work assignment;

determining a type for the first work assignment;

creating a type queue for each diverse type of work assignment wherein a priority is assigned to each type queue;

placing the first work assignment in the type queue corresponding to the type of the first work assignment;

processing a subsequent work assignment as the first work assignment;

creating a schedule for each workforce member based on the type queue which has a highest priority;

determining availability in the schedule for each workforce member; and

assigning work assignment of a different type from a type queue having a next highest priority within the availability in the schedule for each mobile workforce member from the type queue having the next highest priority.