Method for resource assignment and scheduling

• US 5,467,268 A
• Filed: 02/25/1994
• Issued: 11/14/1995
• Est. Priority Date: 02/25/1994
• Status: Expired due to Term

• Current Assignee: 3M Company
• Original Assignee: 3M Company
• Inventors: Collins, John E., Sisley, Elizabeth M.
• Primary Examiner(s): McElheny, Jr., Donald E.
• Application Number:
  US08/201,664
• Time in Patent Office: 627 Days
• Field of Search: 364/403, 364/402, 364/401, 364/424.02, 364/436, 395/913, 395/925, 395/926
• US Class Current: 705/7.16
• 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/063116 Schedule adjustment for a person or group
• 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/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/06315 Needs-based resource requirements planning or analysis
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/1097 Task assignment

Abstract

A system and method for assigning and scheduling resource requests to resource providers use a modified "best-first" search technique that combines optimization, artificial intelligence, and constraint-processing to arrive at near-optimal assignment and scheduling solutions. In response to changes in a dynamic resource environment, potential changes to an existing assignment set are evaluated in a search for a better solution. New calls are assigned and scheduled as they are received, and the assignment set is readjusted as the field service environment changes, resulting in global optimization. Each search operation is in response to either an incremental change to the assignment set such as adding a new resource request, removing a pending resource request, reassigning a pending resource request, or to a request for further evaluation. Thus, the search technique assumes that the existing assignment set is already optimized, and limits the task only to evaluating the effects of the incremental change. In addition, each search operation produces a complete assignment and scheduling solution. Consequently, the search can be terminated to accept the best solution generated so far, making the technique an "anytime" search.

Claims

1. A computer-implemented method for assigning a plurality of resource requests among a plurality of resource providers, said plurality of resource requests including a plurality of pending resource requests assigned among said resource providers according to an existing assignment set, wherein said existing assignment set defines a root node of a search tree, said method comprising the steps of:

(a) expanding said root node by forming one or more next-level nodes, each of said next-level nodes corresponding to said root node but being further defined by a reassignment of one of said pending resource requests between one of said resource providers and another of said resource providers;

(b) estimating, for each of said next-level nodes, a stress value representing a degree of undesirability of the respective reassignment; and

(c) generating a new assignment set corresponding to one of said next-level nodes having a minimum stress value.

2. The method of claim 1, wherein each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

3. The method of claim 1, wherein said plurality of resource requests includes an unassigned new resource request, and said step (a) includes the steps of:

(a)(i) expanding said root node by forming one or more first-level nodes, each of said first-level nodes corresponding to said root node but being further defined by an assignment of said new resource request to a selected one of said resource providers;

(a)(ii) estimating, for each of said first-level nodes, a stress value representing a degree of undesirability of the respective assignment; and

(a)(iii) expanding one or more of said first-level nodes by forming, for each of said first-level nodes, one or more of said next-level nodes, wherein each of said next-level nodes corresponds to the respective first-level node but is further defined by a reassignment of one of said pending resource requests between said selected one of said resource providers and another of said resource providers,

wherein said new assignment set corresponds to one of said first-level nodes and said next-level nodes having a minimum stress value.

4. The method of claim 3, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

5. The method of claim 3, wherein said step (a)(iii) comprises the steps of:

selecting one of said first-level nodes having a minimum stress value; and

expanding the selected one of said first-level nodes by forming one or more of said next-level nodes.

6. The method of claim 5, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

7. The method of claim 5, further comprising the steps of:

(d) selecting one of the unexpanded first-level nodes and the unexpanded next-level nodes having a minimum stress value;

(e) expanding the selected one of said unexpanded first-level nodes and said unexpanded next-level nodes as a preceding-level node by forming one or more next-level nodes, each of said next-level nodes corresponding to the preceding-level node but being further defined by a reassignment of one of said pending resource requests between one of said resource providers and another of said resource providers; and

(f) estimating, for each of said next-level nodes formed by step (e), a stress value representing a degree of undesirability of the respective reassignment; and

(g) repeating said steps (d), (e), and (f) to expand one of said unexpanded first-level nodes and said unexpanded next-level nodes as a preceding-level node, thereby forming a succession of said next-level nodes,

wherein said new assignment set corresponds to one of said first-level nodes and said succession of said next-level nodes having a minimum stress value.

8. The method of claim 7, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

9. The method of claim 7, wherein said existing assignment set includes an existing schedule set, said existing schedule set including, for each of said resource providers, an existing schedule of the pending resource requests assigned to the respective resource provider, said method further comprising the steps of:

generating, for each of said first-level nodes, a schedule set corresponding to said existing schedule set but including a schedule of said new resource request and the pending resource requests assigned to said selected one of said resource providers; and

