CA2227731C - Waiting-call selection based on objectives - Google Patents
Waiting-call selection based on objectives Download PDFInfo
- Publication number
- CA2227731C CA2227731C CA002227731A CA2227731A CA2227731C CA 2227731 C CA2227731 C CA 2227731C CA 002227731 A CA002227731 A CA 002227731A CA 2227731 A CA2227731 A CA 2227731A CA 2227731 C CA2227731 C CA 2227731C
- Authority
- CA
- Canada
- Prior art keywords
- waiting
- determining
- items
- time
- queues
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 claims abstract description 25
- 230000003466 anti-cipated effect Effects 0.000 claims abstract description 5
- 230000004044 response Effects 0.000 claims abstract description 5
- 230000008569 process Effects 0.000 claims abstract description 3
- 239000003795 chemical substances by application Substances 0.000 claims description 32
- 230000000694 effects Effects 0.000 claims description 3
- 239000012636 effector Substances 0.000 claims 2
- 230000006870 function Effects 0.000 description 7
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 244000228957 Ferula foetida Species 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/523—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing with call distribution or queueing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/523—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing with call distribution or queueing
- H04M3/5232—Call distribution algorithms
- H04M3/5233—Operator skill based call distribution
Abstract
Call-center (FIG. 1) performance is improved by assigning different service-time objectives (222) to different types of calls or to call queues (21) for different types of calls, and then selecting (212), for an agent (25) who has just become available (200) to handle a call, a waiting call that is farthest along in exceeding its assigned service-time objective. The objectives represent limits on the amount of time that calls should spend waiting for agents before being handled. For example, a video call may need to be serviced within tens of seconds of its arrival, and a voice-only call may need to be serviced within minutes, while e-mail may need a response within hours of its arrival. Relative distance of calls from their assigned service-time objectives is preferably determined by determining (206) the calls'present or anticipated wait times and computing (210) weighted percentages of the assigned service-time objectives that are represented by the present or anticipated wait times. The call with the highest weighted percentage is then selected (212) and assigned (214) to the available agent for handling. The process is repeated each time that any agent becomes available.
Description
WAITING-CALL SELECTION BASED ON OBJECTIVES
Technical Field This invention relates to queuing arrangements, for example to telephone call-answering centers and automatic call-distribution systems.
S Back~round of the Invention In 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 available, that is, not h~n~lling other calls at the moment.
It 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 dirrelent queues based upon some preestablished criteria, and are placed in each queue in the order of their arrival and/or pliority. There they await suitable agents becoming available to service them.
15 The waiting calls are distributed to agents for h~n~ling 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 take into consideration the unique service-time needs of different types of calls. For 20 example, a video call may need to be serviced within tens of seconds of its arrival, and a voice-only call may need to be serviced within minutes, while e-mail may need a response within hours of its arrival.
S~ s~ y of the Invention This invention is directed to solving these and other deficiencies of the 25 prior art. Illustratively according to the invention, call center performance in meeting the needs of clients is improved by assigning dirrele,lt service-time objectives to dirrelellt types of calls or to call queues for different types of calls, and then selecting a waiting call that is farthest along in (e.g., closest to) exceeding its assigned service-time objective for h~nrlling by an available agent. The objectives 30 represenlt limits on the amount of time that calls should spend waiting for agents before being handled. Given this capability, call types can be prioritized by having different assigned service-time objectives. As the service-time objective of a waiting call is ap~proached, the urgency, or priority, of the waiting call automaticallyincreases relative to newly-arriving calls.
Generally according to the invention, there is provided a method of and an apparatus for selecting one of a plurality of items (e.g., communications) that are waiting to be selected. Different ones of a plurality of waiting-time limits are assignecl to dirrelent ones of the plurality of items. A determination is then made of which one of the plurality of waiting items is farthest along in exceeding its assigned waiting-time limit, and the one item that is farthest along in exceeding its assigned waiting time limit is selected. The second and third steps are preferably repeated S until only one item of the plurality remains waiting to be selected. The determination is preferably made by determining a present waiting time for each one of the plurality of waiting items and then determining a ratio --for example, a percenta,ge-- of the present waiting time and the assigned waiting-time limit for each one of the plurality of waiting items. The ratio may be either straight or weighted.
10 The waiting item having the largest determined ratio is then selected.
While the method comprises the steps of the just-characterized procedure, the apparatus effects the method steps. The apparatus preferably includes an effecltor --any entity that effects the corresponding step, unlike means-- for each step. Further according to the invention, there is provided a computer-readable . 15 medium containing software which, when executed in a computer, causes the computer to perform the method steps.
If the plurality of waiting items are comnlunications that are waiting to be processed (e.g., handled by agents) the procedure involves ~igning different ones of l:he plurality of waiting communications to different ones of a plurality of waiting-time limits, determining which one of the plurality of waiting communications is farthest along in exceeding its assigned waiting-time limit, and first processing the determined one of the plurality of waiting communications.
These 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.
Brief Description of the D~
FIG. 1 is a block diagram of a call center that includes an illustrative embodirnent of the invention; and FIG. 2is a flow diagram of operations of the SEL function of the call center o~F FIG. 1.
Detailed Description FIG. 1 shows an illusbrative call center that comprises an automatic call-disbribution (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 pluralLity of brunks 12 over which it receives incoming calls. It then disbributes and connects these ca]Lls 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.
ACD 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 5 managennent 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 l O different memory units for storing programs and data, and a processor 16 forexecuting 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 dirrer~.rt 15 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 preferrecl customer. Calls may likewise be ~sign~d different priorities based on the 20 call's me dium or media, e.g., video, voice-only, e-mail, etc. 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 subseque nt position 23 in queue 21 is considered to be position number 2, etc.
Memory 15 further includes an estim~tecl wait time (EWT) function 22.
As its name implies, this function determines an estimate of how long a call that is placed in 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 30 positions 23 of the calls' corresponding queue 21. An illustrative implementation of EWT function 22 is disclosed in U.S. Patent No. 5,506,898.
Memory 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, itdetermines how long the call has been in the queue (the call's present wait time, or 35 PWT), and in that, for each available agent 25 it selects a call from queues 21 for connection to and h~ndling by that agent 25. According to the invention, however, SEL function 24 does not select calls on an oldest-call waiting (OCW) basis. Rather, when an agent 25 becomes available, SEL function considers the call at the head of the highest-priority non-empty queue 21 of each set 20 from which that agent is eligible to handle a call, and selects the call that is farthest along according to some predefined measure --either in actual time or as a percentage of the service-time 5 objective, or as a combination of the two, for example-- in excee~ing its service-time objective. If no call happens to have already exceeded its service time objective, the call that comes closest to exceeding its objective is selected. If any calls happen to have already exceeded their service-time objectives, the call that has most exceeded its objecl:ive is selected. This functionality of SEL function 24 is flowcharted in 10 FIG. 2.
As shown in FIG. 2, SEL function 24 includes a table 220 of pre-a-lminictered (i.e., pre-programmed) values of service-time objectives 222, one assigned to each queue 21, i.e., to the calls in each queue 21. By placing a call in a particular queue 21, ACD system 10 assigns that queue's service-time objective 222 15 to that call. Each objective 222 represents a limit on the amount of time from entering the corresponding queue 21 that a call should spend waiting in queue 21before being connected to and/or answered by an agent 25. Execution of SEL
function 24 is invoked each time that an agent 25 becomes available to handle a call, at step 2(}0. In response, SEL function 25 determines, from the agent's stored 20 profile, the skills or splits to which agent 25 is assigned, at step 202. SELfunction 24 then determines the highest-priority non-empty call queue 21 in eachset 20 that corresponds to the agent's skills or splits, at step 204. That is, for each of the agent's skills or splits, SEL function 24 selects the corresponding set 20 of call queues 21, and determines the highest-priority call queue 21 in each selected set 20 25 which contains at least one call.
For the call at the head of each of the determined call queues 21, SEL
function 24 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. Alternatively, SEL
function 24 may determine the call's anticipated wait time (a function of the present 30 wait time and the average rate of advance of calls through the queue). Also, for each of the deltermined call queues 21, SEL function 24 determines the corresponding service-time objective 222 from table 220, at step 208. For each of the calls at the heads of the determined call queues 21, SEL function 24 then computes the expired service-time objective ratio or percentage, by dividing the wait time obtained at 35 step 206 by the service-time objective and for percentage multiplying the result by 100, at step 210. Preferably, prior to the next step, the computed ratios are normalizevd, to compensate for differences in orders of magnitude of the objectives of the different queues. For example, each ratio may be weighted by a dividend of the average rate of advance of calls through the corresponding queue and the time remaining to expiration of the queue's service-time objective. SEL function 24 then compares the computed/normalized expired service-time objective ratios or S percentages and selects the call that has the highest expired service-time objective ratios or percentage, at step 212. If two or more calls have the same expired service-time objective percentage, SEL function 24 selects from among them the call which ha,s the highest priority. Alternatively, SEL function 24 may compute at step 210 the difference between the service-time objective and the actual or 10 anticipated wait time for each of the subject calls, by subtracting the wait time obtained at step 206 from the service time objective, and then selecting at step 212 the call that has the lowest (including negative) resulting difference. SEL
function 24 then assigns the selected call to the agent 25 who became available at step 200, at step 214, and ends execution, at step 216, until an agent 25 becomes 15 available again.
Of course, various changes and modifications to the illustrative embodiment described above will be apparent to those skilled in the art. For example, each queue position 23 may include a separate service-time objective value for the individual call that is preselltly in that queue position, and SEL function 24 20 then performs the determinations of steps 206-210 for every call in each of the queues which correspond to the available agent's skills or splits. 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). Such changes and modifications can be made without departing from the spirit and the scope of the25 invention and without dimini~hing its attendant advantages. It is therefore intended that such changes and modifications be covered by the following claims.
Technical Field This invention relates to queuing arrangements, for example to telephone call-answering centers and automatic call-distribution systems.
S Back~round of the Invention In 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 available, that is, not h~n~lling other calls at the moment.
It 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 dirrelent queues based upon some preestablished criteria, and are placed in each queue in the order of their arrival and/or pliority. There they await suitable agents becoming available to service them.
15 The waiting calls are distributed to agents for h~n~ling 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 take into consideration the unique service-time needs of different types of calls. For 20 example, a video call may need to be serviced within tens of seconds of its arrival, and a voice-only call may need to be serviced within minutes, while e-mail may need a response within hours of its arrival.
S~ s~ y of the Invention This invention is directed to solving these and other deficiencies of the 25 prior art. Illustratively according to the invention, call center performance in meeting the needs of clients is improved by assigning dirrele,lt service-time objectives to dirrelellt types of calls or to call queues for different types of calls, and then selecting a waiting call that is farthest along in (e.g., closest to) exceeding its assigned service-time objective for h~nrlling by an available agent. The objectives 30 represenlt limits on the amount of time that calls should spend waiting for agents before being handled. Given this capability, call types can be prioritized by having different assigned service-time objectives. As the service-time objective of a waiting call is ap~proached, the urgency, or priority, of the waiting call automaticallyincreases relative to newly-arriving calls.
Generally according to the invention, there is provided a method of and an apparatus for selecting one of a plurality of items (e.g., communications) that are waiting to be selected. Different ones of a plurality of waiting-time limits are assignecl to dirrelent ones of the plurality of items. A determination is then made of which one of the plurality of waiting items is farthest along in exceeding its assigned waiting-time limit, and the one item that is farthest along in exceeding its assigned waiting time limit is selected. The second and third steps are preferably repeated S until only one item of the plurality remains waiting to be selected. The determination is preferably made by determining a present waiting time for each one of the plurality of waiting items and then determining a ratio --for example, a percenta,ge-- of the present waiting time and the assigned waiting-time limit for each one of the plurality of waiting items. The ratio may be either straight or weighted.
10 The waiting item having the largest determined ratio is then selected.
While the method comprises the steps of the just-characterized procedure, the apparatus effects the method steps. The apparatus preferably includes an effecltor --any entity that effects the corresponding step, unlike means-- for each step. Further according to the invention, there is provided a computer-readable . 15 medium containing software which, when executed in a computer, causes the computer to perform the method steps.
If the plurality of waiting items are comnlunications that are waiting to be processed (e.g., handled by agents) the procedure involves ~igning different ones of l:he plurality of waiting communications to different ones of a plurality of waiting-time limits, determining which one of the plurality of waiting communications is farthest along in exceeding its assigned waiting-time limit, and first processing the determined one of the plurality of waiting communications.
These 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.
Brief Description of the D~
FIG. 1 is a block diagram of a call center that includes an illustrative embodirnent of the invention; and FIG. 2is a flow diagram of operations of the SEL function of the call center o~F FIG. 1.
Detailed Description FIG. 1 shows an illusbrative call center that comprises an automatic call-disbribution (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 pluralLity of brunks 12 over which it receives incoming calls. It then disbributes and connects these ca]Lls 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.
ACD 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 5 managennent 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 l O different memory units for storing programs and data, and a processor 16 forexecuting 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 dirrer~.rt 15 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 preferrecl customer. Calls may likewise be ~sign~d different priorities based on the 20 call's me dium or media, e.g., video, voice-only, e-mail, etc. 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 subseque nt position 23 in queue 21 is considered to be position number 2, etc.
Memory 15 further includes an estim~tecl wait time (EWT) function 22.
As its name implies, this function determines an estimate of how long a call that is placed in 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 30 positions 23 of the calls' corresponding queue 21. An illustrative implementation of EWT function 22 is disclosed in U.S. Patent No. 5,506,898.
Memory 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, itdetermines how long the call has been in the queue (the call's present wait time, or 35 PWT), and in that, for each available agent 25 it selects a call from queues 21 for connection to and h~ndling by that agent 25. According to the invention, however, SEL function 24 does not select calls on an oldest-call waiting (OCW) basis. Rather, when an agent 25 becomes available, SEL function considers the call at the head of the highest-priority non-empty queue 21 of each set 20 from which that agent is eligible to handle a call, and selects the call that is farthest along according to some predefined measure --either in actual time or as a percentage of the service-time 5 objective, or as a combination of the two, for example-- in excee~ing its service-time objective. If no call happens to have already exceeded its service time objective, the call that comes closest to exceeding its objective is selected. If any calls happen to have already exceeded their service-time objectives, the call that has most exceeded its objecl:ive is selected. This functionality of SEL function 24 is flowcharted in 10 FIG. 2.
As shown in FIG. 2, SEL function 24 includes a table 220 of pre-a-lminictered (i.e., pre-programmed) values of service-time objectives 222, one assigned to each queue 21, i.e., to the calls in each queue 21. By placing a call in a particular queue 21, ACD system 10 assigns that queue's service-time objective 222 15 to that call. Each objective 222 represents a limit on the amount of time from entering the corresponding queue 21 that a call should spend waiting in queue 21before being connected to and/or answered by an agent 25. Execution of SEL
function 24 is invoked each time that an agent 25 becomes available to handle a call, at step 2(}0. In response, SEL function 25 determines, from the agent's stored 20 profile, the skills or splits to which agent 25 is assigned, at step 202. SELfunction 24 then determines the highest-priority non-empty call queue 21 in eachset 20 that corresponds to the agent's skills or splits, at step 204. That is, for each of the agent's skills or splits, SEL function 24 selects the corresponding set 20 of call queues 21, and determines the highest-priority call queue 21 in each selected set 20 25 which contains at least one call.
For the call at the head of each of the determined call queues 21, SEL
function 24 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. Alternatively, SEL
function 24 may determine the call's anticipated wait time (a function of the present 30 wait time and the average rate of advance of calls through the queue). Also, for each of the deltermined call queues 21, SEL function 24 determines the corresponding service-time objective 222 from table 220, at step 208. For each of the calls at the heads of the determined call queues 21, SEL function 24 then computes the expired service-time objective ratio or percentage, by dividing the wait time obtained at 35 step 206 by the service-time objective and for percentage multiplying the result by 100, at step 210. Preferably, prior to the next step, the computed ratios are normalizevd, to compensate for differences in orders of magnitude of the objectives of the different queues. For example, each ratio may be weighted by a dividend of the average rate of advance of calls through the corresponding queue and the time remaining to expiration of the queue's service-time objective. SEL function 24 then compares the computed/normalized expired service-time objective ratios or S percentages and selects the call that has the highest expired service-time objective ratios or percentage, at step 212. If two or more calls have the same expired service-time objective percentage, SEL function 24 selects from among them the call which ha,s the highest priority. Alternatively, SEL function 24 may compute at step 210 the difference between the service-time objective and the actual or 10 anticipated wait time for each of the subject calls, by subtracting the wait time obtained at step 206 from the service time objective, and then selecting at step 212 the call that has the lowest (including negative) resulting difference. SEL
function 24 then assigns the selected call to the agent 25 who became available at step 200, at step 214, and ends execution, at step 216, until an agent 25 becomes 15 available again.
Of course, various changes and modifications to the illustrative embodiment described above will be apparent to those skilled in the art. For example, each queue position 23 may include a separate service-time objective value for the individual call that is preselltly in that queue position, and SEL function 24 20 then performs the determinations of steps 206-210 for every call in each of the queues which correspond to the available agent's skills or splits. 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). Such changes and modifications can be made without departing from the spirit and the scope of the25 invention and without dimini~hing its attendant advantages. It is therefore intended that such changes and modifications be covered by the following claims.
Claims (20)
1. A method of selecting one of a plurality of items that are waiting to be selected, comprising the steps of:
assigning different ones of the plurality of items to different ones of a plurality of waiting-time limits;
determining which one of the plurality of items is farthest along in exceeding its assigned waiting-time limit; and selecting the determined one of the plurality of items.
assigning different ones of the plurality of items to different ones of a plurality of waiting-time limits;
determining which one of the plurality of items is farthest along in exceeding its assigned waiting-time limit; and selecting the determined one of the plurality of items.
2. The method of claim 1 further comprising the step of:
repeating the second and third steps of claim 1 until only one item of the plurality of items remains waiting to be selected.
repeating the second and third 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 determining comprises the steps of determining a present waiting time for each one of the plurality of items, and determining a ratio of the present waiting time and the assigned waiting-time limit for each one of the plurality of items; and the step of selecting comprises the step of selecting the item having a largest determined said ratio.
the step of determining comprises the steps of determining a present waiting time for each one of the plurality of items, and determining a ratio of the present waiting time and the assigned waiting-time limit for each one of the plurality of items; and the step of selecting comprises the step of selecting the item having a largest determined said ratio.
4. The method of claim 1 wherein:
the step of determining comprises the steps of determining a present waiting time for each one of the plurality of items, and determining a percentage of the waiting-time limit represented by the present waiting time for each one of the plurality of items; and the step of selecting comprises the step of selecting the item having a largest determined said percentage.
the step of determining comprises the steps of determining a present waiting time for each one of the plurality of items, and determining a percentage of the waiting-time limit represented by the present waiting time for each one of the plurality of items; and the step of selecting comprises the step of selecting the item having a largest determined said percentage.
5. The method of claim 1 wherein:
the step of determining comprises the steps of anticipating how long each one of the plurality of items will have waited to be selected if said item is not selected first from among the plurality of items, and determining which one of the plurality of items has an anticipated wait time that is farthest along in exceeding its assigned waiting-time limit.
the step of determining comprises the steps of anticipating how long each one of the plurality of items will have waited to be selected if said item is not selected first from among the plurality of items, and determining which one of the plurality of items has an anticipated wait time that is farthest along in exceeding its assigned waiting-time limit.
6. 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 assigning comprises the step of assigning different ones of the plurality of waiting-time limits to different ones of the plurality of queues; and the step of determining comprises the steps of determining which one of items that are enqueued at heads of the queues is farthest along in exceeding the waiting-time limit of its queue.
the step of assigning comprises the step of assigning different ones of the plurality of waiting-time limits to different ones of the plurality of queues; and the step of determining comprises the steps of determining which one of items that are enqueued at heads of the queues is farthest along in exceeding the waiting-time limit of its queue.
7. The method of claim 6 further comprising the step of:
repeating the steps of determining which one of the items that are enqueued at heads of the queues is farthest along in exceeding the waiting-time limit of its queue and selecting the determined one of the plurality of items until only one of the plurality of the queues has any items enqueued therein.
repeating the steps of determining which one of the items that are enqueued at heads of the queues is farthest along in exceeding the waiting-time limit of its queue and selecting the determined one of the plurality of items until only one of the plurality of the queues has any items enqueued therein.
8. The method of claim 1 wherein:
the plurality of items are waiting to be selected for processing, and the selected item is selected for being processed first from among the waiting items.
the plurality of items are waiting to be selected for processing, and the selected item is selected for being processed first from among the waiting items.
9. A method of selecting for processing one of a plurality of communications that are waiting to be processed, comprising the steps of:
assigning different ones of the plurality of waiting communications to different ones of a plurality of waiting-time limits;
determining which one of the plurality of waiting communications is farthest along in exceeding its assigned waiting-time limit; and first processing the determined one of the plurality of waiting communications.
assigning different ones of the plurality of waiting communications to different ones of a plurality of waiting-time limits;
determining which one of the plurality of waiting communications is farthest along in exceeding its assigned waiting-time limit; and first processing the determined one of the plurality of waiting communications.
10. The method of claim 9 further comprising the step of:
repeating the second and third steps of claim 9 until only one communication of the plurality of communications remains waiting to be processed.
repeating the second and third steps of claim 9 until only one communication of the plurality of communications remains waiting to be processed.
11. The method of claim 9 wherein:
the step of determining comprises the steps of determining a present waiting time indicative of how long a communication has been waiting to be processed, for each one of the plurality ofcommunications, and determining a ratio of the present waiting time and the assigned waiting-time limit for each one of the plurality of communications; and the step of first processing comprises first processing the communication having a largest determined said ratio.
the step of determining comprises the steps of determining a present waiting time indicative of how long a communication has been waiting to be processed, for each one of the plurality ofcommunications, and determining a ratio of the present waiting time and the assigned waiting-time limit for each one of the plurality of communications; and the step of first processing comprises first processing the communication having a largest determined said ratio.
12. The method of claim 11 wherein:
the step of determining a ratio comprises the step of determining a percentage of the waiting-time limit represented by the present waiting time, for each one of the plurality of communications.
the step of determining a ratio comprises the step of determining a percentage of the waiting-time limit represented by the present waiting time, for each one of the plurality of communications.
13. The method of claim 9 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 assigning comprises the step of assigning different ones of the plurality of waiting-time limits to different ones of the queues; and the step of determining comprises the step of determining which one of communications waiting at heads of the queues is farthest along in exceeding the waiting-time limit of its queue.
the step of assigning comprises the step of assigning different ones of the plurality of waiting-time limits to different ones of the queues; and the step of determining comprises the step of determining which one of communications waiting at heads of the queues is farthest along in exceeding the waiting-time limit of its queue.
14. The method of claim 13 wherein:
the step of determining which one of the communications waiting at heads of the queues is farthest along in exceeding the waiting-time limit of its queue comprises the steps of determining a present waiting time indicative of how long a communication has been waiting to be processed, for each of the communications waiting at heads of the queues, and determining a ratio of the present waiting time and the waiting-time limit assigned to the queue for each one of the communications waiting at heads of the queues; and the step of first processing comprises the step of first processing the one of the communications waiting at heads of the queues which has a highest determined said ratio.
the step of determining which one of the communications waiting at heads of the queues is farthest along in exceeding the waiting-time limit of its queue comprises the steps of determining a present waiting time indicative of how long a communication has been waiting to be processed, for each of the communications waiting at heads of the queues, and determining a ratio of the present waiting time and the waiting-time limit assigned to the queue for each one of the communications waiting at heads of the queues; and the step of first processing comprises the step of first processing the one of the communications waiting at heads of the queues which has a highest determined said ratio.
15. The method of claim 14 further comprising the step of:
repeating the steps of claim 13 other than the step of assigning until only one of the plurality of the queues has any communications enqueued therein.
repeating the steps of claim 13 other than the step of assigning until only one of the plurality of the queues has any communications enqueued therein.
16. The method of claim 9 for selecting for processing one of a plurality of communications from a plurality of queues each having at least one enqueued communication, wherein:
each one of the queues corresponds to a different skill or split;
the step of assigning comprises the step of assigning different ones of the plurality of waiting-time limits to different ones of the queues;
the step of determining comprises the steps of in response to an agent becoming available to process a communication, determining skills or splits that correspond to the agent, and in response to determining the skills or splits that correspond to the agent, determining which one of communications enqueued at heads of the queues that correspond to the skills or splits that correspond to the agent is farthest along in exceeding its assigned waiting-time limit.
each one of the queues corresponds to a different skill or split;
the step of assigning comprises the step of assigning different ones of the plurality of waiting-time limits to different ones of the queues;
the step of determining comprises the steps of in response to an agent becoming available to process a communication, determining skills or splits that correspond to the agent, and in response to determining the skills or splits that correspond to the agent, determining which one of communications enqueued at heads of the queues that correspond to the skills or splits that correspond to the agent is farthest along in exceeding its assigned waiting-time limit.
17. 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 or 15 or 16.
18. 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 or 15 or 16.
19. An apparatus for selecting one of a plurality of items that are waiting to be selected, comprising:
a memory for storing different ones of a plurality of waiting-time limits assigned to different ones of the plurality of items;
an effector, cooperative with the memory, of determining which one of the plurality of items is farthest along in exceeding its assigned waiting-time limit;
and a selector, cooperative with the effector, for selecting the determined one of the plurality of items.
a memory for storing different ones of a plurality of waiting-time limits assigned to different ones of the plurality of items;
an effector, cooperative with the memory, of determining which one of the plurality of items is farthest along in exceeding its assigned waiting-time limit;
and a selector, cooperative with the effector, for selecting the determined one of the plurality of items.
20. An apparatus for selecting one of a plurality of items that are waiting to be selected, comprising:
means for storing different ones of a plurality of waiting-time limits assigned to different ones of the plurality of items;
means cooperative with the storing means, for determining which one of the plurality of items is farthest along in exceeding its assigned waiting time limit;
and means cooperative with the determining means, for selecting the determined one of the plurality of items.
means for storing different ones of a plurality of waiting-time limits assigned to different ones of the plurality of items;
means cooperative with the storing means, for determining which one of the plurality of items is farthest along in exceeding its assigned waiting time limit;
and means cooperative with the determining means, for selecting the determined one of the plurality of items.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/812,617 | 1997-03-07 | ||
US08/812,617 US5982873A (en) | 1997-03-07 | 1997-03-07 | Waiting-call selection based on objectives |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2227731A1 CA2227731A1 (en) | 1998-09-07 |
CA2227731C true CA2227731C (en) | 2001-12-25 |
Family
ID=25210135
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002227731A Expired - Fee Related CA2227731C (en) | 1997-03-07 | 1998-01-22 | Waiting-call selection based on objectives |
Country Status (5)
Country | Link |
---|---|
US (1) | US5982873A (en) |
EP (1) | EP0863651A3 (en) |
JP (1) | JP3350435B2 (en) |
KR (1) | KR19980080015A (en) |
CA (1) | CA2227731C (en) |
Families Citing this family (232)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5879656A (en) * | 1993-10-26 | 1999-03-09 | Thomas Jefferson University | Methods of treating metastatic colorectal cancer with ST receptor binding compounds |
US5911880A (en) * | 1995-12-15 | 1999-06-15 | Research Corporation Technologies, Inc. | Self-wetting membranes from engineering plastics |
US5974414A (en) * | 1996-07-03 | 1999-10-26 | Open Port Technology, Inc. | System and method for automated received message handling and distribution |
US6104802A (en) | 1997-02-10 | 2000-08-15 | Genesys Telecommunications Laboratories, Inc. | In-band signaling for routing |
US6480600B1 (en) | 1997-02-10 | 2002-11-12 | Genesys Telecommunications Laboratories, Inc. | Call and data correspondence in a call-in center employing virtual restructuring for computer telephony integrated functionality |
US7031442B1 (en) | 1997-02-10 | 2006-04-18 | Genesys Telecommunications Laboratories, Inc. | Methods and apparatus for personal routing in computer-simulated telephony |
US6088444A (en) | 1997-04-11 | 2000-07-11 | Walker Asset Management Limited Partnership | Method and apparatus for value-based queuing of telephone calls |
US6985943B2 (en) | 1998-09-11 | 2006-01-10 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for extended management of state and interaction of a remote knowledge worker from a contact center |
US6711611B2 (en) | 1998-09-11 | 2004-03-23 | Genesis Telecommunications Laboratories, Inc. | Method and apparatus for data-linking a mobile knowledge worker to home communication-center infrastructure |
USRE46528E1 (en) | 1997-11-14 | 2017-08-29 | Genesys Telecommunications Laboratories, Inc. | Implementation of call-center outbound dialing capability at a telephony network level |
US6704409B1 (en) * | 1997-12-31 | 2004-03-09 | Aspect Communications Corporation | Method and apparatus for processing real-time transactions and non-real-time transactions |
US7907598B2 (en) | 1998-02-17 | 2011-03-15 | Genesys Telecommunication Laboratories, Inc. | Method for implementing and executing communication center routing strategies represented in extensible markup language |
US6157655A (en) * | 1998-02-17 | 2000-12-05 | Genesys Telecommunications Laboratories, Inc. | Method for estimating telephony system-queue waiting time in an agent level routing environment |
US6332154B2 (en) | 1998-09-11 | 2001-12-18 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for providing media-independent self-help modules within a multimedia communication-center customer interface |
US6330326B1 (en) * | 1998-03-27 | 2001-12-11 | At&T Corp. | Dynamic staffing of service centers to provide substantially zero-delay service |
US6449356B1 (en) * | 1998-05-26 | 2002-09-10 | Rockwell Semiconductor Systems, Inc. | Method of multi-media transaction processing |
US6310952B1 (en) * | 1998-07-01 | 2001-10-30 | Lucent Technologies Inc. | Telephone access to overly popular services |
US6535601B1 (en) * | 1998-08-27 | 2003-03-18 | Avaya Technology Corp. | Skill-value queuing in a call center |
US7013305B2 (en) | 2001-10-01 | 2006-03-14 | International Business Machines Corporation | Managing the state of coupling facility structures, detecting by one or more systems coupled to the coupling facility, the suspended state of the duplexed command, detecting being independent of message exchange |
USRE46153E1 (en) | 1998-09-11 | 2016-09-20 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus enabling voice-based management of state and interaction of a remote knowledge worker in a contact center environment |
US6130942A (en) * | 1998-10-30 | 2000-10-10 | Ericsson Inc. | Skills-based automatic call distribution system |
US6434230B1 (en) | 1999-02-02 | 2002-08-13 | Avaya Technology Corp. | Rules-based queuing of calls to call-handling resources |
US7200219B1 (en) | 1999-02-10 | 2007-04-03 | Avaya Technology Corp. | Dynamically allocating server resources to competing classes of work based upon achievement of service goals |
US7133520B1 (en) * | 1999-04-27 | 2006-11-07 | Rockwell Electronic Commerce Technologies, Llc | Dynamic skill-based call routing |
US6389028B1 (en) * | 1999-09-24 | 2002-05-14 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for providing estimated response-wait-time displays for data network-based inquiries to a communication center |
US6501733B1 (en) * | 1999-10-01 | 2002-12-31 | Lucent Technologies Inc. | Method for controlling data flow associated with a communications node |
DE19954095A1 (en) * | 1999-11-10 | 2001-05-17 | Siemens Ag | Information center and method for operating such |
US7929978B2 (en) | 1999-12-01 | 2011-04-19 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for providing enhanced communication capability for mobile devices on a virtual private network |
US6510221B1 (en) * | 1999-12-06 | 2003-01-21 | Avaya Technology Corp. | System for automatically routing calls to call center agents in an agent surplus condition based on delay probabilities |
US6535600B1 (en) * | 1999-12-06 | 2003-03-18 | Avaya Technology Corp. | System for automatically routing calls to call center agents in an agent surplus condition based on service levels |
US6553114B1 (en) * | 1999-12-06 | 2003-04-22 | Avaya Technology Corp. | System for automatically predicting call center agent work time in a multi-skilled agent environment |
EP1514400B1 (en) | 2000-01-07 | 2018-02-21 | Mitel Communications Inc. | Customer communication service system |
US6661889B1 (en) * | 2000-01-18 | 2003-12-09 | Avaya Technology Corp. | Methods and apparatus for multi-variable work assignment in a call center |
US7050567B1 (en) * | 2000-01-27 | 2006-05-23 | Avaya Technology Corp. | Call management system using dynamic queue position |
US6741698B1 (en) | 2000-01-27 | 2004-05-25 | Avaya Technology Corp. | Call management system using dynamic threshold adjustment |
JP3892199B2 (en) * | 2000-02-17 | 2007-03-14 | 富士通株式会社 | Call service device, call service method, and computer-readable recording medium storing program for causing computer to execute the method |
JP3535068B2 (en) | 2000-03-30 | 2004-06-07 | 富士通株式会社 | Multi-channel processing control apparatus and multi-channel processing control method |
US6956941B1 (en) | 2000-04-12 | 2005-10-18 | Austin Logistics Incorporated | Method and system for scheduling inbound inquiries |
US6741699B1 (en) | 2000-04-27 | 2004-05-25 | Avaya Technology Corp. | Arrangement for controlling the volume and type of contacts in an internet call center |
US6754333B1 (en) | 2000-04-27 | 2004-06-22 | Avaya Technology Corp. | Wait time prediction arrangement for non-real-time customer contacts |
US7844504B1 (en) | 2000-04-27 | 2010-11-30 | Avaya Inc. | Routing based on the contents of a shopping cart |
US6870807B1 (en) | 2000-05-15 | 2005-03-22 | Avaya Technology Corp. | Method and apparatus for suppressing music on hold |
US7013255B1 (en) | 2000-06-09 | 2006-03-14 | Avaya Technology Corp. | Traffic simulation algorithm for asynchronous transfer mode networks |
US7103173B2 (en) | 2001-07-09 | 2006-09-05 | Austin Logistics Incorporated | System and method for preemptive goals based routing of contact records |
US7142662B2 (en) | 2000-07-11 | 2006-11-28 | Austin Logistics Incorporated | Method and system for distributing outbound telephone calls |
US7502460B2 (en) | 2006-11-20 | 2009-03-10 | Austin Logistics Incorporated | Method and system for distributing outbound telephone calls |
US7039176B2 (en) | 2000-08-14 | 2006-05-02 | Telephony@Work | Call center administration manager with rules-based routing prioritization |
US6697858B1 (en) | 2000-08-14 | 2004-02-24 | Telephony@Work | Call center |
EP1446725A4 (en) * | 2000-08-14 | 2004-11-10 | Telephony Work Inc | Call center administration manager with rules-based routing prioritization |
JP2002297900A (en) * | 2001-03-30 | 2002-10-11 | Ibm Japan Ltd | Control system for reception by businesses, user side terminal device, reception side terminal device, management server queue monitoring device, method of allocating reception side terminals, and storage medium |
US7155399B2 (en) | 2001-04-03 | 2006-12-26 | Witness Systems, Inc. | System and method for complex schedule generation |
US6952732B2 (en) | 2001-04-30 | 2005-10-04 | Blue Pumpkin Software, Inc. | Method and apparatus for multi-contact scheduling |
EP1248448A3 (en) * | 2001-04-03 | 2003-06-04 | Blue Pumpkin Software, Inc. | Method and apparatus for skill based scheduling in a call centre |
US7715546B2 (en) | 2001-07-09 | 2010-05-11 | Austin Logistics Incorporated | System and method for updating contact records |
US7054434B2 (en) | 2001-07-09 | 2006-05-30 | Austin Logistics Incorporated | System and method for common account based routing of contact records |
GB2379578A (en) * | 2001-09-10 | 2003-03-12 | Convergent Systems Ltd | Message management with priority assigned in dependence on message type |
US7099935B2 (en) * | 2001-10-01 | 2006-08-29 | International Business Machines Corporation | Dynamically determining whether to process requests synchronously or asynchronously |
US7457862B2 (en) * | 2001-10-22 | 2008-11-25 | Avaya, Inc. | Real time control protocol session matching |
JP2005518114A (en) | 2002-02-14 | 2005-06-16 | アバイア テクノロジー コーポレーション | Presence tracking and namespace interconnect technology |
US8170197B2 (en) * | 2002-03-15 | 2012-05-01 | Intellisist, Inc. | System and method for providing automated call center post-call processing |
US7292689B2 (en) | 2002-03-15 | 2007-11-06 | Intellisist, Inc. | System and method for providing a message-based communications infrastructure for automated call center operation |
US7336779B2 (en) | 2002-03-15 | 2008-02-26 | Avaya Technology Corp. | Topical dynamic chat |
US7415417B2 (en) | 2002-03-15 | 2008-08-19 | Avaya Technology Corp. | Presence awareness agent |
US8068595B2 (en) | 2002-03-15 | 2011-11-29 | Intellisist, Inc. | System and method for providing a multi-modal communications infrastructure for automated call center operation |
US7962644B1 (en) * | 2002-03-18 | 2011-06-14 | Oracle International Corporation | Systems and methods for handling a plurality of communications |
US7489687B2 (en) * | 2002-04-11 | 2009-02-10 | Avaya. Inc. | Emergency bandwidth allocation with an RSVP-like protocol |
US6707905B2 (en) | 2002-04-18 | 2004-03-16 | Avaya Technology Corp. | Location enhanced automatic work distribution |
US7620169B2 (en) * | 2002-06-17 | 2009-11-17 | Avaya Inc. | Waiting but not ready |
US7885896B2 (en) | 2002-07-09 | 2011-02-08 | Avaya Inc. | Method for authorizing a substitute software license server |
US8041642B2 (en) | 2002-07-10 | 2011-10-18 | Avaya Inc. | Predictive software license balancing |
US7707116B2 (en) | 2002-08-30 | 2010-04-27 | Avaya Inc. | Flexible license file feature controls |
US7681245B2 (en) | 2002-08-30 | 2010-03-16 | Avaya Inc. | Remote feature activator feature extraction |
US7698225B2 (en) | 2002-08-30 | 2010-04-13 | Avaya Inc. | License modes in call processing |
US7228567B2 (en) * | 2002-08-30 | 2007-06-05 | Avaya Technology Corp. | License file serial number tracking |
US7966520B2 (en) | 2002-08-30 | 2011-06-21 | Avaya Inc. | Software licensing for spare processors |
US20040073690A1 (en) | 2002-09-30 | 2004-04-15 | Neil Hepworth | Voice over IP endpoint call admission |
US8176154B2 (en) * | 2002-09-30 | 2012-05-08 | Avaya Inc. | Instantaneous user initiation voice quality feedback |
US7359979B2 (en) | 2002-09-30 | 2008-04-15 | Avaya Technology Corp. | Packet prioritization and associated bandwidth and buffer management techniques for audio over IP |
US20040078339A1 (en) * | 2002-10-22 | 2004-04-22 | Goringe Christopher M. | Priority based licensing |
US20040078209A1 (en) * | 2002-10-22 | 2004-04-22 | Thomson Rodney A. | Method and apparatus for on-site enterprise associate and consumer matching |
US7558739B2 (en) * | 2002-10-22 | 2009-07-07 | Avaya Inc. | Method and apparatus for meeting an on-site enterprise service level objective |
US7023980B2 (en) | 2002-12-04 | 2006-04-04 | Avaya Technology Corp. | Outbound dialing decision criteria based |
US7890997B2 (en) | 2002-12-26 | 2011-02-15 | Avaya Inc. | Remote feature activation authentication file system |
US7474741B2 (en) | 2003-01-20 | 2009-01-06 | Avaya Inc. | Messaging advise in presence-aware networks |
US7319692B2 (en) * | 2003-02-21 | 2008-01-15 | Avaya Technology Corp. | Subscriber mobility in telephony systems |
US7260557B2 (en) * | 2003-02-27 | 2007-08-21 | Avaya Technology Corp. | Method and apparatus for license distribution |
US7373657B2 (en) * | 2003-03-10 | 2008-05-13 | Avaya Technology Corp. | Method and apparatus for controlling data and software access |
US20040181696A1 (en) * | 2003-03-11 | 2004-09-16 | Walker William T. | Temporary password login |
US7308499B2 (en) * | 2003-04-30 | 2007-12-11 | Avaya Technology Corp. | Dynamic load balancing for enterprise IP traffic |
US7627091B2 (en) | 2003-06-25 | 2009-12-01 | Avaya Inc. | Universal emergency number ELIN based on network address ranges |
US7412044B2 (en) * | 2003-07-14 | 2008-08-12 | Avaya Technology Corp. | Instant messaging to and from PBX stations |
AU2004274717A1 (en) * | 2003-09-22 | 2005-03-31 | Inserm (Institut National De La Sante Et De La Recherche Medicale) | A method for detecting Nipah virus and method for providing immunoprotection against henipaviruses |
US8094804B2 (en) | 2003-09-26 | 2012-01-10 | Avaya Inc. | Method and apparatus for assessing the status of work waiting for service |
US20050071212A1 (en) * | 2003-09-26 | 2005-03-31 | Flockhart Andrew D. | Method and apparatus for business time computation in a resource allocation system |
US7770175B2 (en) | 2003-09-26 | 2010-08-03 | Avaya Inc. | Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal |
US6973176B1 (en) | 2003-09-30 | 2005-12-06 | Avaya Technology Corp. | Method and apparatus for rotating auto reserve agents |
US7483369B2 (en) * | 2003-09-30 | 2009-01-27 | Avaya Inc. | Method and apparatus for migrating to an alternate call controller |
US7660715B1 (en) | 2004-01-12 | 2010-02-09 | Avaya Inc. | Transparent monitoring and intervention to improve automatic adaptation of speech models |
US8472612B1 (en) | 2004-01-29 | 2013-06-25 | Avaya Inc. | Call center customer queue shortcut access code |
US8489442B1 (en) | 2004-02-02 | 2013-07-16 | Avaya Inc. | Interface for meeting facilitation and coordination, method and apparatus |
US7353388B1 (en) | 2004-02-09 | 2008-04-01 | Avaya Technology Corp. | Key server for securing IP telephony registration, control, and maintenance |
US8457300B2 (en) | 2004-02-12 | 2013-06-04 | Avaya Inc. | Instant message contact management in a contact center |
US7729490B2 (en) | 2004-02-12 | 2010-06-01 | Avaya Inc. | Post-termination contact management |
US7085367B1 (en) | 2004-02-24 | 2006-08-01 | Avaya Technology Corp. | Call duration alert |
US7130385B1 (en) | 2004-03-05 | 2006-10-31 | Avaya Technology Corp. | Advanced port-based E911 strategy for IP telephony |
US7272500B1 (en) | 2004-03-25 | 2007-09-18 | Avaya Technology Corp. | Global positioning system hardware key for software licenses |
US7885401B1 (en) | 2004-03-29 | 2011-02-08 | Avaya Inc. | Method and apparatus to forecast the availability of a resource |
US7158909B2 (en) * | 2004-03-31 | 2007-01-02 | Balboa Instruments, Inc. | Method and system for testing spas |
US7734032B1 (en) | 2004-03-31 | 2010-06-08 | Avaya Inc. | Contact center and method for tracking and acting on one and done customer contacts |
US7953859B1 (en) | 2004-03-31 | 2011-05-31 | Avaya Inc. | Data model of participation in multi-channel and multi-party contacts |
US7408925B1 (en) | 2004-03-31 | 2008-08-05 | Avaya Technology Corp. | Originator based directing and origination call processing features for external devices |
US8000989B1 (en) | 2004-03-31 | 2011-08-16 | Avaya Inc. | Using true value in routing work items to resources |
US7769154B1 (en) | 2004-06-09 | 2010-08-03 | Avaya Inc. | Aggregated perceived presence |
US7978827B1 (en) | 2004-06-30 | 2011-07-12 | Avaya Inc. | Automatic configuration of call handling based on end-user needs and characteristics |
US7983148B1 (en) | 2004-07-12 | 2011-07-19 | Avaya Inc. | Disaster recovery via alternative terminals and partitioned networks |
US8738412B2 (en) | 2004-07-13 | 2014-05-27 | Avaya Inc. | Method and apparatus for supporting individualized selection rules for resource allocation |
US7246746B2 (en) * | 2004-08-03 | 2007-07-24 | Avaya Technology Corp. | Integrated real-time automated location positioning asset management system |
US7707405B1 (en) | 2004-09-21 | 2010-04-27 | Avaya Inc. | Secure installation activation |
US7949121B1 (en) | 2004-09-27 | 2011-05-24 | Avaya Inc. | Method and apparatus for the simultaneous delivery of multiple contacts to an agent |
US8234141B1 (en) | 2004-09-27 | 2012-07-31 | Avaya Inc. | Dynamic work assignment strategies based on multiple aspects of agent proficiency |
US7949123B1 (en) | 2004-09-28 | 2011-05-24 | Avaya Inc. | Wait time predictor for long shelf-life work |
US7657021B2 (en) | 2004-09-29 | 2010-02-02 | Avaya Inc. | Method and apparatus for global call queue in a global call center |
US8229858B1 (en) | 2004-09-30 | 2012-07-24 | Avaya Inc. | Generation of enterprise-wide licenses in a customer environment |
US7965701B1 (en) | 2004-09-30 | 2011-06-21 | Avaya Inc. | Method and system for secure communications with IP telephony appliance |
US7747851B1 (en) | 2004-09-30 | 2010-06-29 | Avaya Inc. | Certificate distribution via license files |
US7366110B2 (en) * | 2004-09-30 | 2008-04-29 | Avaya Technology Corp. | Method and apparatus for merging call components during call reconstruction |
US7706576B1 (en) | 2004-12-28 | 2010-04-27 | Avaya Inc. | Dynamic video equalization of images using face-tracking |
US7613106B2 (en) * | 2005-01-04 | 2009-11-03 | Avaya Inc. | Dial plan transparency for fragmented networks |
US20060146859A1 (en) * | 2005-01-04 | 2006-07-06 | Avaya Technology Corp. | Alternate routing of media connections within a single communications system across public or private network facilities |
US7496056B2 (en) * | 2005-01-04 | 2009-02-24 | Avaya Inc. | Conference connections using dynamic topology switching for IP and circuit-switched fabrics |
US8462637B1 (en) | 2005-01-04 | 2013-06-11 | Sheridan Ross P.C. | Dial plan routing for fragmented networks |
US7564793B2 (en) * | 2005-01-04 | 2009-07-21 | Avaya Inc. | In-band call association signaling for a single number destination |
US7457249B2 (en) | 2005-01-04 | 2008-11-25 | Avaya, Inc. | Alternate routing of media connections within a single communications system across public or private network facilities |
US7589616B2 (en) | 2005-01-20 | 2009-09-15 | Avaya Inc. | Mobile devices including RFID tag readers |
US7460150B1 (en) | 2005-03-14 | 2008-12-02 | Avaya Inc. | Using gaze detection to determine an area of interest within a scene |
US8107625B2 (en) | 2005-03-31 | 2012-01-31 | Avaya Inc. | IP phone intruder security monitoring system |
US7729478B1 (en) | 2005-04-12 | 2010-06-01 | Avaya Inc. | Change speed of voicemail playback depending on context |
US7630487B2 (en) * | 2005-04-26 | 2009-12-08 | Cisco Technology, Inc. | Method and system for distributing calls |
US7817796B1 (en) | 2005-04-27 | 2010-10-19 | Avaya Inc. | Coordinating work assignments for contact center agents |
US7564476B1 (en) | 2005-05-13 | 2009-07-21 | Avaya Inc. | Prevent video calls based on appearance |
US7529670B1 (en) | 2005-05-16 | 2009-05-05 | Avaya Inc. | Automatic speech recognition system for people with speech-affecting disabilities |
US8885812B2 (en) | 2005-05-17 | 2014-11-11 | Oracle International Corporation | Dynamic customer satisfaction routing |
US7809127B2 (en) | 2005-05-26 | 2010-10-05 | Avaya Inc. | Method for discovering problem agent behaviors |
US7668100B2 (en) * | 2005-06-28 | 2010-02-23 | Avaya Inc. | Efficient load balancing and heartbeat mechanism for telecommunication endpoints |
US7779042B1 (en) | 2005-08-08 | 2010-08-17 | Avaya Inc. | Deferred control of surrogate key generation in a distributed processing architecture |
US8583466B2 (en) | 2005-08-09 | 2013-11-12 | Oracle International Corporation | System and method for routing workflow items based on workflow templates in a call center |
US7814023B1 (en) | 2005-09-08 | 2010-10-12 | Avaya Inc. | Secure download manager |
US7881450B1 (en) | 2005-09-15 | 2011-02-01 | Avaya Inc. | Answer on hold notification |
US8577015B2 (en) | 2005-09-16 | 2013-11-05 | Avaya Inc. | Method and apparatus for the automated delivery of notifications to contacts based on predicted work prioritization |
US8073129B1 (en) | 2005-10-03 | 2011-12-06 | Avaya Inc. | Work item relation awareness for agents during routing engine driven sub-optimal work assignments |
US7822587B1 (en) | 2005-10-03 | 2010-10-26 | Avaya Inc. | Hybrid database architecture for both maintaining and relaxing type 2 data entity behavior |
US10572879B1 (en) | 2005-10-03 | 2020-02-25 | Avaya Inc. | Agent driven media-agnostic work item grouping and sharing over a consult medium |
US8116446B1 (en) | 2005-10-03 | 2012-02-14 | Avaya Inc. | Agent driven work item awareness for tuning routing engine work-assignment algorithms |
US8411843B1 (en) | 2005-10-04 | 2013-04-02 | Avaya Inc. | Next agent available notification |
US7752230B2 (en) | 2005-10-06 | 2010-07-06 | Avaya Inc. | Data extensibility using external database tables |
US7787609B1 (en) | 2005-10-06 | 2010-08-31 | Avaya Inc. | Prioritized service delivery based on presence and availability of interruptible enterprise resources with skills |
US7821386B1 (en) | 2005-10-11 | 2010-10-26 | Avaya Inc. | Departure-based reminder systems |
US9008075B2 (en) | 2005-12-22 | 2015-04-14 | Genesys Telecommunications Laboratories, Inc. | System and methods for improving interaction routing performance |
US8238541B1 (en) | 2006-01-31 | 2012-08-07 | Avaya Inc. | Intent based skill-set classification for accurate, automatic determination of agent skills |
US7984378B1 (en) | 2006-02-07 | 2011-07-19 | Avaya Inc. | Management of meetings by grouping |
US8737173B2 (en) | 2006-02-24 | 2014-05-27 | Avaya Inc. | Date and time dimensions for contact center reporting in arbitrary international time zones |
US7653543B1 (en) | 2006-03-24 | 2010-01-26 | Avaya Inc. | Automatic signal adjustment based on intelligibility |
US8442197B1 (en) | 2006-03-30 | 2013-05-14 | Avaya Inc. | Telephone-based user interface for participating simultaneously in more than one teleconference |
US8600794B2 (en) * | 2006-05-10 | 2013-12-03 | Avaya Inc. | Meeting notification and merging agents |
US8165282B1 (en) | 2006-05-25 | 2012-04-24 | Avaya Inc. | Exploiting facial characteristics for improved agent selection |
US8842818B2 (en) * | 2006-06-30 | 2014-09-23 | Avaya Inc. | IP telephony architecture including information storage and retrieval system to track fluency |
US7778858B1 (en) | 2006-07-17 | 2010-08-17 | Avaya Inc. | Linking unable to respond messages to entries in electronic calendar |
US7936867B1 (en) | 2006-08-15 | 2011-05-03 | Avaya Inc. | Multi-service request within a contact center |
US7962342B1 (en) | 2006-08-22 | 2011-06-14 | Avaya Inc. | Dynamic user interface for the temporarily impaired based on automatic analysis for speech patterns |
US7925508B1 (en) | 2006-08-22 | 2011-04-12 | Avaya Inc. | Detection of extreme hypoglycemia or hyperglycemia based on automatic analysis of speech patterns |
US8391463B1 (en) | 2006-09-01 | 2013-03-05 | Avaya Inc. | Method and apparatus for identifying related contacts |
US8938063B1 (en) | 2006-09-07 | 2015-01-20 | Avaya Inc. | Contact center service monitoring and correcting |
US8811597B1 (en) | 2006-09-07 | 2014-08-19 | Avaya Inc. | Contact center performance prediction |
US8855292B1 (en) | 2006-09-08 | 2014-10-07 | Avaya Inc. | Agent-enabled queue bypass to agent |
US7835514B1 (en) | 2006-09-18 | 2010-11-16 | Avaya Inc. | Provide a graceful transfer out of active wait treatment |
US7573996B1 (en) | 2006-10-03 | 2009-08-11 | Avaya Inc. | Presence based callback |
US10445703B1 (en) | 2006-10-30 | 2019-10-15 | Avaya Inc. | Early enough reminders |
US7693736B1 (en) | 2006-10-30 | 2010-04-06 | Avaya Inc. | Recurring meeting schedule wizard |
US8037143B1 (en) | 2006-10-30 | 2011-10-11 | Avaya Inc. | Automatic display of email distribution lists |
US7827240B1 (en) | 2007-01-02 | 2010-11-02 | Avaya Inc. | Calendar item hierarchy for automatic specialization |
US8767944B1 (en) | 2007-01-03 | 2014-07-01 | Avaya Inc. | Mechanism for status and control communication over SIP using CODEC tunneling |
US8150003B1 (en) | 2007-01-23 | 2012-04-03 | Avaya Inc. | Caller initiated undivert from voicemail |
US8060565B1 (en) | 2007-01-31 | 2011-11-15 | Avaya Inc. | Voice and text session converter |
US7617337B1 (en) | 2007-02-06 | 2009-11-10 | Avaya Inc. | VoIP quality tradeoff system |
FR2912519A1 (en) * | 2007-02-08 | 2008-08-15 | Alcatel Lucent Sas | METHODS OF MANAGING AND ALLOCATING RESOURCES |
US7675411B1 (en) | 2007-02-20 | 2010-03-09 | Avaya Inc. | Enhancing presence information through the addition of one or more of biotelemetry data and environmental data |
US8189761B2 (en) | 2007-03-15 | 2012-05-29 | Cisco Technology, Inc. | Method and system for managing calls |
US7747705B1 (en) | 2007-05-08 | 2010-06-29 | Avaya Inc. | Method to make a discussion forum or RSS feed a source for customer contact into a multimedia contact center that is capable of handling emails |
US8514872B2 (en) * | 2007-06-19 | 2013-08-20 | Virtual Hold Technology, Llc | Accessory queue management system and method for interacting with a queuing system |
US8041344B1 (en) | 2007-06-26 | 2011-10-18 | Avaya Inc. | Cooling off period prior to sending dependent on user's state |
US10671600B1 (en) | 2007-07-24 | 2020-06-02 | Avaya Inc. | Communications-enabled dynamic social network routing utilizing presence |
US8504534B1 (en) | 2007-09-26 | 2013-08-06 | Avaya Inc. | Database structures and administration techniques for generalized localization of database items |
US8856182B2 (en) | 2008-01-25 | 2014-10-07 | Avaya Inc. | Report database dependency tracing through business intelligence metadata |
US9300802B1 (en) * | 2008-01-28 | 2016-03-29 | Satmap International Holdings Limited | Techniques for behavioral pairing in a contact center system |
US8385532B1 (en) | 2008-05-12 | 2013-02-26 | Avaya Inc. | Real-time detective |
US8831206B1 (en) | 2008-05-12 | 2014-09-09 | Avaya Inc. | Automated, data-based mechanism to detect evolution of employee skills |
US10375244B2 (en) | 2008-08-06 | 2019-08-06 | Avaya Inc. | Premises enabled mobile kiosk, using customers' mobile communication device |
US8116237B2 (en) | 2008-09-26 | 2012-02-14 | Avaya Inc. | Clearing house for publish/subscribe of status data from distributed telecommunications systems |
US8218751B2 (en) | 2008-09-29 | 2012-07-10 | Avaya Inc. | Method and apparatus for identifying and eliminating the source of background noise in multi-party teleconferences |
CA2958005C (en) * | 2008-11-06 | 2021-07-27 | Afiniti International Holdings, Ltd. | Two step routing procedure in a call center |
USRE48412E1 (en) | 2008-11-06 | 2021-01-26 | Afiniti, Ltd. | Balancing multiple computer models in a call center routing system |
US8472611B2 (en) | 2008-11-06 | 2013-06-25 | The Resource Group International Ltd. | Balancing multiple computer models in a call center routing system |
US9232055B2 (en) * | 2008-12-23 | 2016-01-05 | Avaya Inc. | SIP presence based notifications |
US8621011B2 (en) | 2009-05-12 | 2013-12-31 | Avaya Inc. | Treatment of web feeds as work assignment in a contact center |
US8964958B2 (en) | 2009-05-20 | 2015-02-24 | Avaya Inc. | Grid-based contact center |
US8644491B2 (en) | 2009-08-21 | 2014-02-04 | Avaya Inc. | Mechanism for multisite service state description |
US8385533B2 (en) | 2009-09-21 | 2013-02-26 | Avaya Inc. | Bidding work assignment on conference/subscribe RTP clearing house |
US8301581B2 (en) | 2009-09-24 | 2012-10-30 | Avaya Inc. | Group compositing algorithms for presence |
US8565386B2 (en) | 2009-09-29 | 2013-10-22 | Avaya Inc. | Automatic configuration of soft phones that are usable in conjunction with special-purpose endpoints |
US9516069B2 (en) | 2009-11-17 | 2016-12-06 | Avaya Inc. | Packet headers as a trigger for automatic activation of special-purpose softphone applications |
US8306212B2 (en) | 2010-02-19 | 2012-11-06 | Avaya Inc. | Time-based work assignments in automated contact distribution |
US10467560B2 (en) | 2010-09-30 | 2019-11-05 | Avaya Inc. | System and method for adaptive multiple contact assignment |
US8837705B2 (en) * | 2011-04-06 | 2014-09-16 | Avaya Inc. | Real-time probability based contact handling time |
US8675860B2 (en) | 2012-02-16 | 2014-03-18 | Avaya Inc. | Training optimizer for contact center agents |
US20140081687A1 (en) * | 2012-09-20 | 2014-03-20 | Avaya Inc. | Multiple simultaneous contact center objectives |
US20150206092A1 (en) * | 2014-01-21 | 2015-07-23 | Avaya, Inc. | Identification of multi-channel connections to predict estimated wait time |
US10270914B2 (en) | 2014-01-30 | 2019-04-23 | Avaya Inc. | Enhancing contact center calculations based on real-time speech analytics |
US9473632B2 (en) | 2014-08-27 | 2016-10-18 | Avaya Inc. | System and method to improve self-service experience and optimize contact center resources |
US9628625B2 (en) | 2014-11-26 | 2017-04-18 | Avaya Inc. | System and method to use predicted agent state to optimize selection strategy |
US10587727B2 (en) | 2016-10-04 | 2020-03-10 | Avaya Inc. | Method and system for integrated optimized reporting |
US10623565B2 (en) | 2018-02-09 | 2020-04-14 | Afiniti Europe Technologies Limited | Techniques for behavioral pairing in a contact center system |
US11250359B2 (en) | 2018-05-30 | 2022-02-15 | Afiniti, Ltd. | Techniques for workforce management in a task assignment system |
US10496438B1 (en) | 2018-09-28 | 2019-12-03 | Afiniti, Ltd. | Techniques for adapting behavioral pairing to runtime conditions in a task assignment system |
US11144344B2 (en) | 2019-01-17 | 2021-10-12 | Afiniti, Ltd. | Techniques for behavioral pairing in a task assignment system |
US10757261B1 (en) | 2019-08-12 | 2020-08-25 | Afiniti, Ltd. | Techniques for pairing contacts and agents in a contact center system |
US11445062B2 (en) | 2019-08-26 | 2022-09-13 | Afiniti, Ltd. | Techniques for behavioral pairing in a task assignment system |
US10757262B1 (en) | 2019-09-19 | 2020-08-25 | Afiniti, Ltd. | Techniques for decisioning behavioral pairing in a task assignment system |
US10999440B1 (en) | 2020-01-02 | 2021-05-04 | Avaya Inc. | Method to augment routing delivery systems with intuitive human knowledge, expertise, and iterative artificial intelligence and machine learning in contact center environments |
US11611659B2 (en) | 2020-02-03 | 2023-03-21 | Afiniti, Ltd. | Techniques for behavioral pairing in a task assignment system |
EP4213022A1 (en) | 2020-02-04 | 2023-07-19 | Afiniti, Ltd. | Techniques for error handling in a task assignment system with an external pairing system |
CN115280340A (en) | 2020-02-05 | 2022-11-01 | 阿菲尼帝有限公司 | Techniques for behavioral pairing in a task distribution system having an external pairing system |
CN115244554A (en) | 2020-02-05 | 2022-10-25 | 阿菲尼帝有限公司 | Techniques for sharing control of distributed tasks between an external pairing system and a task distribution system having an internal pairing system |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4330857A (en) * | 1980-02-29 | 1982-05-18 | Ibm Corporation | Dynamically variable priority, variable position channels in a TDMA burst |
US5164983A (en) * | 1991-01-28 | 1992-11-17 | American Telephone & Telegraph Company | Telemarketing complex performance management system |
US5369745A (en) * | 1992-03-30 | 1994-11-29 | The United States Of America As Represented By The United States Department Of Energy | Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals |
US5857018A (en) * | 1992-08-11 | 1999-01-05 | Rockwell International Corp. | Automatic call distributor with prioritization |
AU4280793A (en) * | 1992-10-21 | 1994-05-09 | Digital Systems International, Inc. | Integrated intelligent call blending |
US5390243A (en) * | 1993-11-01 | 1995-02-14 | At&T Corp. | Telemarketing complex with automatic threshold levels |
US5506898A (en) * | 1994-07-12 | 1996-04-09 | At&T Corp. | Expected wait-time indication arrangement |
US5867572A (en) * | 1995-10-17 | 1999-02-02 | British Telecommunications Public Limited Company | Customer queuing arrangement |
US5754639A (en) * | 1995-11-03 | 1998-05-19 | Lucent Technologies | Method and apparatus for queuing a call to the best split |
GB9606298D0 (en) * | 1996-03-26 | 1996-05-29 | British Telecomm | Call queuing and distribution |
-
1997
- 1997-03-07 US US08/812,617 patent/US5982873A/en not_active Expired - Lifetime
-
1998
- 1998-01-22 CA CA002227731A patent/CA2227731C/en not_active Expired - Fee Related
- 1998-02-24 EP EP98301341A patent/EP0863651A3/en not_active Ceased
- 1998-03-06 JP JP05559298A patent/JP3350435B2/en not_active Expired - Lifetime
- 1998-03-07 KR KR1019980007635A patent/KR19980080015A/en not_active Application Discontinuation
Also Published As
Publication number | Publication date |
---|---|
CA2227731A1 (en) | 1998-09-07 |
US5982873A (en) | 1999-11-09 |
EP0863651A2 (en) | 1998-09-09 |
JPH10304073A (en) | 1998-11-13 |
EP0863651A3 (en) | 1999-04-07 |
JP3350435B2 (en) | 2002-11-25 |
KR19980080015A (en) | 1998-11-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2227731C (en) | Waiting-call selection based on objectives | |
CA2227734C (en) | Waiting-call selection based on anticipated wait times | |
US5506898A (en) | Expected wait-time indication arrangement | |
EP0982917B1 (en) | Skill-value queuing in a call center | |
CA2326853C (en) | Methods and apparatus for processing of communications in a call center based on variable rest period determinations | |
EP1011256B1 (en) | Adjustment of call selection to achieve target values for interval-based performance metrics in a call center | |
US5828747A (en) | Call distribution based on agent occupancy | |
US6694009B1 (en) | Estimation of a work item's wait-time from the present stages of processing of preceding work items | |
US6052460A (en) | Arrangement for equalizing levels of service among skills | |
US6925165B2 (en) | Call selection based on continuum skill levels in a call center | |
CA2252236C (en) | Arrangement for equalizing levels of service among skills | |
CA2258357C (en) | Call center agent selection that optimizes call wait times | |
AU716067B2 (en) | Agent vectoring | |
EP0855826B1 (en) | Automatic dynamic changing of agents' call-handling assignments | |
JP2001077922A (en) | Call waiting algorithm for telephone exchange | |
US6366665B1 (en) | Remote ACD data base modification via telephone | |
GB2351203A (en) | Remote ACD data base modification via telephone |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |
Effective date: 20150122 |