Techniques for estimating expected performance in a task assignment system

US10972610B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10972610-B2
Application numberUS-202016931101-A
CountryUS
Kind codeB2
Filing dateJul 16, 2020
Priority dateJul 10, 2017
Publication dateApr 6, 2021
Grant dateApr 6, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Techniques for estimating expected performance of a task assignment strategy in a task assignment system are disclosed. In one particular embodiment, the techniques may be realized as a method comprising receiving, by at least one computer processor communicatively coupled to a task assignment system, a plurality of historical agent task assignments; determining, by the at least one computer processor, a sample of the plurality based on a strategy for pairing agents with tasks; determining, by the at least one computer processor, an expected performance of the strategy based on the sample; outputting, by the at least one computer processor, the expected performance; and optimizing, by the at least one computer processor, the performance of the task assignment system based on the expected performance.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method comprising: receiving, by at least one computer processor communicatively coupled to and configured to operate in a contact center system, a plurality of contact-agent interactions, wherein each of the plurality of contact-agent interactions is associated with a contact type of a plurality of contact types, an agent set of a plurality of agent sets, and an outcome; assigning, by the at least one computer processor, each of the contact-agent interactions of the plurality of contact-agent interactions to a plurality of interaction sets, wherein each interaction set of the plurality of interaction sets is associated with one of the contact types of the plurality of contact types and one of the agent sets of the plurality of agent sets; calculating, by the at least one computer processor, for the plurality of interaction sets, a plurality of aggregated outcomes; determining, by the at least one computer processor, a pairing strategy based on the plurality of aggregated outcomes, wherein the pairing strategy is configured to cause a connection to be established between a contact and an agent in a switch of the contact center system; determining, by the at least one computer processor, an expected utilization of an agent set from the plurality of agent sets based on the pairing strategy; determining, by the at least one computer processor, an allocation of a contact type from the plurality of contact types based on the pairing strategy; and outputting, by the at least one computer processor, an estimated performance of the pairing strategy based on the expected utilization and the allocation, wherein a size of the plurality of interaction sets is greater than a sum of a size of the plurality of agent sets and a size of the plurality of contact types. 2. The method of claim 1 , wherein the pairing strategy is configured so that each of the agent sets continues to receive a similar number of interactions as under the plurality of contact-agent interactions. 3. The method of claim 1 , wherein the pairing strategy is configured so that each of the contact types continues to receive a similar number of connections to agents as under the plurality of contact-agent interactions. 4. The method of claim 3 , wherein the pairing strategy is further configured so that each of the agent sets continues to receive a similar number of interactions as under the plurality of contact-agent interactions. 5. The method of claim 1 , wherein at least one interaction set of the plurality of interaction sets is an empty set. 6. The method of claim 1 , wherein the plurality of contact-agent interactions comprises historical contact-agent interactions. 7. The method of claim 1 , wherein an agent set of the plurality of agents sets consists of exactly one agent. 8. A system comprising: at least one computer processor communicatively coupled to and configured to operate in a contact center system, wherein the at least one computer processor is further configured to: receive a plurality of contact-agent interactions, wherein each of the plurality of contact-agent interactions is associated with a contact type of a plurality of contact types, an agent set of a plurality of agent sets, and an outcome; assign each of the contact-agent interactions of the plurality of contact-agent interactions to a plurality of interaction sets, wherein each interaction set of the plurality of interaction sets is associated with one of the contact types of the plurality of contact types and one of the agent sets of the plurality of agent sets; calculate, for the plurality of interaction sets, a plurality of aggregated outcomes; determine a pairing strategy based on the plurality of aggregated outcomes, wherein the pairing strategy is configured to cause a connection to be established between a contact and an agent in a switch of the contact center system; determine an expected utilization of an agent set from the plurality of agent sets based on the pairing strategy; determine an allocation of a contact type from the plurality of contact types based on the pairing strategy; and output an estimated performance of the pairing strategy based on the expected utilization and the allocation, wherein a size of the plurality of interaction sets is greater than a sum of a size of the plurality of agent sets and a size of the plurality of contact types. 9. The system of claim 8 , wherein the pairing strategy is configured so that each of the agent sets continues to receive a similar number of interactions as under the plurality of contact-agent interactions. 10. The system of claim 8 , wherein the pairing strategy is configured so that each of the contact types continues to receive a similar number of connections to agents as under the plurality of contact-agent interactions. 11. The system of claim 10 , wherein the pairing strategy is further configured so that each of the agent sets continues to receive a similar number of interactions as under the plurality of contact-agent interactions. 12. The system of claim 8 , wherein at least one interaction set of the plurality of interaction sets is an empty set. 13. The system of claim 8 , wherein the plurality of contact-agent interactions comprises historical contact-agent interactions. 14. The system of claim 8 , wherein an agent set of the plurality of agents sets consists of exactly one agent. 15. An article of manufacture comprising: a non-transitory computer processor readable medium; and instructions stored on the medium; wherein the instructions are configured to be readable from the medium by at least one computer processor communicatively coupled to and configured to operate in a contact center system and thereby cause the at least one computer processor to operate so as to: receive a plurality of contact-agent interactions, wherein each of the plurality of contact-agent interactions is associated with a contact type of a plurality of contact types, an agent set of a plurality of agent sets, and an outcome; assign each of the contact-agent interactions of the plurality of contact-agent interactions to a plurality of interaction sets, wherein each interaction set of the plurality of interaction sets is associated with one of the contact types of the plurality of contact types and one of the agent sets of the plurality of agent sets; calculate, for the plurality of interaction sets, a plurality of aggregated outcomes; determine a pairing strategy based on the plurality of aggregated outcomes, wherein the pairing strategy is configured to cause a connection to be established between a contact and an agent in a switch of the contact center system; determine an expected utilization of an agent set from the plurality of agent sets based on the pairing strategy; determine an allocation of a contact type from the plurality of contact types based on the pairing strategy; and output an estimated performance of the pairing strategy based on the expected utilization and the allocation, wherein a size of the plurality of interaction sets is greater than a sum of a size of the plurality of agent sets and a size of the plurality of contact types. 16. The article of manufacture of claim 15 , wherein the pairing strategy is configured so that each of the agent sets continues to receive a similar number of interactions as under the plurality of contact-agent interactions. 17. The article of manufacture of claim 15 , wherein the pairing strategy is configured so that each of the contact types continues to receive a similar number of conn

Assignees

Inventors

Classifications

  • H04M3/5232Primary

    Call distribution algorithms · CPC title

  • Agent or workforce management · CPC title

  • Scheduling, planning or task assignment for a person or group · CPC title

  • Performance feedback · CPC title

  • G06Q10/04Primary

    Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10972610B2 cover?
Techniques for estimating expected performance of a task assignment strategy in a task assignment system are disclosed. In one particular embodiment, the techniques may be realized as a method comprising receiving, by at least one computer processor communicatively coupled to a task assignment system, a plurality of historical agent task assignments; determining, by the at least one computer pr…
Who is the assignee on this patent?
Afiniti Europe Tech Ltd, Afiniti Ltd
What technology area does this patent fall under?
Primary CPC classification H04M3/5232. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Apr 06 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 7 related publications on this page (citations in our corpus or others sharing the same primary CPC).