Waiting-call selection based on anticipated wait times

• US 5,905,793 A
• Filed: 03/07/1997
• Issued: 05/18/1999
• Est. Priority Date: 03/07/1997
• Status: Expired due to Term

• Current Assignee: Avaya Incorporated
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Flockhart, Andrew D., Kohler, Joylee E., Mathews, Eugene P., Foster, Robin Harris
• Primary Examiner(s): SMITH, CREIGHTON H
• Application Number:
  US08/813,513
• Time in Patent Office: 802 Days
• Field of Search: 379/265, 379/266, 379/309, 379/207
• US Class Current: 379/266.06
• CPC Class Codes: H04M 3/523 with call distribution or queueing
• CPC Class Codes: H04M 3/5233 Operator skill based call distribution
• CPC Class Codes: H04M 3/5238 with waiting time or load prediction arrangements

Abstract

The maximum wait time for callers in a call center (FIG. 10) is lowered by selecting, for an agent (25) who has just become available to handle a call, a highest-priority waiting call that would most likely wait the longest if it were not selected at this time. Anticipated wait times are computed for the calls at the heads of the non-empty highest-priority call queues that correspond to the agent'"'"'s skills or splits (202-210). The anticipated wait time of a call is computed as the call'"'"'s present (elapsed) wait time plus the average rate of advance of calls in the call'"'"'s queue (210). The call with the longest anticipated wait time is then selected first and is assigned to the available agent for handling (212-216). The process is repeated each time that any agent becomes available.

Claims

1. A method of selecting one of a plurality of items that are waiting to be selected, comprising the steps of:

anticipating how long each one of the plurality of items that are waiting to be selected will have waited to be selected if said item is not selected first from among the waiting items; and

first selecting the one of the waiting items that has a longest anticipated wait time.

2. The method of claim 1 further comprising the step of:

repeating the steps of claim 1 until only one item of the plurality of items remains waiting to be selected.

3. The method of claim 1 wherein:

the step of anticipating comprises the steps of

determining how long each one of the plurality of items has been waiting to be selected,

determining how long each one of the plurality of items is likely to wait to be selected if said item is not selected first, and

for each one of the items, combining the determinations made for said item to obtain the anticipated wait time for said item.

4. The method of claim 1 for selecting one of a plurality of items from a plurality of queues each having at least one enqueued item, wherein:

the step of anticipating comprises the step of

anticipating how long each item that is enqueued at a head of any of the queues will have waited to be selected if said item is not selected first from among the items that are enqueued at the heads of the plurality of the queues.

5. The method of claim 4 further comprising the step of:

repeating the steps of claim 4 until only one of the plurality of the queues has any items enqueued therein.

6. The method of claim 1 wherein:

the plurality of items are waiting to be selected for processing, and

the first-selected item is selected for being processed first from among the waiting items.

15. An apparatus that effects the steps of claim, 1 or 2 or 3 or 4 or 5 or 6 or 7 or 8 or 9 or 10 or 11 or 12 or 13 or 14.

16. A computer-readable medium containing software which, when executed in a computer, causes the computer to perform the steps of claim 1 or 2 or 3 or 4 or 5 or 6 or 7 or 8 or 9 or 10 or 11 or 12 or 13 or 14.

7. A method of selecting for processing one of a plurality of communications that are waiting to be processed, comprising the steps of:

anticipating how long each one of the plurality of communications that are waiting to be processed will have waited before being processed if said communication is not processed first from among the waiting communications; and

first processing the one of the waiting communications that has a longest anticipated wait time.

8. The method of claim 7 further comprising the step of:

repeating the steps of claim 7 until only one communication of the plurality of communications remains waiting to be processed.

9. The method of claim 7 wherein:

the step of anticipating comprises the steps of

determining how long each one of the plurality of communications has been waiting to be processed,

determining how long each one of the plurality of communications is likely to wait to be processed if said communication is not processed first from among the waiting communications, and

for each one of the waiting communications, combining the determinations made for said communication to obtain the anticipated wait time for said communication.

10. The method of claim 7 for selecting for processing one of a plurality of communications from a plurality of queues each having at least one enqueued communication, wherein:

the step of anticipating comprises the step of

anticipating how long each communication that is enqueued at a head of any of the queues will have waited to be processed if said communication is not processed first from among the communications that are enqueued at the heads of the plurality of the queues.

11. The method of claim 10 wherein:

the step of anticipating how long each communication that is enqueued at a head of any of the queues will have waited comprises the steps of

determining how long each one of the plurality of the communications that are enqueued at the heads of the queues have been enqueued,

determining how long each one of the plurality of the communications that are enqueued at the heads of the queues is likely to remain enqueued if said communication is not processed first, and

for each one of the plurality of the communications that are enqueued at the heads of the queues, combining the determinations made for said communication to obtain the anticipated wait time for said communication.

12. The method of claim 11 wherein:

the step of determining how long each one of the plurality of the communications is likely to remain enqueued comprises the step of

determining for each of the queues a rate of advance of enqueued communications through the queue.

13. The method of claim 11 further comprising the step of:

repeating the steps of claim 11 until only one of the plurality of the queues has any communications enqueued therein.

14. The method of claim 10 wherein:

each one of the queues corresponds to a different skill or split, and

the step of anticipating comprises the steps of

in response to an agent becoming available to process a communication, determining skills or splits that correspond to the agent;

in response to determining the skills or splits that correspond to the agent, anticipating how long each communication that is enqueued at a head of any of the queues that correspond to the skills or splits that correspond to the agent will have waited to be processed if said communication is not processed first from among the communications that are enqueued at the heads of the queues that correspond to the skills or splits that correspond to the agent.

17. An apparatus for selecting one of a plurality of items that are waiting to be selected, comprising:

means for anticipating how long each one of the plurality of items that are waiting to be selected will have waited to be selected if said item is not selected first from among the waiting items; and

means cooperative with the anticipating means, for first selecting the one of the waiting items that has a longest anticipated wait time.

18. An apparatus for selecting one of a plurality of items that are waiting to be selected, comprising:

an effector of anticipating how long each one of the plurality of items that are waiting to be selected will have waited to be selected if said item is not selected first from among the waiting items; and

an effector, cooperative with the effector of anticipating, of first selecting the one of the waiting items that has a longest anticipated wait time.