generating, for each of said next-level nodes, a schedule set corresponding to the schedule set for the respective preceding-level node but including schedules of the resource requests assigned and reassigned to said one and said another of said resource providers,

wherein said new assignment set includes the schedule set for the respective one of said first-level nodes and said next-level nodes having said minimum stress value.

10. The method of claim 9, wherein said step of generating a schedule set for each of said first-level nodes includes the steps of:

generating one or more potential schedules of said new resource request and the pending resource requests assigned to said selected one of said resource providers;

estimating, for each of said potential schedules, a schedule stress value representing a degree of undesirability of the respective potential schedule; and

selecting one of said potential schedules having a minimum schedule stress value as said schedule for said selected one of said resource providers.

11. The method of claim 10, wherein said step of generating a schedule set for each of said next-level nodes includes the steps of:

generating one or more potential schedules, said potential schedules including one or more first potential schedules of the resource requests assigned to said one of said resource providers, and one or more second potential schedules of the resource requests assigned to said another of said resource providers;

estimating, for each of said potential schedules, a schedule stress value representing a degree of undesirability of the respective potential schedule; and

selecting one of said first potential schedules having a first minimum schedule stress value as said schedule for said one of said resource providers, and one of said second potential schedules having a second minimum schedule stress value as said schedule for said another of said resource providers.

12. The method of claim 11, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

13. The method of claim 11, wherein, in said step (a)(ii), the stress value estimated for each of said first-level nodes includes a representation of said minimum schedule stress value for the respective first-level node, and, in said steps (b) and (f), the stress value estimated for each of said next-level nodes includes a representation of said first minimum schedule stress value and said second minimum schedule stress value for the respective next-level node.

14. The method of claim 13, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

15. The method of claim 11, further comprising the step of storing the schedule sets previously generated for said first-level nodes and said next-level nodes, wherein each of said steps of generating a schedule set for one of said first-level nodes and said next-level nodes includes the steps of:

before said step of generating said one or more potential schedules for a respective one of said resource providers, searching the stored schedule sets to locate a previous schedule for the resource requests to be schedule for the respective resource provider; and

if a previous schedule for the resource requests to be scheduled for said respective resource provider is located, selecting said previous schedule as said schedule for said respective resource provider.

16. The method of claim 15, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

17. The method of claim 11, wherein said step of generating said one or more potential schedules for each of said first-level nodes includes, before generating said potential schedules, the steps of:

estimating a worst acceptable schedule stress value;

estimating, for each of said first-level nodes, a minimum stress of insertion of said new resource request among the pending resource requests on the existing schedule for said selected technician; and

discarding each of said first-level nodes having a minimum stress of insertion that exceeds said worst acceptable schedule stress value.

18. The method of claim 17, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

19. The method of claim 11, wherein said step of generating said one or more first and second potential schedules for each of said next-level nodes includes, before generating said potential schedules, the steps of:

estimating a worst acceptable schedule stress value;

estimating, for each of said next-level nodes, a minimum stress of insertion of the pending resource request reassigned to one of said one and said another of said resource providers among the pending resource requests on the existing schedules for the respective one of said one and said another of said resource providers; and

discarding each of said next-level nodes having a minimum stress of insertion that exceeds said worst acceptable schedule stress value.

20. The method of claim 19, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

21. The method of claim 11, wherein each of said steps of generating one or more potential schedules for each of said first-level nodes and said next-level nodes includes the steps of:

designating, for each of said potential schedules, a critical set of said resource requests assigned to the respective resource provider;

scheduling one of said resource requests in said critical set earlier than said resource requests not in said critical set;

designating, after said scheduling of one of said resource requests in said critical set, a different critical set of said resources requests; and

scheduling one of said resource requests in said different critical set earlier than said resource requests not in said different critical set.

22. The method of claim 21, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

23. The method of claim 11, wherein each of said steps of estimating a schedule stress value includes estimating the degree of undesirability of the respective potential schedule based on at least one of a plurality of component schedule stress values associated with each of the resource requests on said respective potential schedule, said component stress values including a priority value of the respective resource request, an urgency value of the respective resource request, a queue time value representing a time interval elapsed between receipt of the respective resource request and a completion time of a preceding one of said resource requests on the respective potential schedule, a tardiness value representing a time interval between a promised start time for the respective resource request and an expected start time for the respective resource request, and a travel time value representing a time required by the resource provider to whom said respective resource request is assigned to travel to a location associated with said respective resource request.

24. The method of claim 23, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

25. The method of claim 7, further comprising the step of generating, for each of said resource requests, a list of said resource providers qualified to accept assignment of the respective resource request, the resource providers on said list being designated as candidate resource providers for the respective resource request, wherein, in said step (a)(i), said selected one of said resource providers is a selected one of the candidate resource providers for said new resource request, and, in said step (e), each of said one and said another of said resource providers is one of the candidate resource providers for the respective reassigned pending resource request.

