# US 2010/0165977 A1 · System for Scheduling Routing Rules in a Contact Center Based on Forcasted and Actual Interaction Load and Staffing Requirements

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0165977 A1
- Document ID: US20100165977A1
- Status: Published application
- Kind: A1
- Application number: 12/345,038
- Filed: 2008-12-29
- Published: 2010-07-01
- Earliest claimed: 2008-12-29
- Assignees: Genesys Telecommunications Laboratories, Inc.
- Inventors: Alan McCord
- Web page: https://patentgrep.com/patent/US20100165977A1

## CPC

- H04L 12/66: Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
- G06Q 10/1093: Calendar-based scheduling for persons or groups
- H04M 3/5183: {Call or contact centers with computer-telephony arrangements}
- H04M 3/5238: {with waiting time or load prediction arrangements}
- H04M 7/006: {Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP) , including next generation networks with a packet-switched transport layer (H04L65/00 takes precedence; aspects not specific to the type of network H04M3/00; special services in those networks H04M3/42)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)

## Abstract

A system for scheduling resources and rules for routing includes a server connected to a network, a scheduling application executable from the server, and at least one programmable software agent for scheduling routing rules. The scheduling application receives statistics about forecast arrival rates for incoming interactions and current resource availability data and schedules resources and routing rules according to the forecast requirements the software agent propagating the portion of scheduling relative to the routing rules.

## Claims

### Claim 1

A system for scheduling resources and rules for routing comprising:
a server connected to a network;
a scheduling application executable from the server; and
at least one programmable software agent for scheduling routing rules;
characterized in that the scheduling application receives statistics about forecast arrival rates for incoming interactions and current resource availability data and schedules resources and routing rules according to the forecast requirements, and the software agent propagates scheduling relative to the routing rules.

### Claim 2 (depends on 1)

The system of claim 1 wherein the resources include live agents and the network is a local area network.

### Claim 3 (depends on 1)

The system of claim 1 wherein the incoming interactions include voice interactions and text interactions.

### Claim 4 (depends on 1)

The system of claim 1 wherein the server is a workforce management server.

### Claim 5 (depends on 1)

The system of claim 1 implemented in a contact center.

### Claim 6 (depends on 4)

The system of claim 4 wherein the workforce management server gets statistics from a statistics server connected to the local area network and availability data relative to resources from a configuration server connected to the network.

### Claim 7 (depends on 1)

The system of claim 1 wherein schedulable resources include live agents and automated attendants.

### Claim 8 (depends on 1)

The system of claim 1 wherein one or more software agents are schedulable resources.

### Claim 9 (depends on 1)

The system of claim 1 wherein the scheduling application continues to receive statistics about arrival rates during the work period.

### Claim 10 (depends on 1)

The system of claim 1 wherein the routing rules are rules that are decomposed from existing routing strategies.

### Claim 11

A method for scheduling the execution of a selected set of routing rules comprising the steps:
(a) providing at least one programmable software agent for propagating commands from a scheduling application to elements requiring scheduling;
(b) determining scheduling requirement and resource availability;
(c) scheduling resources for use;
(d) using the software agent, accessing the rules and selecting individual ones of those rules for time-based execution; and
(e) enabling the rules to execute in a sequence within a pre-defined time period.

### Claim 12 (depends on 11)

The method of claim 11 wherein in step (a) the elements requiring scheduling include rules, routing strategy, and voice application logic.

### Claim 13 (depends on 11)

The method of claim 11 wherein in step (b) the scheduling requirement is based on a forecast arrival of interactions and resource availability includes the work times for human agents.

### Claim 14 (depends on 11)

The method of claim 11 wherein in step (b) the scheduling requirement is spread out over a work period and subject to change between periods.

### Claim 15 (depends on 11)

The method of claim 11 wherein in step (c) the resources include live agents.

### Claim 16 (depends on 11)

The method of claim 11 wherein in step (d) the rules are selected and scheduled to be used within a specific window of time.

### Claim 17 (depends on 11)

The method of claim 11 wherein in step (e) the software agent assembles the rules into a strategy.

### Claim 18 (depends on 11)

The method of claim 11 wherein in step (e) one or more time windows are inserted into one or more of the selected rules scheduled for execution.

### Claim 19 (depends on 11)

The method of claim 11 wherein in step (e) the sequence replaces a previous sequence when the time period begins.

### Claim 20 (depends on 11)

The method of claim 11 wherein in step (e) the sequence executes along side a previous sequence for a defined type of interaction when the time period begins.
