IP Library Granted Patent US 11,972,376
Granted Patent B2
US 11,972,376 · App. 17/572,030 · Granted Apr 30, 2024

Techniques for workforce management in a task assignment system

Inventor: Denys Liubyvyi (Washington, DC)
Assignee: AFINITI, LTD.
G06Q10/063114G06Q10/06312G06Q10/06398
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,972,376
App. No.
17/572,030
Granted
Apr 30, 2024
Kind
B2
Abstract

Techniques for workforce management in a task assignment system are disclosed. In one particular embodiment, the techniques may be realized as a method for workforce management in a task assignment system comprising: determining, by at least one computer processor configured to operate in the task assignment system, a first efficiency level of a first task assignment strategy for a first number of agents to be employed in the task assignment system; determining, by the at least one computer processor, a second efficiency level of a second task assignment strategy for a second number of agents to be employed in the task assignment system; comparing, by the at least one computer processor, the first and second efficiency levels; and selecting, by the at least one computer processor, one of the first and second numbers of agents having the higher of the first and second efficiency levels.

Claims (18)

1. A method for workforce management in a task assignment system, the method comprising: determining, by at least one computer processor configured to perform workforce management operations in the task assignment system, a first number of agents to be employed in the task assignment system; calculating, by the at least one computer processor, a first performance level of a first task assignment strategy for the first number of agents to be employed in the task assignment system; determining, by the at least one computer processor, a second number of agents to be employed in the task assignment system; calculating, by the at least one computer processor, a second performance level of a second task assignment strategy for the second number of agents to be employed in the task assignment system; comparing, by the at least one computer processor, the first and second performance levels; and selecting, by the at least one computer processor, one of the first and second numbers of agents having the higher of the first and second performance levels, wherein the selection of one of the first and second numbers of agents causes an expected frequency of the task assignment system entering a particular pairing state to change thereby changing a choice of agents to be connected in the task assignment system; and establishing a connection between an agent and a task in a switch of the task assignment system based upon the selected one of the first and second numbers of agents and a corresponding task assignment strategy.

2. The method of claim 1 , wherein the first performance level of the first task assignment strategy for the first number of agents to be employed in the task assignment system is a first efficiency level, the second performance level of the second task assignment strategy for the second number of agents to be employed in the task assignment system is a second efficiency level, and the particular pairing state is an LO state.

3. The method of claim 1 , wherein the first task assignment strategy is a first-in first-out (FIFO) strategy, and the second task assignment strategy is a behavioral pairing (BP) strategy.

4. The method of claim 1 , wherein calculating the second performance level is based on: an expected gain of using the second task assignment strategy with the second number of agents over using the first task assignment strategy with the first number of agents, or a cost of using the second task assignment strategy instead of the first task assignment strategy.

5. The method of claim 1 , wherein the second number of agents is less than the first number of agents, and calculating the second performance level is based on a savings of using the second number of agents instead of the first number of agents.

6. The method of claim 1 , wherein calculating the second performance level further comprises: calculating, by the at least one computer processor, a cost of losing a portion of a plurality of tasks by estimating an expected loss of each task out of the portion of the plurality of tasks, or applying, by the at least one computer processor, a statistical analysis on historical data recorded by the task assignment system.

7. A system for workforce management in a task assignment system comprising: at least one computer processor configured to perform workforce management operations in the task assignment system, wherein the at least one computer processor is further configured to: determine a first number of agents to be employed in the task assignment system; calculate a first performance level of a first task assignment strategy for the first number of agents to be employed in the task assignment system; determine a second number of agents to be employed in the task assignment system; calculate a second performance level of a second task assignment strategy for the second number of agents to be employed in the task assignment system; compare the first and second performance levels; and select one of the first and second numbers of agents having the higher of the first and second performance levels, wherein the selection of one of the first and second numbers of agents causes an expected frequency of the task assignment system entering a particular pairing state to change thereby changing a choice of agents to be connected in the task assignment system; and a connection between an agent and a task is established in a switch of the task assignment system based upon the selected one of the first and second numbers of agents and a corresponding task assignment strategy.

8. The system of claim 7 , wherein the first performance level of the first task assignment strategy for the first number of agents to be employed in the task assignment system is a first efficiency level, the second performance level of the second task assignment strategy for the second number of agents to be employed in the task assignment system is a second efficiency level, and the particular pairing state is an LO state.