26. The method of claim 25, wherein each of the candidate resource providers qualified to accept assignment of a respective one of said new and pending resource requests is associated with a resource level appropriate for the respective resource request.

27. The method of claim 26, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

28. The method of claim 25, wherein each of the candidate resource providers qualified to accept assignment of a respective one of said new and pending resource requests is associated with a territory appropriate for the respective resource request.

29. The method of claim 28, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

30. The method of claim 25, wherein said step (a)(i) of forming one or more of said next-level nodes further comprises the steps of:

(A) forming one or more out-expanded next-level nodes corresponding to the respective first-level node but being further defined by a reassignment of one of said pending resource requests from said selected one of said resource providers to another of said resource providers; and

(B) forming one or more in-expanded next-level nodes corresponding to the respective first-level node but being further defined by a reassignment of one of said pending resource requests to said selected one of said resource providers from another of said resource providers.

31. The method of claim 30, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

32. The method of claim 7, further comprising the step of terminating the repetition of said steps (d), (e), and (f) when none of said unexpanded first-level nodes and said unexpanded next-level nodes has a stress value less than a stress threshold.

33. The method of claim 32, wherein said stress threshold is a sum of a minimum stress value of said stress values for said first-level nodes and said next-level nodes and a stress margin, said stress threshold being recalculated with each repetition of said step (f).

34. The method of claim 33, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

35. The method of claim 7, further comprising the step of terminating the repetition of said steps (d), (e), and (f) when a number of levels formed of said next-level nodes exceeds a depth limit.

36. The method of claim 35, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

37. The method of claim 7, further comprising the step of terminating the repetition of said steps (d), (e), and (f) when a number of said first-level nodes and said next-level nodes exceeds a node-count limit.

38. The method of claim 37, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

39. The method of claim 7, further comprising the step of terminating the repetition of said steps (d), (e), and (f) when elapsed time during formation of said first-level nodes and said next-level nodes exceeds a time limit.

40. The method of claim 39, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

41. The method of claim 7, wherein said step (a)(ii) of estimating a stress value includes estimating the degree of undesirability of the respective assignment based on at least one of a plurality of component stress values associated with said respective assignment.

42. The method of claim 41, wherein said plurality of component stress values includes:

a commitment stress value, said commitment stress value being a low value if assignment of said respective new resource request is not committed to one of said resource providers or if assignment of said respective new resource request is committed to the resource provider to whom said respective new resource request is assigned, and said commitment stress value otherwise being higher than said low value;

a primary resource provider stress value, said primary resource provider stress value being a low value if none of said resource providers is designated as a primary resource provider for said respective new resource request or if said respective new resource request is assigned to one of said resource providers designated as the primary resource provider for said respective new resource request, and said primary resource provider stress value otherwise being higher than said low value; and

a territory stress value, said territory stress value being a low value if a location associated with said respective new resource request is within an acceptable travel time of a territory of the resource provider to whom said respective new resource request is assigned, and said territory stress value otherwise being higher than said low value.

43. The method of claim 42, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

44. The method of claim 41, wherein said plurality of component stress values includes:

a resource stress value representing a number of resources for which the resource provider, to whom said respective new resource request is assigned, is qualified to provide.

45. The method of claim 44, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

46. The method of claim 7, wherein each of said steps (b) and (f) of estimating a stress value includes estimating the degree of undesirability of the respective reassignment based on at least one of a plurality of component stress values associated with said respective reassignment.

47. The method of claim 46, wherein said plurality of component stress values includes:

a commitment stress value, said commitment stress value being a low value if assignment of said respective pending resource request is not committed to one of said resource providers or if assignment of said respective pending resource request is committed to the resource provider to whom said respective pending resource request is reassigned, and said commitment stress value otherwise being higher than said low value;

a primary resource provider stress value, said primary resource provider stress value being a low value if none of said resource providers is designated as a primary resource provider for said respective pending resource request or if said respective pending resource request is reassigned to one of said resource providers designated as the primary resource provider for said respective pending resource request, and said primary resource provider stress value otherwise being higher than said low value; and

a territory stress value, said territory stress value being a low value if a location associated with said respective pending resource request is within an acceptable travel time of a territory of the resource provider to whom said respective pending resource request is reassigned, and said territory stress value otherwise being higher than said low value.

48. The method of claim 47, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

49. The method of claim 46, wherein said plurality of component stress values includes:

a resource stress value representing a number of resources for which the resource provider, to whom said respective pending resource request is reassigned, is qualified to provide.

50. The method of claim 49, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.

51. The method of claim 7, further comprising the step of displaying a representation of said new assignment set to a user for approval.

52. The method of claim 51, wherein said new resource request and each of said pending resource requests is a field service call, and each of said resource providers is a field service technician.