Method and apparatus for routing communications within a contact center

Information

  • Patent Grant
  • 11943391
  • Patent Number
    11,943,391
  • Date Filed
    Tuesday, December 13, 2022
    2 years ago
  • Date Issued
    Tuesday, March 26, 2024
    9 months ago
  • Inventors
    • Veloso; António Pedro Dourado de Moura
    • Rodrigues; Ana Carina Fernandes
    • Santos; Pedro Miguel Reis
    • Sun; Yue
  • Original Assignees
  • Examiners
    • Hong; Harry S
    Agents
    • Rimon PC
    • Kaufman; Marc S.
Abstract
Communications within a call center are routed to agents based on available capacity of the agents. Weighting values are associated with communications and each agent has a maximum capacity. Calls are routed to agents based on a current occupancy of each agent. The current occupancy is determined based on weighting values associated with communications currently being handled by the agents. Agents generally are not assigned a communication that would result in an occupancy that is greater than the agent's maximum capacity.
Description
BACKGROUND

Contact centers, also referred to as “call centers”, in which incoming communications are routed to agents, are well known. FIG. 1 is an example system architecture of a cloud-based contact center platform. Customers 110, i.e., parties originating incoming communications to a contact center, interact with the contact center 150 using voice, email, text, web, and other channel, interfaces to communicate with the agents 120 through a network 130 and one or more of text, chat, voice, or multimedia channels, for example. Note that the term “customer”, as used herein, refers to a party contacting the contact center for service, information, or the like and includes actual purchasers, potential purchasers, and other parties.


Contact center 150 includes modules for the routing communications from customers 110 to agents 120 for the contact center 150. There modules are referred to herein as the contact routing system 140. The contact routing system 140 could be any of a contact center as a service (CCaS) system, an automated call distributor (ACD) system, or a case system, for example.


The agents 120 may be remote from the contact center 150 and handle communications also referred to as “conversations” herein) with customers 110 on behalf of an enterprise. The agents 120 may utilize devices, such as but not limited to, work stations, desktop computers, laptops, telephones, a mobile smartphone and/or a tablet. Similarly, customers 110 may communicate using a plurality of devices, including but not limited to, a telephone, a mobile smartphone, a tablet, a laptop, a desktop computer, or other devices. For example, telephone communication may traverse networks such as a public switched telephone networks (PSTN), Voice over Internet Protocol (VoIP) telephony (via the Internet), a Wide Area Network (WAN) or a Large Area Network (LAN). The network types are provided by way of example and are not intended to limit types of networks used for communications.


The agents 120 may be assigned to one or more “queues” representing call categories and/or agent skill levels. The agents 120 assigned to a queue may handle communications that are placed in the queue by the contact routing system 140. For example, there may be queues associated with a language (e.g., English or Chinese), topic (e.g., technical support or billing), or a particular country of origin. When a communication is received by the contact routing system 140, the communication may be placed in a relevant queue, and one of the agents 120 associated with the relevant queue may handle the communication. The communications may be assigned to an agent (“push communications”) or selected by the agent out of the queue (“pull communications”).


The agents 120 may be further organized into one or more teams. The agents 120 may be organized into teams based on a variety of factors including, but not limited to, skills, location, experience, assigned queues, associated or assigned customers 110, and shift. Other factors may be used to assign agents 120 to teams.


A queue can have a routing method/rule associated therewith by which the contact routing system 140 routs communications in that queue to specific agents. Known routing methods include standard, predictive routing, and bullseye routing. Standard routing sends interactions to agents based on the queue. “Bullseye” routing also sends interactions to agents according to the queue, but also includes expansion parameters that adjust the routing target pool over time. Predictive routing applies machine learning to analyze historical contact center data and predict the best matchup between available agents and incoming communications based on the historical contact center data. However, in all of these routing techniques there are instances where specific agents are often overburdened while other agents are not fully utilized.


SUMMARY OF THE INVENTION

The disclosed implementations route communications based on the ability of agents to handle to specific types of communications at the specific time of the communication by quantifying agent capacity and how incoming communications will affect that capacity. A first aspect is a method for routing communications within a contact center computing system, the method comprising: receiving a designated communication, the communication having an associated weighting value; placing the communication into at least one queue, the at least one queue corresponding to agent skills; receiving a current occupancy score for each of multiple agents in the queue, wherein the current occupancy score for each agent is based on weighting values of communications being handled by the agent; receiving a maximum capacity score for each of the multiple agents in the queue, wherein the maximum capacity score for each agent is based on the ability of that agent to handle communications through various channels; and routing the designated communication to a selected agent of the multiple agents, wherein the selected agent is an agent of the multiple agents who has a current occupancy score that is lower than a maximum capacity score for that agent.


A second aspect of the disclosed implementations is a computing system for routing communications within a contact center computing system, the system comprising: at least one computer hardware processor; and at least one memory device having code stored thereon which, when executed by the at least one computer hardware processor, cause the at least one computer hardware processor to carry out the steps of: receiving a designated communication, the communication having an associated weighting value; placing the communication into at least one queue, the at least one queue corresponding to agent skills; receiving a current occupancy score for each of multiple agents in the queue, wherein the current occupancy score for each agent is based on weighting values of communications being handled by the agent; receiving a maximum capacity score for each of the multiple agents in the queue, wherein the maximum capacity score for each agent is based on the ability of that agent to handle communications through various channels; and routing the designated communication to a selected agent of the multiple agents, wherein the selected agent is an agent of the multiple agents who has a current occupancy score that is lower than a maximum capacity score for that agent.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing summary, as well as the following detailed description of the invention, will be better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there are shown in the appended drawings various illustrative embodiments. It should be understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown. In the drawings:



FIG. 1 is a block diagram of a contact center platform.



FIG. 2 is a flow diagram of call routing to queues and call assignment to agents based on capacity.



FIG. 3 is a flowchart of a communication routing method in accordance with disclosed implementations.



FIG. 4 is a schematic diagram of a computing system for routing communications in accordance with disclosed implementations.



FIG. 5 is a chart showing an example of logic for configuring a computing system for routing communications in accordance with disclosed implementations.





DETAILED DESCRIPTION

It is known to consider agent utilization when routing communications. For example, some known implementations indicate the maximum number of concurrent interactions that a contact can assign to an agent. Interactions include voice (calls), chats, emails, messages, and callbacks. for example, it could be deemed that an agent can handle at one time: 1 call, Up to 4 chats, 1 email, 1 message, and 1 callback. An administrator can specify the maximum number of interactions that agents handle simultaneously for each interaction type. Administrators can also designate the interaction types that can interrupt, or alert, agents who handle other interaction types. For example, if an agent is working on an email, then the agent can be prompted to answer an incoming call.


However, such system will continue to route communications to an agent until the agent has reached the maximum number of each type of communication. Accordingly, such systems still result in excessive wait times for certain communications. For example, if an agent has less than a maximum number of chats, emails, messages and callbacks, the agent will still be routed calls even though another agent may have greater capacity. In other words, conventional systems are directed merely to limiting each agent to a maximum predetermined capacity of communications at any specific time but do not address even distribution of communications amongst agents.


Disclosed implementations provide a method and apparatus for quantifying the total concurrent capacity of each agent and for assigning communications to an agent that has the most available capacity at the time of routing of a communication. Accordingly, agents can be utilized based on their total and available capacity. As shown in FIG. 2, routing rules are applied to assign communications to queues. This assignment can be accomplished in a conventional manner. The queues can correspond to a specific customer need such as the language spoken by the customer, or the content of the customer need. Once assigned to a queue, communications can be routed to agents in that queue based on agent presence and capacity. Disclosed implementations quantify agent capacity and “occupancy” to allow routing of communications in a manner which enhances the efficiency of handling the communications in the call center.


The routing system can address both agent capacity and agent occupancy. “Occupancy” is the portion, such as percentage, of an agent's capacity that is currently being utilized. An agent's status (e.g., available or not available) can be based on occupancy. Again, “capacity” refers to the maximum permitted workload of an agent. The table below is an example of agent total capacity in accordance with the weighting values above. In this example, a maximum capacity value for each agent can be defined as a constant, for example 100. Then a weight value is associated with each communication channel. For example, a voice communication can have a weight value of 51, a chat communication can have a weight value of 10, an SMS communication can have a weight value of 4, and an email communication can have a weight of 4. This allows determination of how many of each communication a specific agent, or group of agents, can handle at one time as well as the relative occupancy of each agent. Agents can be assigned communications as long as the assignment will not increase and agent occupancy score to a value above that agent's maximum capacity score.



