9. The system of claim 7 , wherein the first task assignment strategy is a first-in first-out (FIFO) strategy, and the second task assignment strategy is a behavioral pairing (BP) strategy.

10. The system of claim 7 , wherein the second performance level is calculated based on: an expected gain of using the second task assignment strategy with the second number of agents over using the first task assignment strategy with the first number of agents, or a cost of using the second task assignment strategy instead of the first task assignment strategy.

11. The system of claim 7 , wherein the second number of agents is less than the first number of agents, and the second performance level is calculated based on a savings of using the second number of agents instead of the first number of agents.

12. The system of claim 7 , wherein the at least one computer processor is further configured to calculate: the second performance level further by calculating a cost of losing a portion of a plurality of tasks by estimating an expected loss of each task out of the portion of the plurality of tasks, or the second performance level by applying a statistical analysis on historical data recorded by the task assignment system.

13. An article of manufacture for workforce management in a task assignment system 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 configured to perform workforce management operations in the task assignment system and thereby cause the at least one computer processor to operate so as to: determine a first number of agents to be employed in the task assignment system; calculate a first performance level of a first task assignment strategy for the first number of agents to be employed in the task assignment system; determine a second number of agents to be employed in the task assignment system; calculate a second performance level of a second task assignment strategy for the second number of agents to be employed in the task assignment system; compare the first and second performance levels; and select one of the first and second numbers of agents having the higher of the first and second performance levels, wherein the selection of one of the first and second numbers of agents causes an expected frequency of the task assignment system entering a particular pairing state to change thereby changing a choice of agents to be connected in the task assignment system; and establish a connection between an agent and a task in a switch of the task assignment system based upon the selected one of the first and second numbers of agents and a corresponding task assignment strategy.

14. The article of manufacture of claim 13 , wherein the first performance level of the first task assignment strategy for the first number of agents to be employed in the task assignment system is a first efficiency level, the second performance level of the second task assignment strategy for the second number of agents to be employed in the task assignment system is a second efficiency level, and the particular pairing state is an LO state.

15. The article of manufacture of claim 13 , wherein the first task assignment strategy is a first-in first-out (FIFO) strategy, and the second task assignment strategy is a behavioral pairing (BP) strategy.

16. The article of manufacture of claim 13 , wherein the second performance level is calculated based on: an expected gain of using the second task assignment strategy with the second number of agents over using the first task assignment strategy with the first number of agents, or a cost of using the second task assignment strategy instead of the first task assignment strategy.

17. The article of manufacture of claim 13 , wherein the second number of agents is less than the first number of agents, and the second performance level is calculated based on a savings of using the second number of agents instead of the first number of agents.

18. The article of manufacture of claim 13 , wherein the at least one computer processor further operates so as to calculate: the second performance level further by calculating a cost of losing a portion of a plurality of tasks by estimating an expected loss of each task out of the portion of the plurality of tasks, or the second performance level by applying a statistical analysis on historical data recorded by the task assignment system.

Assignments (6)
RELEASE AND TERMINATION OF PATENT SECURITY AGREEMENT Recorded Apr 16, 2025
From: VCP CAPITAL MARKETS, LLC
To: AFINITI, LTD.
Reel/Frame 070866/0614 →
PATENT ASSIGNMENT AGREEMENT Recorded Jan 3, 2025
From: AFINITI, LTD.
To: AFINITI AI HOLDINGS LLC
Reel/Frame 069816/0656 →
PATENT SECURITY AGREEMENT Recorded Jan 3, 2025
From: AFINITI AI LIMITED
To: ALTER DOMUS (US) LLC
Reel/Frame 069816/0858 →
PATENT ASSIGNMENT AGREEMENT Recorded Jan 3, 2025
From: AFINITI AI HOLDINGS LLC
To: AFINITI AI LIMITED
Reel/Frame 069817/0001 →
PATENT SECURITY AGREEMENT Recorded Aug 26, 2024
From: AFINITI, LTD.
To: VCP CAPITAL MARKETS, LLC
Reel/Frame 068793/0261 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 5, 2022
From: LIUBYVYI, DENYS
To: AFINITI, LTD.
Reel/Frame 059504/0303 →
Continuity (2)
Continuation 15993498 · May 30, 2018
Related Publication 20220129827A1 · Apr 28, 2022