Waiting-call selection based on anticipated wait times

<u>Technical Field</u>

0001This invention relates to queuing arrangements, for example to telephone call-answering centers and automatic call-distribution systems.

<u>Background of the Invention</u>

0002In automatic call-distribution (ACD) systems, calls incoming to a call center are answered and handled by a plurality of agents. The ACD system automatically distributes and connects incoming calls to whatever agents are suited to handle the calls and are free, that is, not handling other calls at the moment.

0003It often happens that the call center becomes overloaded by calls, so that no suitable agents are available to handle calls at the moment that the calls come in. The calls then back up. They are placed in different queues based upon some preestablished criteria, and are placed in each queue in the order of their arrival and/or priority. There they await suitable agents becoming free and available to service them. The waiting calls are distributed to agents for handling on an oldest-call-waiting (OCW) basis. That is, when an agent becomes available, the system considers the call at the head of each queue from which that agent is eligible to handle a call, and selects the one of the calls that has been waiting the longest. The system does not consider how long a call will have to wait for the next available agent if the call is not selected at this time.

<u>Summary of the Invention</u>

0004The inventors have realized that the additional wait time of each call that is not presently selected represents a cost, expressed for example in caller frustration and call abandonment, to the ACD system's client (the called party). They have further realized that they can lower the overall average speed of call answer, and thereby lower the abovementioned cost, by selecting, for the agent who has just become available, the call that would most likely wait the longest if it were not selected at this time. For example, if a call queue corresponding to a main, large, skill possessed by many agents has a present elapsed wait time of one minute and a call rate of advance time of 10 seconds, the total anticipated wait time is 70 seconds for the oldest call in that queue. If a call queue corresponding to a specialized, small, skill possessed by few agents has a present elapsed wait time of 50 seconds and a call rate of advance of 25 seconds (since only a few agents have the skill), the total anticipated wait time is 75 seconds for the oldest call in that queue. According to the invention, a call from the queue corresponding to the specialized skill would be selected for an available agent who has both skills, even though the presently-oldest waiting call is in the queue corresponding to the main skill. Such call distribution not only lowers the average overall speed of answer, it also provides improved service to call types that only a few agents can handle or that require a long talk time (i.e., that have a low call rate of advance).

0005Generally according to the invention, therefore, there is provided a method of and an apparatus for selecting one of a plurality of items (e.g., calls) that are waiting to be selected. The method comprises 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. Preferably these steps are repeated until only one item of the plurality of items remains waiting to be selected. The apparatus effects the method steps. It preferably includes an effector --any entity that effects the corresponding step, unlike a means--for each method step. Further according to the invention, there is provided a computer-readable medium containing software which, when executed in a computer, causes the computer to perform the method steps.

0006If the plurality of waiting items are communications that are waiting to be processed (e.g., handled by agents), the method comprises 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. The apparatus and the executing software again effect the method steps.

0007These and other advantages and features of the invention will become more apparent from the following description of an illustrative embodiment of the invention taken together with the drawing.

<u>Brief Description of the Drawing</u>

0008<ul id="ul0001" list-style="none" compact="compact"><li>FIG. 1 is a block diagram of a call center that includes an illustrative embodiment of the invention; and</li><li>FIG. 2 is a flow diagram of operations of the SEL function of the call center of FIG. 1.</li></ul>

<u>Detailed Description</u>

0009FIG. 1 shows an illustrative call center that comprises an automatic call-distribution (ACD) switch 10 serving a plurality of agent stations 11 at least some of which are staffed by agents 25. ACD switch 10 is connected to a plurality of trunks 12 over which it receives incoming calls. It then distributes and connects these calls to stations 11 of available agents 25 based on a set of predetermined criteria. The agents process calls sent to them by ACD switch 10. The call center of FIG. 1 is illustratively the subscriber-premises equipment disclosed in U.S. Patent No. 5,206,903.