Total Capacity
100
Maximum



Voice Capacity
51
 1 voice call



Chat Capacity
30
 3 chats



SMS Capacity
5
20 SMSs



Email Capacity
5
20 emails










Note that the voice weight value is set as more than half of the total capacity (51 out of 100 in this example) so that an agent will never be assigned two synchronous voice communications at the same time. In this example, an agent could handle, for example, any of the workloads below.


1. 3 chats, 1 email, and 1 SMS=30+4+4=38


2. 2 chats, 8 emails=8+32=40


3. 2 chats, 8 SMSs=20+32=52


4. 1 voice call, 1 chat, 2 emails and 1 SMS=51+10+8+4=73


5. 1 voice call and 9 emails=51+36=87


6. 1 voice call and 9 SMSs=51+36=87


7. 1 voice call, 5 emails and 4 SMSs=51+20+16=87


Note that each workload example above results in a occupancy score that is less than the maximum capacity score (100 in this example). Further, assuming that each workload above corresponds to the workload of a respective agent in the same queue, a communication in that queue can be directed to the agent with workload 1 because the occupancy score of agent 1 is the lowest, i.e. agent 1 has the greatest capacity at the relevant time. It can be seen that such a capacity mechanism is much more efficient than known mechanisms that merely enforce a capacity of each communication channel of an agent. For example, assuming that the agent with workload 2 above had a fixed maximum of 8 emails, 2 chats and one voice call, under the conventional capacity mechanism, if an email communication came into the queue, it would not be assigned to the agent event though the agent has significant remaining capacity (60 out of 100 in this example).


An administrator can define the exact weight for each channel. Other rules can also be implemented. For example, chat ringing can be prohibited while an agent is on a voice communication (even if the agent has enough capacity to receive chat) because it might be too disturbing for the agent that is on an ongoing voice call. As another example, a maximum number of conversations per channel might also be set in some use cases.


In other implementations, there can be the possibility of defining the total capacity per team or queue. Some teams might have higher experience, and therefore they can handle more concurrent work. With the ability to set different capacity per teams/queues, the admin can control the workload that comes to each group of agents with great precision.


Administrators will be able to set a default agent capacity per account and also define the weight for each activity. A calculator/simulator can provide the agent communication capacities. For example, “with these settings agent A will be able to receive 1 voice and X chats at the same time”. Preferably, voice communications are the only activity that, in and of itself, renders an agent unavailable, and thus voice communications should each represent more than 50% of the agent capacity so that the communication routing/assignment system doesn't assign 2 concurrent voice communications to the same agent. SMS and Email can be assigned and/or pulled by each agent in a conventional manner. Agents will be able to more efficiently receive more than one chat and, if the administrator defines as such, receive voice communications at the same time as SMS, Email and other communications.


For illustrative purposes, some examples of agent capacity use cases are set forth below. Table 1 below illustrates an example of communication routing logic when an agent is not fully occupied. In this example: Agent Capacity=100; Voice Comm. score=51; and Chat Comm. score=10). As illustrated in row 1 of table 1, when there is an incoming voice communication it will not be assigned to the agent if the agent is already handling a voice communication (because the resulting occupancy score would be 102, which is greater than the preset maximum capacity 100). However, also as illustrated in row 1 the incoming voice communication can be assigned to the agent if the agent is only handling a single chat communication (because the resulting occupancy score would be 61, which is less than the capacity 100). Note that the agent occupancy can stay the same through all phases of a communication (such as wrap-up) or it can be adjusted by phase. For example, occupancy could be reduced to 49 during a wrap of a voice communication to allow the agent to be assigned another voice communication during the wrap up. As shown in row 3, When an agent is currently handling a voice communication or a chat communication, they can pull or be assigned a chat communication because the result would be an occupancy score that is less than the agent capacity of 100). As show in row 4, the agent ordinarily cannot be assigned of pull a voice communication when already handling a voice communication but can pull or be assigned the voice communication when currently handling only a chat communication.











TABLE 1






Agent is Handling
Agent is Handling



Voice Comm.
Chat Comm.







1. Incoming Voice
NOT POSSIBLE
POSSIBLE











Comm.
Occupancy:
51
Occupancy:
10



Post-Occupancy:
102
Post-Occupancy:
61









2. Incoming Chat
POSSIBLE
POSSIBLE











Comm.
Occupancy:
51
Occupancy:
10



Post-Occupancy:
61
Post-Occupancy:
20









3. Pull Chat
POSSIBLE
POSSIBLE











Comm.
Occupancy:
51
Occupancy:
10



Post-Occupancy:
61
Post-Occupancy:
20









4. Pull Voice
NOT POSSIBLE
POSSIBLE











Comm.
Occupancy:
51
Occupancy:
10



Post-Occupancy:
102
Post-Occupancy:
51









Table 2 illustrates another example of capacity based call routing logic. In this example, an incoming chat is weighted higher than a pull chat because agents have control over when to take pull chats and thus might feel comfortable pulling a chat at times when they are otherwise busy. In this example, agent capacity is 100, a voice communication is 100 and a Chat is 100. A pulled chat however is 10.











TABLE 2






Agent is Handling
Agent is Handling



Voice Comm.
Chat Comm.







1. Incoming Voice
NOT POSSIBLE
POSSIBLE











Comm.
Occupancy:
100
Occupancy:
100



Post-Occupancy:
200
Post-Occupancy:
200









2. Incoming Chat
NOT POSSIBLE
NOT POSSIBLE











Comm.
Occupancy:
100
Occupancy:
100



Post-Occupancy:
200
Post-Occupancy:
200









3. Pull Chat
POSSIBLE
NOT POSSIBLE











Comm.
Occupancy:
51
Occupancy:
100



Post-Occupancy:
61
Post-Occupancy:
110









4. Pull Voice
NOT POSSIBLE
NOT POSSIBLE











Comm.
Occupancy:
51
Occupancy:
100



Post-Occupancy:
102
Post-Occupancy:
200









The capacity calculation above can be applied to scenarios in which agents transfer calls back to a queue or transfer calls directly to other agents. All communications, regardless of how they got to an agent, can have a weighting. If Agent 1 transfers a communication to a specific queue, the occupancy of Agent 1 will decrease based on the capacity score of the communication. If Agent 1 transfers a communication to a specific agent (Agent 2), the occupancy of Agent 1 occupancy will decrease and the occupancy of Agent 2 will increase.


Since, by definition, “pull” communications are taken at the behest of the agent, pulled communications can be weighted to have a different effect on the occupancy of an agent. Under the assumption that only communications pushed to, as opposed to pulled by, an agent affect occupancy, if Agent 1 transfers a pushed communication to a specific queue, the occupancy of Agent 1 occupancy will decrease. However, under this assumption, if Agent 1 transfers a pulled conversation to a specific queue, the occupancy of Agent 1 remains the same. Similar, under this assumption, if Agent 1 transfers a pushed communication to a specific agent (Agent 2), the occupancy of Agent 1 will decrease and the occupancy of Agent 2 will increase. However, if Agent 1 transfers a pulled communication to Agent 2, the occupancy of Agent 1 remains the same while the occupancy of Agent 2 will increase. Alternatively, pulled communications could have a non-zero weighting that is lower than pushed communications.



FIG. 3 illustrates a process for routing a communication in accordance with disclosed implementations. At 302, a designated communication is received y the contact center, the communication having an associated weighting value determined in the manner described herein. At 304, the communication is assigned to at least one queue which corresponds to a requisite set of agent skills. at 306, a current occupancy score for each of multiple agents in the queue is received, wherein the current occupancy score for each agent is based on weighting values of communications being handled by the agent, as described herein. At 308, a maximum capacity score for each of the multiple agents in the queue is received, wherein the maximum capacity score for each agent is based on the ability of that agent to handle communications through various channels. At 310, the communication is routed to a selected agent of the multiple agents. The selected agent is an agent of the multiple agents who has a current occupancy score that is lower than a maximum capacity score for that agent.