0010ACD switch 10 is also served by a pair of adjunct processors 13 and 14. Call management system (CMS) 13 provides a call accounting, reporting, and management capability, and a voice information system (VIS) 14 provides an announcements capability. Both adjunct processors 13 and 14 are conventional. CMS 13 is illustratively the Lucent Technologies CMS, and VIS 14 is illustratively the Lucent Technologies Conversant® VIS. As is conventional, ACD system 10 is a stored-program-controlled unit that includes a memory 15 comprising one or more different memory units for storing programs and data, and a processor 16 for executing the stored programs and using the stored data in their execution. The memory includes a plurality of sets 20 of call queues 21. Each set 20 of call queues 21 conventionally serves and holds calls for a different split or skill group of agents. Within each set 20 of call queues 21, each queue 21 holds calls of a different priority. Alternatively, each set 20 comprises only one call queue 21 in which calls of different priority are enqueued in their order of priority. Calls are assigned different priorities in a known manner based upon some predefined criteria such as, for example, whether the caller is an unknown person, a regular account holder, or a preferred customer. Each queue 21 functions as a first-in, first-out (FIFO) buffer memory, and includes a plurality of entries, or positions 23, each for identifying a corresponding one enqueued call. The position 23 at the head of queue 21 is considered to be position number 1, the next subsequent position 23 in queue 21 is considered to be position number 2, etc.

0011Memory 15 further includes an estimated wait time (EWT) function 22. As its name implies, this function determines an estimate of how long a call that is placed in a queue 21 will have to wait before being connected to a station 11 for servicing. The estimate is derived separately by EWT function 22 for each queue 21 of each set 20. It is based on the average rate of advance of calls through positions 23 of the calls' corresponding queue 21; this rate of advance is computed by EWT function 22. An illustrative implementation of EWT function 22 is disclosed in U.S. Patent No. 5,506,898.

0012Memory 15 further includes a call-selection (SEL) function 24. Function 24 is conventional in that, for each call at the head of a queue 21, it determines how long the call has been in the queue (the call's present wait time, or PWT), and in that, for each available agent 25, it selects a call from queues 21 for connection to and handling by that agent 25. According to the invention, however, SEL function 24 does not select calls on an oldest (highest PWT)-call-waiting basis. Rather, when an agent 25 becomes available, SEL function 24 considers the call at the head of each queue 21 from which that agent is eligible to handle a call, and selects the highest-priority one of the calls that would most likely wait the longest if it were not selected at this time. This functionality of SEL function 24 is flowcharted in FIG. 2.

0013Execution of SEL function 24 is invoked each time that an agent 25 becomes available to handle a call, at step 200 of FIG. 2. In response, SEL function 24 determines, from the agent's stored profile, the skills to which agent 25 is assigned, at step 202. SEL function 24 then determines the highest priority of any calls that are waiting for any of the determined skills. Illustratively, for each of the agent's skills, SEL function 24 selects the corresponding set 20 of call queues 21 and determines the highest-priority call queue 21 in that set 20 which contains at least one call, and then determines the priority of the highest-priority one of the determined call queues 21. SEL function 22 then selects those determined call queues 21 which have the highest priority and computes the anticipated wait times for those selected queues 21, as follows.

0014For the call at the head of each of the determined highest-priority call queues 21, SEL function determines how long that call has been in queue (i.e., determines the call's present wait time), in a conventional manner, at step 206. For each of those calls, SEL function 24 also obtains from EWT function 22 the average rate of advance of calls in the corresponding call queue 21, at step 208. SEL function 24 further sums the two quantities obtained for each of the calls at steps 206 and 208 to compute each call's anticipated wait time, at step 210. Alternatively, the average rate of advance may be adjusted prior to summing, by subtracting therefrom one-half of the time since the last call was removed from the corresponding call queue and summing the result or 25% of the unadjusted average rate of advance -- whichever is greater -- with the present wait time. SEL function 24 then compares the computed anticipated wait times and selects the call that has the longest anticipated wait time, at step 212, and assigns the selected call to the agent 25 who became available at step 200, at step 216. SEL function 24 then ends execution, at step 218, until an agent 25 becomes available again.

0015Of course, various changes and modifications to the illustrative embodiment described above will be apparent to those skilled in the art. For example, when there are not enough calls to keep the agents busy and the agents queue up to wait for calls, the same algorithm can be used to determine which agent should take the next incoming call. Or, the SEL function may be performed by an adjunct processor that is connected to and controls the ACD switch via computer telephony integration (CTI). Also, application of the invention is not limited to distribution of real-time calls; it may also be applied to the queuing and distribution of stored requests sent or left by requestors, such as e-mail, voice mail, fax, video/voice recordings, and multimedia messages. The concept of AWT routing is also applicable to workflow applications that route work items among people or stations qualified to do the next piece of the overall work, and to shop-floor scheduling. Such changes and modifications can be made without departing from the spirit and the scope of the invention and without diminishing its attendant advantages. It is therefore intended that such changes and modifications be covered by the following claims.