FIG. 4 is a schematic representation of a computing system that embodies routing system 140′, which is similar to routing system 140 of FIG. 1, but which operates in accordance with disclosed implementations. Routing system 140′ include memory 420 and processor 430. Memory 420 stores code which, when executed by processor 460 can accomplish the method of FIG. 3. Each code portion includes instructions which, when executed by processor 430 comprise a module that accomplishes a step of the method of FIG. 3. The code portions include code portion 402 corresponding to step 302 of FIG. 3, code portion 404 corresponding to step 304 of FIG. 3, code portion 406 corresponding to step 306 of FIG. 3, code portion 4082 corresponding to step 308 of FIG. 3, and code portion 410 corresponding to step 310 of FIG. 3. Routing system 140′ is illustrated as being part of contact center 150. However, routing system 140′ can be separate form contact center 150 and provide routing of communications for contact center 150 as a service, through a network and appropriate APIs and protocols.


In addition to agent capacity and occupancy, other rules can be applied to manage the assignment of communications to agents. For example, there can be a limit on the total number of communications for each channel that is assigned to a particular agent (such as 5 texts and 3 instant messages. Further, a total capacity per team of agents or per queue can be defined. For example, some teams might have higher experience, and therefore they can handle more concurrent work. This allows workload to be controlled more accurately and thus provides a higher customer service level.


As discussed above, the occupancy and capacity of agents is defined as a score that can be used amongst different communications in different channels or other tasks assigned to an agent. For example, a required training video could have a weighting equal to 100% of the agent maximum capacity to ensure that the agent provides their full attention to the video. Each agent's capacity can be defined based on that agent's skills and experience. For example, expert agents can have higher capacity score than a trainee or temporary/contractor agents.


The occupancy score is shared between all channels according to the weighting values of communications and tasks specific characteristics like the channel, synchronous vs asynchronous communication or tasks, or other factors. It can be seen that a communication is assigned a weighting value to represent the effort and/or level of attention required to handle the communication. The weighting value of a communication can be determined by an Administrator based on the relevance that each factor has on the business logic. The weighting value can vary based on:

    • the channel of the communication;
    • the queue that the communication was placed in;
    • the agent who will be handling the communication;
    • the phase of the conversation (e.g., offer phase, conversation phase or wrap-up) the status of the conversation (e.g., if the agent is waiting for a reply from the contact or if the contact is waiting for a reply from the agent);
    • conversation direction (e.g., inbound (the customer has reached out to the contact center) or outbound (the agent has started a conversation with the customer); and/or
    • offer type (e.g., push (when it interrupts the agent—used in more synchronous communications) or pull (when the conversation is sent to an Inbox and the agent can pull/select the conversation—used in more asynchronous communications).


The disclosed embodiments allow agents to be assigned communications and tasks that have higher weights, but still have capacity for other communications and tasks with lower weights, increasing the productivity and efficiency of the contact center. Further, agents can manually pick (pull) communications with the visibility of the weighting value of the communication and the agent's current occupancy score. Therefore, agents are better able to manage their own workload.


Once an agent's capacity score reaches the maximum, the agent won't receive any pushed communications, which helps the agent to focus on current communications. However, the administrator has the option to allow agents to handle the urgent conversations even if the agent's occupancy score exceeds the capacity. Further, agent occupancy scores can be reported and used to evaluate the agent performance and desired adjustments to the agent capacity and communication weightings.


It is desirable that new communications are assigned to agents based on the capacity of each agent, with communications being assigned to an agent with the highest remaining capacity available, i.e. the lowest occupancy. Supervisors can monitor the average available capacity per agent to determine if some agents' capacity score can be raised, i.e., the agent can handle more conversations simultaneously, or if agents' capacity scores are correct or too high. Artificial intelligence can be used to make suggestions on the best capacity score for each agent. It is further possible to adjust the weighting value of a communication based on the handling time of that conversation compared to the average handling time of this type of conversation.



FIG. 5 illustrates a logic flow for making capacity suggestions. As shown in FIG. 5, if an agent's capacity is greater than a threshold (1), 50% in this example, and the agent's rejection rate is greater than a threshold (2), 25% in this example, the capacity of the agent can be adjusted downward. On the other hand, if the agent's capacity is greater than a threshold (1), 50% in this example, and the agent's rejection rate is not greater than a threshold (3), 25% in this example, communicating assignment configurations might need adjustment because the agent is receiving low communication traffic, i.e., the agent is underutilized.


Further, if an agent's capacity is not greater than a threshold (4), 50% in this example, and the agent's rejection rate is greater than a threshold (5), 25% in this example, the capacity of the agent can be adjusted downward. However, if the agent's capacity is not greater than a threshold (4), 50% in this example, and the agent's rejection rate is not greater than a threshold (6), 25% in this example, The agent capacity might be able to be adjusted upward.


Routing can also be accomplished based on capacity per channel. For example, if a new live chat is to be assigned, the live chat communication can be routed to the agent with the highest current capacity for live chats at that time (maximum capacity for live chats—current occupancy or live chats).


It will be appreciated by those skilled in the art that changes could be made to the embodiments described above without departing from the broad inventive concept thereof. It is understood, therefore, that this invention is not limited to the particular embodiments disclosed, but it is intended to cover modifications within the spirit and scope of the present invention as defined by the appended claims.

Claims
  • 1. A method for increasing the efficiency of connecting communications in a contact center computing system, the method comprising: receiving a designated communication, the communication having an associated weighting value;placing the communication into at least one queue, the at least one queue corresponding to agent skills;receiving a current occupancy score for each of multiple agents in the queue, wherein the current occupancy score for each agent is based on weighting values of communications being handled by the agent;receiving a maximum capacity score for each of the multiple agents in the queue, wherein the maximum capacity score for each agent is based on the ability of that agent to handle communications through various channels; andconnecting the designated communication to a selected agent of the multiple agents, wherein the selected agent is an agent of the multiple agents who has a current occupancy score that is lower than a maximum capacity score for that agent, whereby average time between the receiving a communication and the connecting the designated communication to a selected agent is reduced.
  • 2. The method of claim 1, wherein the selected agent is an agent of the multiple agents who has a current capacity score that is lower than a maximum capacity score for that agent by the largest value as compared to other agents of the multiple agents.
  • 3. The method of claim 1, wherein the selected agent is an agent of the multiple agents who has a current capacity score that is lower than a maximum capacity score for that agent by the largest percentage as compared to other agents of the multiple agents.
  • 4. The method of claim 1, wherein the current capacity score of an agent is a total of the weighting value of each communication currently being handled by that agent.
  • 5. The method of claim 1, wherein the weighting value of the designated communication plus the current capacity score of the selected agent is less than or equal to the maximum capacity score of the selected agent.
  • 6. The method of claim 1, wherein the routing step is also based on the maximum capacity score of the multiple agents in the queue in combination.
  • 7. The method of claim 1, wherein the weighting value of a communication, the current capacity score, and the maximum capacity score are scalar values.
  • 8. The method of claim 1, wherein the current capacity score for each agent is based on weighting values of communications having different channels being handled by the agent.
  • 9. The method of claim 8, wherein the capacity score is shared between all channels according to the weighting values of communications of various channels.
  • 10. The method of claim 1, wherein the current capacity score for each agent is also based on the abilities of the agent.
  • 11. The method of claim 1 wherein the weighting value of each communication being handled by the agent is based on at least one of the following: the channel of the communication;the queue that the communication was placed in;a phase of the communication;a direction of the communication; and/oran offer type of the communication.
  • 12. A computing system for increasing the efficiency of connecting communications within a contact center, the system comprising: at least one computer hardware processor; andat least one memory device having code stored thereon which, when executed by the at least one computer hardware processor, cause the at least one computer hardware processor to carry out the steps of:receiving a designated communication, the communication having an associated weighting value;placing the communication into at least one queue, the at least one queue corresponding to agent skills;receiving a current occupancy score for each of multiple agents in the queue, wherein the current occupancy score for each agent is based on weighting values of communications being handled by the agent;receiving a maximum capacity score for each of the multiple agents in the queue, wherein the maximum capacity score for each agent is based on the ability of that agent to handle communications through various channels; andconnecting the designated communication to a selected agent of the multiple agents, wherein the selected agent is an agent of the multiple agents who has a current occupancy score that is lower than a maximum capacity score for that agent, whereby average time between the receiving a communication and the connecting the designated communication to a selected agent is reduced.
  • 13. The system of claim 12, wherein the selected agent is an agent of the multiple agents who has a current capacity score that is lower than a maximum capacity score for that agent by the largest value as compared to other agents of the multiple agents.
  • 14. The system of claim 12, wherein the selected agent is an agent of the multiple agents who has a current capacity score that is lower than a maximum capacity score for that agent by the largest percentage as compared to other agents of the multiple agents.
  • 15. The system of claim 12, wherein the current capacity score of an agent is a total of the weighting value of each communication currently being handled by that agent.
  • 16. The system of claim 12, wherein the weighting value of the designated communication plus the current capacity score of the selected agent is less than or equal to the maximum capacity score of the selected agent.
  • 17. The system of claim 12, wherein the routing step is also based on the maximum capacity score of the multiple agents in the queue in combination.
  • 18. The system of claim 12, wherein the weighting value of a communication, the current capacity score, and the maximum capacity score are scalar values.
  • 19. The system of claim 12, wherein the current capacity score for each agent is based on weighting values of communications having different channels being handled by the agent.
  • 20. The system of claim 19, wherein the capacity score is shared between all channels according to the weighting values of communications of various channels.
  • 21. The system of claim 12, wherein the current capacity score for each agent is also based on the abilities of the agent.
  • 22. The system of claim 12 wherein the weighting value of each communication being handled by the agent is based on at least one of the following: the channel of the communication;the queue that the communication was placed in;a phase of the communication;a direction of the communication; and/oran offer type of the communication.
US Referenced Citations (623)
Number Name Date Kind
5862203 Wulkan et al. Jan 1999 A
5897616 Kanevsky et al. Apr 1999 A
5966691 Kibre et al. Oct 1999 A
5970124 Csaszar et al. Oct 1999 A
6100891 Thorne Aug 2000 A
6128415 Hultgren et al. Oct 2000 A
6163607 Bogart et al. Dec 2000 A
6230197 Beck et al. May 2001 B1
6263057 Silverman Jul 2001 B1
6345093 Lee et al. Feb 2002 B1
6385584 McAlister et al. May 2002 B1
6411687 Bohacek et al. Jun 2002 B1
6493695 Pickering et al. Dec 2002 B1
6560222 Pounds et al. May 2003 B1
6587831 O'Brien Jul 2003 B1
6639982 Stuart et al. Oct 2003 B1
6721416 Farrell Apr 2004 B1
6754333 Flockhart et al. Jun 2004 B1
6859776 Cohen et al. Feb 2005 B1
6970829 Leamon Nov 2005 B1
7023979 Wu et al. Apr 2006 B1
7076047 Brennan et al. Jul 2006 B1
7110525 Heller et al. Sep 2006 B1
7209475 Shaffer et al. Apr 2007 B1
7274787 Schoeneberger Sep 2007 B1
7292689 Odinak et al. Nov 2007 B2
7343406 Buonanno et al. Mar 2008 B1
7372952 Wu et al. May 2008 B1
7382773 Schoeneberger et al. Jun 2008 B2
7409336 Pak et al. Aug 2008 B2
7426268 Walker et al. Sep 2008 B2
7466334 Baba Dec 2008 B1
7537154 Ramachandran May 2009 B2
7634422 Andre et al. Dec 2009 B1
7657263 Chahrouri Feb 2010 B1
7672746 Hamilton et al. Mar 2010 B1
7672845 Beranek et al. Mar 2010 B2
7676034 Wu et al. Mar 2010 B1
7698163 Reed et al. Apr 2010 B2
7752159 Nelken et al. Jul 2010 B2
7774790 Jirman et al. Aug 2010 B1
7788286 Nourbakhsh et al. Aug 2010 B2
7853006 Fama et al. Dec 2010 B1
7864946 Fama et al. Jan 2011 B1
7869998 Di Fabbrizio et al. Jan 2011 B1
7949123 Flockhart et al. May 2011 B1
7953219 Freedman et al. May 2011 B2
7966369 Briere et al. Jun 2011 B1
8060394 Woodings et al. Nov 2011 B2
8073129 Kalavar Dec 2011 B1
8116446 Kalavar Feb 2012 B1
8135125 Sidhu et al. Mar 2012 B2
8160233 Keren et al. Apr 2012 B2
8184782 Vatland et al. May 2012 B1
8223951 Edelhaus et al. Jul 2012 B1
8229761 Backhaus et al. Jul 2012 B2
8243896 Rae Aug 2012 B1
8300798 Wu et al. Oct 2012 B1
8369338 Peng et al. Feb 2013 B1
8370155 Byrd et al. Feb 2013 B2
8391466 Noble, Jr. Mar 2013 B1
8447279 Peng et al. May 2013 B1
8488769 Noble et al. Jul 2013 B1
8526576 Deich et al. Sep 2013 B1
8535059 Noble, Jr. et al. Sep 2013 B1
8583466 Margulies et al. Nov 2013 B2
8594306 Laredo et al. Nov 2013 B2
8626137 Devitt et al. Jan 2014 B1
8635226 Chang et al. Jan 2014 B2
8644489 Noble et al. Feb 2014 B1
8671020 Morrison et al. Mar 2014 B1
8688557 Rose et al. Apr 2014 B2
8738739 Makar et al. May 2014 B2
8767948 Riahi et al. Jul 2014 B1
8811597 Hackbarth et al. Aug 2014 B1
8861691 De et al. Oct 2014 B1
8869245 Ranganathan et al. Oct 2014 B2
8898219 Ricci Nov 2014 B2
8898290 Siemsgluess Nov 2014 B2
8909693 Frissora et al. Dec 2014 B2
8935172 Noble, Jr. et al. Jan 2015 B1
8996509 Sundaram Mar 2015 B1
9020142 Kosiba et al. Apr 2015 B2
9026431 Moreno Mengibar et al. May 2015 B1
9060057 Danis Jun 2015 B1
9065915 Lillard et al. Jun 2015 B1
9082094 Etter et al. Jul 2015 B1
9100483 Snedden Aug 2015 B1
9117450 Cook et al. Aug 2015 B2
9123009 Etter et al. Sep 2015 B1
9137366 Medina et al. Sep 2015 B2
9152737 Micali et al. Oct 2015 B1
9160853 Daddi et al. Oct 2015 B1
9178999 Hegde et al. Nov 2015 B1
9185222 Govindarajan et al. Nov 2015 B1
9237232 Williams et al. Jan 2016 B1
9280754 Schwartz et al. Mar 2016 B1
9286413 Coates et al. Mar 2016 B1
9300801 Warford et al. Mar 2016 B1
9319524 Webster Apr 2016 B1
9386152 Riahi et al. Jul 2016 B2
9397985 Seger et al. Jul 2016 B1
9426291 Ouimette et al. Aug 2016 B1
9473637 Venkatapathy et al. Oct 2016 B1
9514463 Grigg et al. Dec 2016 B2
9595049 Showers et al. Mar 2017 B2
9609131 Placiakis et al. Mar 2017 B2
9674361 Ristock et al. Jun 2017 B2
9679265 Schwartz et al. Jun 2017 B1
9774731 Haltom et al. Sep 2017 B1
9787840 Neuer, III et al. Oct 2017 B1
9813495 Van et al. Nov 2017 B1
9823949 Ristock et al. Nov 2017 B2
9883037 Lewis et al. Jan 2018 B1
9894478 Deluca et al. Feb 2018 B1
9930181 Moran et al. Mar 2018 B1
9955021 Liu et al. Apr 2018 B1
RE46852 Petrovykh May 2018 E
9998596 Dunmire et al. Jun 2018 B1
10009465 Fang et al. Jun 2018 B1
10038788 Khalatian Jul 2018 B1
10044862 Cai et al. Aug 2018 B1
10079939 Bostick et al. Sep 2018 B1
10085073 Ray et al. Sep 2018 B2
10101974 Ristock et al. Oct 2018 B2
10115065 Fama et al. Oct 2018 B1
10135973 Algard et al. Nov 2018 B2
10154138 Te Booij et al. Dec 2018 B2
10194027 Daddi et al. Jan 2019 B1
10235999 Naughton et al. Mar 2019 B1
10241752 Lemay et al. Mar 2019 B2
10242019 Shan et al. Mar 2019 B1
10276170 Gruber et al. Apr 2019 B2
10277745 Araujo et al. Apr 2019 B1
10290017 Traasdahl et al. May 2019 B2
10331402 Spector et al. Jun 2019 B1
10380246 Clark et al. Aug 2019 B2
10440180 Jayapalan et al. Oct 2019 B1
10445742 Prendki et al. Oct 2019 B2
10460728 Anbazhagan et al. Oct 2019 B2
10497361 Rule et al. Dec 2019 B1
10554590 Cabrera-Cordon et al. Feb 2020 B2
10554817 Sullivan et al. Feb 2020 B1
10572879 Hunter et al. Feb 2020 B1
10574822 Sheshaiahgari et al. Feb 2020 B1
10601992 Dwyer et al. Mar 2020 B2
10623572 Copeland Apr 2020 B1
10635973 Dirac et al. Apr 2020 B1
10636425 Naughton et al. Apr 2020 B2
10699303 Ismail et al. Jun 2020 B2
10715648 Vashisht et al. Jul 2020 B1
10718031 Wu et al. Jul 2020 B1
10728384 Channakeshava et al. Jul 2020 B1
10735586 Johnston Aug 2020 B1
10742806 Kotak Aug 2020 B2
10750019 Petrovykh et al. Aug 2020 B1
10783568 Chandra et al. Sep 2020 B1
10789956 Dube Sep 2020 B1
10803865 Naughton et al. Oct 2020 B2
10812654 Wozniak Oct 2020 B2
10812655 Adibi et al. Oct 2020 B1
10827069 Paiva Nov 2020 B1
10827071 Adibi et al. Nov 2020 B1
10839432 Konig et al. Nov 2020 B1
10841425 Langley et al. Nov 2020 B1
10855844 Smith et al. Dec 2020 B1
10861031 Sullivan et al. Dec 2020 B2
10878479 Wu et al. Dec 2020 B2
10943589 Naughton et al. Mar 2021 B2
10970682 Aykin Apr 2021 B1
11017176 Ayers et al. May 2021 B2
11089158 Holland et al. Aug 2021 B1
20010008999 Bull Jul 2001 A1
20010024497 Campbell Sep 2001 A1
20010054072 Discolo et al. Dec 2001 A1
20020019737 Stuart et al. Feb 2002 A1
20020029272 Weller Mar 2002 A1
20020034304 Yang Mar 2002 A1
20020038420 Collins et al. Mar 2002 A1
20020067823 Walker et al. Jun 2002 A1
20020143599 Nourbakhsh et al. Oct 2002 A1
20020169664 Walker et al. Nov 2002 A1
20020174182 Wilkinson et al. Nov 2002 A1
20020181689 Rupe et al. Dec 2002 A1
20030007621 Graves et al. Jan 2003 A1
20030009520 Nourbakhsh et al. Jan 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030061068 Curtis Mar 2003 A1
20030112927 Brown et al. Jun 2003 A1
20030126136 Omoigui Jul 2003 A1
20030167167 Gong Sep 2003 A1
20040044585 Franco Mar 2004 A1
20040044664 Cash et al. Mar 2004 A1
20040062364 Dezonno et al. Apr 2004 A1
20040078257 Schweitzer et al. Apr 2004 A1
20040098274 Dezonno et al. May 2004 A1
20040103051 Reed et al. May 2004 A1
20040141508 Schoeneberger et al. Jul 2004 A1
20040162724 Hill et al. Aug 2004 A1
20040162753 Vogel et al. Aug 2004 A1
20040174980 Knott et al. Sep 2004 A1
20040215451 MacLeod Oct 2004 A1
20050033957 Enokida Feb 2005 A1
20050043986 Mcconnell et al. Feb 2005 A1
20050063365 Mathew et al. Mar 2005 A1
20050071178 Beckstrom et al. Mar 2005 A1
20050105712 Williams et al. May 2005 A1
20050177368 Odinak et al. Aug 2005 A1
20050226220 Kilkki et al. Oct 2005 A1
20050228774 Ronnewinkel Oct 2005 A1
20050246511 Willman et al. Nov 2005 A1
20050271198 Chin et al. Dec 2005 A1
20060095575 Sureka et al. May 2006 A1
20060126818 Berger et al. Jun 2006 A1
20060153357 Acharya et al. Jul 2006 A1
20060166669 Claussen Jul 2006 A1
20060188086 Busey et al. Aug 2006 A1
20060209797 Anisimov et al. Sep 2006 A1
20060215831 Knott et al. Sep 2006 A1
20060229931 Fligler et al. Oct 2006 A1
20060256953 Pulaski et al. Nov 2006 A1
20060271361 Vora et al. Nov 2006 A1
20060274856 Dun et al. Dec 2006 A1
20060277108 Altberg et al. Dec 2006 A1
20070016565 Evans et al. Jan 2007 A1
20070036334 Culbertson et al. Feb 2007 A1
20070038499 Margulies et al. Feb 2007 A1
20070041519 Erhart et al. Feb 2007 A1
20070061183 Seetharaman et al. Mar 2007 A1
20070078725 Koszewski et al. Apr 2007 A1
20070121902 Stoica et al. May 2007 A1
20070121903 Moore, Jr. et al. May 2007 A1
20070136284 Cobb et al. Jun 2007 A1
20070155411 Morrison Jul 2007 A1
20070157021 Whitfield Jul 2007 A1
20070160188 Sharpe et al. Jul 2007 A1
20070162296 Altberg et al. Jul 2007 A1
20070198329 Lyerly et al. Aug 2007 A1
20070201636 Gilbert et al. Aug 2007 A1
20070263810 Sterns Nov 2007 A1
20070265990 Sidhu et al. Nov 2007 A1
20070269031 Honig et al. Nov 2007 A1
20070280460 Harris et al. Dec 2007 A1
20070287430 Hosain et al. Dec 2007 A1
20080002823 Fama et al. Jan 2008 A1
20080043976 Maximo et al. Feb 2008 A1
20080065902 Spohrer et al. Mar 2008 A1
20080095355 Mahalaha et al. Apr 2008 A1
20080126957 Tysowski et al. May 2008 A1
20080205620 Odinak et al. Aug 2008 A1
20080225872 Collins et al. Sep 2008 A1
20080254774 Lee Oct 2008 A1
20080255944 Shah et al. Oct 2008 A1
20080260138 Chen et al. Oct 2008 A1
20080288770 Kline et al. Nov 2008 A1
20080300955 Hamilton et al. Dec 2008 A1
20090018996 Hunt et al. Jan 2009 A1
20090080411 Lyman Mar 2009 A1
20090086945 Buchanan et al. Apr 2009 A1
20090086949 Caspi et al. Apr 2009 A1
20090086953 Vendrow Apr 2009 A1
20090110182 Knight, Jr. et al. Apr 2009 A1
20090171164 Jung et al. Jul 2009 A1
20090222551 Neely et al. Sep 2009 A1
20090228264 Williams et al. Sep 2009 A1
20090234710 Belgaied et al. Sep 2009 A1
20090234732 Zorman et al. Sep 2009 A1
20090245479 Surendran Oct 2009 A1
20090285384 Pollock et al. Nov 2009 A1
20090306981 Cromack et al. Dec 2009 A1
20090307052 Mankani et al. Dec 2009 A1
20100106568 Grimes Apr 2010 A1
20100114646 Mcilwain et al. May 2010 A1
20100189250 Williams et al. Jul 2010 A1
20100211515 Woodings et al. Aug 2010 A1
20100235341 Bennett Sep 2010 A1
20100250196 Lawler et al. Sep 2010 A1
20100262549 Kannan et al. Oct 2010 A1
20100266115 Fedorov et al. Oct 2010 A1
20100266116 Stolyar et al. Oct 2010 A1
20100274618 Byrd et al. Oct 2010 A1
20100287131 Church Nov 2010 A1
20100293033 Hall et al. Nov 2010 A1
20100299268 Guha et al. Nov 2010 A1
20100332287 Gates et al. Dec 2010 A1
20110014932 Estevez Jan 2011 A1
20110022461 Simeonov Jan 2011 A1
20110071870 Gong Mar 2011 A1
20110077994 Segev et al. Mar 2011 A1
20110082688 Kim et al. Apr 2011 A1
20110116618 Zyarko et al. May 2011 A1
20110125697 Erhart et al. May 2011 A1
20110143323 Cohen Jun 2011 A1
20110182283 Van et al. Jul 2011 A1
20110185293 Barnett et al. Jul 2011 A1
20110216897 Laredo et al. Sep 2011 A1
20110264581 Clyne Oct 2011 A1
20110267985 Wilkinson et al. Nov 2011 A1
20110286592 Nimmagadda Nov 2011 A1
20110288897 Erhart et al. Nov 2011 A1
20120046996 Shah et al. Feb 2012 A1
20120051537 Chishti et al. Mar 2012 A1
20120084217 Kohler et al. Apr 2012 A1
20120087486 Guerrero et al. Apr 2012 A1
20120095835 Makar et al. Apr 2012 A1
20120109830 Vogel May 2012 A1
20120257116 Hendrickson et al. Oct 2012 A1
20120265587 Kinkead Oct 2012 A1
20120290373 Ferzacca et al. Nov 2012 A1
20120321073 Flockhart et al. Dec 2012 A1
20130023235 Fan et al. Jan 2013 A1
20130073361 Silver Mar 2013 A1
20130085785 Rogers et al. Apr 2013 A1
20130090963 Sharma et al. Apr 2013 A1
20130124361 Bryson May 2013 A1
20130136252 Kosiba et al. May 2013 A1
20130223608 Flockhart et al. Aug 2013 A1
20130223610 Kohler et al. Aug 2013 A1
20130236002 Jennings et al. Sep 2013 A1
20130257877 Davis Oct 2013 A1
20130304581 Soroca et al. Nov 2013 A1
20130325972 Boston et al. Dec 2013 A1
20140012603 Scanlon et al. Jan 2014 A1
20140016762 Mitchell et al. Jan 2014 A1
20140039944 Humbert et al. Feb 2014 A1
20140039962 Nudd et al. Feb 2014 A1
20140067375 Wooters Mar 2014 A1
20140079195 Srivastava et al. Mar 2014 A1
20140079207 Zhakov et al. Mar 2014 A1
20140099916 Mallikarjunan et al. Apr 2014 A1
20140101261 Wu et al. Apr 2014 A1
20140136346 Teso May 2014 A1
20140140494 Zhakov May 2014 A1
20140143018 Nies et al. May 2014 A1
20140143249 Cazzanti et al. May 2014 A1
20140161241 Baranovsky et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140177819 Vymenets et al. Jun 2014 A1
20140188477 Zhang Jul 2014 A1
20140200988 Kassko et al. Jul 2014 A1
20140219132 Delveaux et al. Aug 2014 A1
20140219438 Brown et al. Aug 2014 A1
20140233719 Vyemenets et al. Aug 2014 A1
20140244712 Walters et al. Aug 2014 A1
20140254790 Shaffer et al. Sep 2014 A1
20140257908 Steiner et al. Sep 2014 A1
20140270108 Riahi et al. Sep 2014 A1
20140270138 Uba et al. Sep 2014 A1
20140270142 Bischoff et al. Sep 2014 A1
20140270145 Erhart et al. Sep 2014 A1
20140278605 Borucki et al. Sep 2014 A1
20140278649 Guerinik et al. Sep 2014 A1
20140279045 Shottan et al. Sep 2014 A1
20140279050 Makar et al. Sep 2014 A1
20140314225 Riahi et al. Oct 2014 A1
20140335480 Asenjo et al. Nov 2014 A1
20140372171 Martin et al. Dec 2014 A1
20140379424 Shroff Dec 2014 A1
20150006400 Eng et al. Jan 2015 A1
20150010134 Erel et al. Jan 2015 A1
20150012278 Metcalf Jan 2015 A1
20150016600 Desai et al. Jan 2015 A1
20150023484 Ni et al. Jan 2015 A1
20150030151 Bellini et al. Jan 2015 A1
20150030152 Waxman et al. Jan 2015 A1
20150051957 Griebeler et al. Feb 2015 A1
20150066632 Gonzalez et al. Mar 2015 A1
20150071418 Shaffer et al. Mar 2015 A1
20150078538 Jain Mar 2015 A1
20150100473 Manoharan et al. Apr 2015 A1
20150127400 Chan et al. May 2015 A1
20150127441 Feldman May 2015 A1
20150127677 Wang et al. May 2015 A1
20150142704 London May 2015 A1
20150172463 Quast et al. Jun 2015 A1
20150178371 Seth et al. Jun 2015 A1
20150195406 Dwyer et al. Jul 2015 A1
20150213454 Vedula Jul 2015 A1
20150215464 Shaffer et al. Jul 2015 A1
20150222751 Odinak et al. Aug 2015 A1
20150256677 Konig et al. Sep 2015 A1
20150262188 Franco Sep 2015 A1
20150262208 Bjontegard et al. Sep 2015 A1
20150269377 Gaddipati Sep 2015 A1
20150271334 Wawrzynowicz Sep 2015 A1
20150281445 Kumar et al. Oct 2015 A1
20150281449 Milstein et al. Oct 2015 A1
20150281450 Shapiro et al. Oct 2015 A1
20150281454 Milstein et al. Oct 2015 A1
20150287410 Mengibar et al. Oct 2015 A1
20150295788 Witzman et al. Oct 2015 A1
20150296081 Jeong Oct 2015 A1
20150334230 Volzke Nov 2015 A1
20150339446 Sperling et al. Nov 2015 A1
20150339620 Esposito et al. Nov 2015 A1
20150339769 Deoliveira et al. Nov 2015 A1
20150347900 Bell et al. Dec 2015 A1
20150350429 Kumar et al. Dec 2015 A1
20150350440 Steiner et al. Dec 2015 A1
20150350442 O'Connor Dec 2015 A1
20150350443 Kumar et al. Dec 2015 A1
20150379562 Spievak et al. Dec 2015 A1
20160026629 Clifford et al. Jan 2016 A1
20160034260 Ristock et al. Feb 2016 A1
20160034995 Williams et al. Feb 2016 A1
20160036981 Hollenberg et al. Feb 2016 A1
20160036983 Korolev et al. Feb 2016 A1
20160042419 Singh Feb 2016 A1
20160042749 Hirose Feb 2016 A1
20160055499 Hawkins et al. Feb 2016 A1
20160057284 Nagpal et al. Feb 2016 A1
20160065739 Brimshan et al. Mar 2016 A1
20160080567 Hooshiari et al. Mar 2016 A1
20160085891 Ter et al. Mar 2016 A1
20160112867 Martinez Apr 2016 A1
20160124937 Elhaddad May 2016 A1
20160125456 Wu et al. May 2016 A1
20160134624 Jacobson et al. May 2016 A1
20160140627 Moreau et al. May 2016 A1
20160150086 Pickford May 2016 A1
20160155080 Gnanasambandam et al. Jun 2016 A1
20160173692 Wicaksono et al. Jun 2016 A1
20160180381 Kaiser et al. Jun 2016 A1
20160191699 Agrawal et al. Jun 2016 A1
20160191709 Pullamplavil et al. Jun 2016 A1
20160191712 Bouzid et al. Jun 2016 A1
20160234386 Wawrzynowicz Aug 2016 A1
20160247165 Ryabchun et al. Aug 2016 A1
20160261747 Thirugnanasundaram et al. Aug 2016 A1
20160295018 Loftus et al. Oct 2016 A1
20160300573 Carbune et al. Oct 2016 A1
20160335576 Peng Nov 2016 A1
20160349960 Kumar et al. Dec 2016 A1
20160358611 Abel Dec 2016 A1
20160360033 Kocan Dec 2016 A1
20160378569 Ristock et al. Dec 2016 A1
20160381222 Ristock et al. Dec 2016 A1
20170004178 Ponting et al. Jan 2017 A1
20170006135 Siebel et al. Jan 2017 A1
20170006161 Riahi et al. Jan 2017 A9
20170011311 Backer et al. Jan 2017 A1
20170024762 Swaminathan Jan 2017 A1
20170032436 Disalvo et al. Feb 2017 A1
20170034226 Bostick et al. Feb 2017 A1
20170068436 Auer et al. Mar 2017 A1
20170068854 Markiewicz et al. Mar 2017 A1
20170098197 Yu et al. Apr 2017 A1
20170104875 Im et al. Apr 2017 A1
20170111505 Mcgann et al. Apr 2017 A1
20170111509 McGann et al. Apr 2017 A1
20170116173 Lev-Tov et al. Apr 2017 A1
20170118336 Tapuhi et al. Apr 2017 A1
20170132536 Goldstein et al. May 2017 A1
20170148073 Nomula et al. May 2017 A1
20170155766 Kumar et al. Jun 2017 A1
20170161439 Raduchel et al. Jun 2017 A1
20170162197 Cohen Jun 2017 A1
20170169325 McCord et al. Jun 2017 A1
20170207916 Luce et al. Jul 2017 A1
20170214795 Charlson Jul 2017 A1
20170220966 Wang Aug 2017 A1
20170223070 Lin Aug 2017 A1
20170236512 Williams et al. Aug 2017 A1
20170286774 Gaidon Oct 2017 A1
20170288866 Vanek et al. Oct 2017 A1
20170308794 Fischerstrom Oct 2017 A1
20170316386 Joshi et al. Nov 2017 A1
20170323344 Nigul Nov 2017 A1
20170337578 Chittilappilly et al. Nov 2017 A1
20170344754 Kumar et al. Nov 2017 A1
20170344988 Cusden et al. Nov 2017 A1
20170359421 Stoops et al. Dec 2017 A1
20170372436 Dalal et al. Dec 2017 A1
20180018705 Tognetti Jan 2018 A1
20180032997 Gordon et al. Feb 2018 A1
20180052664 Zhang et al. Feb 2018 A1
20180053401 Martin et al. Feb 2018 A1
20180054464 Zhang et al. Feb 2018 A1
20180060830 Abramovici et al. Mar 2018 A1
20180061256 Elchik et al. Mar 2018 A1
20180077088 Cabrera-Cordon et al. Mar 2018 A1
20180077250 Prasad et al. Mar 2018 A1
20180097910 D'Agostino et al. Apr 2018 A1
20180114234 Fighel Apr 2018 A1
20180121766 Mccord et al. May 2018 A1
20180137472 Gorzela et al. May 2018 A1
20180137555 Clausse et al. May 2018 A1
20180146093 Kumar et al. May 2018 A1
20180150749 Wu et al. May 2018 A1
20180152558 Chan et al. May 2018 A1
20180165062 Yoo et al. Jun 2018 A1
20180165691 Heater et al. Jun 2018 A1
20180165692 McCoy Jun 2018 A1
20180165723 Wright et al. Jun 2018 A1
20180174198 Wilkinson et al. Jun 2018 A1
20180189273 Campos et al. Jul 2018 A1
20180190144 Corelli et al. Jul 2018 A1
20180198917 Ristock et al. Jul 2018 A1
20180205825 Vymenets et al. Jul 2018 A1
20180248818 Zucker et al. Aug 2018 A1
20180260857 Kar et al. Sep 2018 A1
20180285423 Ciano et al. Oct 2018 A1
20180286000 Berry et al. Oct 2018 A1
20180293327 Miller et al. Oct 2018 A1
20180293532 Singh et al. Oct 2018 A1
20180300295 Maksak et al. Oct 2018 A1
20180300641 Donn et al. Oct 2018 A1
20180308072 Smith et al. Oct 2018 A1
20180309801 Rathod Oct 2018 A1
20180349858 Walker et al. Dec 2018 A1
20180361253 Grosso Dec 2018 A1
20180365651 Sreedhara et al. Dec 2018 A1
20180367672 Ristock et al. Dec 2018 A1
20180372486 Farniok et al. Dec 2018 A1
20180376002 Abraham Dec 2018 A1
20190013017 Kang et al. Jan 2019 A1
20190028587 Unitt et al. Jan 2019 A1
20190028588 Shinseki et al. Jan 2019 A1
20190037077 Konig et al. Jan 2019 A1
20190042988 Brown et al. Feb 2019 A1
20190043106 Talmor et al. Feb 2019 A1
20190058793 Konig et al. Feb 2019 A1
20190104092 Koohmarey et al. Apr 2019 A1
20190108834 Nelson et al. Apr 2019 A1
20190130329 Fama et al. May 2019 A1
20190132443 Munns et al. May 2019 A1
20190146647 Ramachandran et al. May 2019 A1
20190147045 Kim May 2019 A1
20190172291 Naseath Jun 2019 A1
20190180095 Ferguson et al. Jun 2019 A1
20190180747 Back et al. Jun 2019 A1
20190182383 Shaev et al. Jun 2019 A1
20190196676 Hillis et al. Jun 2019 A1
20190197568 Li et al. Jun 2019 A1
20190205389 Tripathi et al. Jul 2019 A1
20190236205 Jia et al. Aug 2019 A1
20190238680 Narayanan et al. Aug 2019 A1
20190253553 Chishti Aug 2019 A1
20190258825 Krishnamurthy Aug 2019 A1
20190287517 Green et al. Sep 2019 A1
20190295027 Dunne et al. Sep 2019 A1
20190306315 Portman et al. Oct 2019 A1
20190335038 Alonso Y Caloca et al. Oct 2019 A1
20190341030 Hammons et al. Nov 2019 A1
20190342450 Kulkarni et al. Nov 2019 A1
20190349477 Kotak Nov 2019 A1
20190377789 Jegannathan et al. Dec 2019 A1
20190378076 O'Gorman et al. Dec 2019 A1
20190385597 Katsamanis et al. Dec 2019 A1
20190386917 Malin Dec 2019 A1
20190392357 Surti et al. Dec 2019 A1
20190394333 Jiron et al. Dec 2019 A1
20200005375 Sharan et al. Jan 2020 A1
20200007680 Wozniak Jan 2020 A1
20200012697 Fan et al. Jan 2020 A1
20200012992 Chan et al. Jan 2020 A1
20200019893 Lu Jan 2020 A1
20200028968 Mendiratta et al. Jan 2020 A1
20200050788 Feuz et al. Feb 2020 A1
20200050996 Generes, Jr. et al. Feb 2020 A1
20200058299 Lee et al. Feb 2020 A1
20200076947 Deole Mar 2020 A1
20200097544 Alexander et al. Mar 2020 A1
20200104801 Kwon et al. Apr 2020 A1
20200118215 Rao et al. Apr 2020 A1
20200119936 Balasaygun et al. Apr 2020 A1
20200125919 Liu et al. Apr 2020 A1
20200126126 Briancon et al. Apr 2020 A1
20200128130 Geary Apr 2020 A1
20200134492 Copeland Apr 2020 A1
20200134648 Qi et al. Apr 2020 A1
20200137097 Zimmermann et al. Apr 2020 A1
20200154170 Wu et al. May 2020 A1
20200160870 Baughman et al. May 2020 A1
20200175478 Lee et al. Jun 2020 A1
20200193335 Sekhar et al. Jun 2020 A1
20200193983 Choi Jun 2020 A1
20200211120 Wang et al. Jul 2020 A1
20200218766 Yaseen et al. Jul 2020 A1
20200219500 Bender et al. Jul 2020 A1
20200242540 Rosati et al. Jul 2020 A1
20200250272 Kantor et al. Aug 2020 A1
20200250557 Kishimoto et al. Aug 2020 A1
20200257996 London Aug 2020 A1
20200280578 Hearty et al. Sep 2020 A1
20200280635 Barinov et al. Sep 2020 A1
20200285936 Sen Sep 2020 A1
20200329154 Baumann et al. Oct 2020 A1
20200336567 Dumaine Oct 2020 A1
20200342868 Lou et al. Oct 2020 A1
20200351375 Lepore et al. Nov 2020 A1
20200351405 Pace Nov 2020 A1
20200357026 Liu et al. Nov 2020 A1
20200364507 Berry Nov 2020 A1
20200365148 Ji et al. Nov 2020 A1
20200395008 Cohen et al. Dec 2020 A1
20200410506 Jones et al. Dec 2020 A1
20210004536 Adibi et al. Jan 2021 A1
20210005206 Adibi et al. Jan 2021 A1
20210042839 Adamec Feb 2021 A1
20210056481 Wicaksono et al. Feb 2021 A1
20210067627 Delker et al. Mar 2021 A1
20210081869 Zeelig et al. Mar 2021 A1
20210081955 Zeelig et al. Mar 2021 A1
20210082417 Zeelig et al. Mar 2021 A1
20210082418 Zeelig et al. Mar 2021 A1
20210084149 Zeelig et al. Mar 2021 A1
20210089762 Rahimi et al. Mar 2021 A1
20210091996 Mcconnell et al. Mar 2021 A1
20210105361 Bergher et al. Apr 2021 A1
20210124843 Vass et al. Apr 2021 A1
20210125275 Adibi Apr 2021 A1
20210133763 Adibi et al. May 2021 A1
20210133765 Adibi et al. May 2021 A1
20210134282 Adibi et al. May 2021 A1
20210134283 Adibi et al. May 2021 A1
20210134284 Adibi et al. May 2021 A1
20210136198 Leavitt May 2021 A1
20210136204 Adibi et al. May 2021 A1
20210136205 Adibi et al. May 2021 A1
20210136206 Adibi et al. May 2021 A1
20210201244 Sella et al. Jul 2021 A1
20220129905 Sethumadhavan et al. Apr 2022 A1
Foreign Referenced Citations (6)
Number Date Country
1 418 519 May 2004 EP
5986065 Sep 2016 JP
2006037836 Apr 2006 WO
2012024316 Feb 2012 WO
2015099587 Jul 2015 WO
2019142743 Jul 2019 WO
Non-Patent Literature Citations (40)
Entry
Gaietto, Molly., “What is Customer DNA?”,—NGDATA Product News, Oct. 27, 2015, 10 pages.
Fan et al., “Demystifying Big Data Analytics for Business Intelligence Through the Lens of Marketing Mix”, Big Data Research, vol. 2, Issue 1, Mar. 1, 2015, 16 pages.
An et al,, Towards Automatic Persona Generation Using Social Media Aug. 1, 2016, 2016 IEEE 4th International Conference on Future Internet of Things and Cloud Workshops (FiCloudW), 2 pages.
Bean-Mellinger, Barbara., “What Is the Difference Between Marketing and Advertising?”, available on Feb. 12, 2019, retrieved from https://smallbusiness.chron .com/difference-between-marketing-advertising-2504 7 .html, Feb. 12, 2019, 6 pages.
Twin, Alexandra., “Marketing”, URL: https://www.investopedia.com/lerms/m/marketing.asp, Mar. 29, 2019, 5 pages.
dictionary.com, “Marketing”, URL: https://www.dictionary.com/browse/marketing, Apr. 6, 2019, 7 pages.
Ponn et al., “Correlational Analysis between Weather and 311 Service Request Volume”, eil.mie.utoronto.ca., Jan. 1, 2017, 16 pages.
Zhang et al., “A Bayesian approach for modeling and analysis of call center arrivals”, Jan. 1, 2013 Winter Simulations Conference (WSC), ieeexplore.ieee.org, pp. 713-723.
Mehrotra et al., “Call Center Simulation Modeling: Methods, Challenges, and Opportunities” Proceedings of the 2003 Winter Simulation Conference, vol. 1, Jan. 1, 2003, pp. 135-143.
Mandelbaum et al., “Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Center”, Operations Research, Sep.-Oct. 2009, vol. 57, No. 5 (Sep. 1-Oct., 2009), pp. 1189-1205.
Fukunaga et al., “Staff Scheduling for Inbound Call Centers and Customer Contact Centers”, AI Magazine, Winter, vol. 23, No. 4, Jan. 1, 2002, pp. 30-40.
Feldman et al., “Staffing of Time-Varying Queues to Achieve Time-Stable Performance”, Management Science, Feb. 1, 2008, vol. 54, No. 2, Call Center Management, pp. 324-338.
Business Wire, “Rockwell SSD announces Call Center Simulator”, Feb. 4, 1997, 4 pages.
Nathan, Stearns., “Using skills-based routing to the advantage of your contact center”, Customer Inter@ction Solutions, Technology Marketing Corporation, May 1, 2001, vol. 19 No. 11, pp. 54-56.
Aksin et al., “The Modern Call Center: A Multi-Disciplinary Perspective on Operations Management Research”, Production and Operations Management, 2007, vol. 16, No. 6, pp. 665-688.
Aldor-Noiman, et al., “Workload forecasting for a call center: Methodology and a case study.” The Annals of Applied Statistics 3.4 (2009); 1403-1447.
Buesing et al., “Getting the Best Customer Service from your IVR: Fresh eyes on an old problem,” [online] McKinsey and Co., published on Feb. 1, 2019, available at: < https://www.nnckinsey.conn/business-functions/operations/our-insights/ getting-the-best-customer-service-from-your-ivr-fresh-eyes . . . (Year: 2019).
Chiu et al., “A multi-agent infrastructure for mobile workforce management in a service oriented enterprise”, Proceedings of the 38th annual Hawaii international conference on system sciences, IEEE, 2005, pp. 10.
Data Warehousing in the Age of Big Data, Krishnan, 2013, Morgan Kaufmann, Chapter 5.
Diimitrios et al., “An overview of workflow management: From process modeling to workflow automation infrastructure,” Distributed and parallel Databases, 1995, vol. 3, No. 2 pp. 119-153.
Ernst et al. “An Annotated Bibliography of Personnel Scheduling and Rostering”, CSIRO Mathematical and Information Sciences, 2003, 155 pages.
Ernst et al., “Staff scheduling and rostering: A review of applications, methods and models,” European Journal of Operational Research, 2004, vol. 153, pp. 3-27.
Federal Register, vol. 72, No. 195, Oct. 10, 2007, pp. 57526-57535.
Federal Register, vol. 75, No. 169, Sep. 1, 2010, pp. 53643-53660.
Federal register, vol. 79, No. 241 issued on Dec. 16, 2014, p. 74629, col. 2, Gottschalk v. Benson.
Federal Register, vol. 84, No. 4, Jan. 7, 2019, pp. 50-57.
Federal Register, vol. 84, No. 4, Jan. 7, 2019, p. 53-55.
Grefen et al., “A reference architecture for workflow management systems”, Data & Knowledge Engineering, 1998, vol. 27, No. 1, pp. 31-57.
https://www.uspto.gov/patent/laws-and-regulations/examination-policy/examination- guidelines-training-materials-view-ksr, signed Aug. 20, 2010.
Huang et al., “Agent-based workflow management in collaborative product development on the Internet”, Computer-Aided Design, 2000, vol. 32, No. 2, pp. 133-144.
Janarthanam, “Hands on Chatbots and conversational UI development: Build chatbots and voice user interfaces with Chatfuel, Dialogflow, Microsoft Bot Framework, Twilio, and Alexa Skills” Dec. 2017.
Koole, et al., “An overview of routing and staffing algorithms in multi-skill customer contact centers.” 2006.
Myers et al., “At the Boundary of Workflow and AI”, Proc. AAAI 1999 Workshop on Agent-Based Systems in The Business Context, 1999, 09 pages.
Niven, “Can music with prosocial lyrics heal the working world? A field intervention in a call center.” Journal of Applied Social Psychology, 2015; 45(3), 132-138. doi:10.1111/jasp.12282 ).
On Hold Marketing, “Growing Your Business with Customized on-Hold Messaging” (Published on Apr. 5, 2018 at https://adhq.com/about/ad-news/growing-your-business-with-customized-on-hold-messaging) (Year: 2018).
U.S. Appl. No. 16/668,214, NFOA dated Nov. 10, 2021.
U.S. Appl. No. 16/668,215, NFOA dated Dec. 7, 2021.
Van Den Bergh et al. “Personnel scheduling: A literature review”, European journal of operational research, 2013, vol. 226, No. 3 pp. 367-385.
United States Patent and Trademark Office, Non-Final Office Action for U.S. Appl. No. 16/550,961 dated Mar. 2, 2020.
United States Patent and Trademark Office, Final Office Action for U.S. Appl. No. 16/550,961 dated Jun. 17, 2020.