# US 2018/0322442 A1 · Systems and methods for dynamically scheduling tasks across an enterprise

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

- Number: US 2018/0322442 A1
- Document ID: US20180322442A1
- Status: Published application
- Kind: A1
- Application number: 15/588,122
- Filed: 2017-05-05
- Published: 2018-11-08
- Earliest claimed: 2017-05-05
- Assignees: ServiceNow, Inc.
- Applicants: ServiceNow, Inc.
- Inventors: Sanjay Gupta; Venki Subramanian; Sarath Ambati
- Web page: https://patentgrep.com/patent/US20180322442A1

## CPC

- G06Q 10/063116: {Schedule adjustment for a person or group}
- G06Q 10/063112: {Skill-based matching of a person or a group to a task}
- G06Q 10/063114: {Status monitoring or status determination for a person or group}
- 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

## Abstract

A system may include a processor that receives tasks to be performed, determines ordering rules associated with the tasks, and identifies a first set of employees to perform the one or more tasks based on schedule data associated with the employees and the ordering rules. The processor may then identify one employee of the first set of employees to perform the tasks based on a current schedule for the one employee and the ordering rules, identify scheduled tasks to remove from the current schedule based on un-assignment rules, and generate an adjusted current schedule to include the tasks and remove the scheduled tasks from the current schedule. The processor may then send a notification indicative of an adjusted current schedule to a computing device associated with the one employee.

## Claims

### Claim 1

A system, comprising:
a processor configured to execute computer-executable instructions which, when executed cause the processor to:
receive one or more tasks to be performed;
determine a plurality of ordering rules associated with the one or more tasks;
identify a first set of employees of a plurality of employees to perform the one or more tasks based on schedule data associated with the plurality of employees and the plurality of ordering rules;
identify one employee of the first set of employees to perform the one or more tasks based on a current schedule for the one employee and the plurality of ordering rules;
identify one or more scheduled tasks to remove from the current schedule based on one or more un-assignment rules;
generate an adjusted current schedule to include the one or more tasks and remove the one or more scheduled tasks from the current schedule; and
send a notification indicative of an adjusted current schedule to a computing device associated with the one employee.

### Claim 2 (depends on 1)

The system of claim 1, comprising a database comprising data regarding the plurality of employees, wherein the data comprises information related to one or more skills, a location, a current schedule, a preferred language, or any combination thereof for each respective employee of the plurality of employees.

### Claim 3 (depends on 1)

The system of claim 1, wherein the plurality of ordering rules comprises a priority rating for each of the one or more tasks.

### Claim 4 (depends on 1)

The system of claim 1, wherein the plurality of ordering rules is stored within metadata associated with the one or more tasks.

### Claim 5 (depends on 1)

The system of claim 1, wherein the plurality of ordering rules is associated with a service level agreement.

### Claim 6 (depends on 1)

The system of claim 1, wherein the computer-executable instructions which, when executed cause the processor to receive one or more un-assignment rules indicative of one or more conditions in which the one or more tasks may be un-assigned from the current schedule.

### Claim 7 (depends on 1)

The system of claim 1, wherein the computer-executable instructions which, when executed cause the processor to receive one or more re-assignment rules indicative of one or more trigger to cause the processor to un-assign the one or more tasks from the current schedule and re-assign the one or more tasks to another schedule associated with another employee of the plurality of employees.

### Claim 8 (depends on 7)

The system of claim 7, wherein the one or more triggers comprise falling behind with respect to the current schedule, a determination that the one employee does not have a skill set to perform the one or more tasks, or any combination thereof.

### Claim 9 (depends on 1)

The system of claim 1, wherein the one or more tasks comprise information regarding an expected amount of time to perform the one or more tasks, one or more deadlines to perform the one or more tasks, or any combination thereof.

### Claim 10

A system, comprising:
a non-transitory memory; and
one or more hardware processors configured to read instructions from the non-transitory memory to perform operations comprising:
collecting a plurality of tasks from a first auto-assignment dispatch and a central dispatch;
determining one or more ordering rules associated with a respective due date for each of the plurality of tasks;
determining a respective priority for each of the plurality of tasks based at least on the one or more ordering rules;
sorting the plurality of tasks based at least on the respective priorities for each of the plurality of tasks;
performing a second auto-assignment of the plurality of tasks to a plurality of agents based at least on the respective priorities;
identifying one or more of the plurality of tasks that are unassigned based at least on the second auto-assignment; and
returning the one or more unassigned tasks to a sorted plurality of tasks for a third auto-assignment.

### Claim 11 (depends on 10)

The system of claim 10, wherein the first auto-assignment dispatch is configured to transmit at least a portion of the plurality of tasks to the one or more hardware processor after the portion of the plurality of tasks are un-assigned from a respective schedule of a respective agent of the plurality of agents.

### Claim 12 (depends on 10)

The system of claim 10, wherein the operations comprise un-assigning at least a portion of the plurality of tasks based on one or more un-assignment rules associated with the at least a portion of the plurality of tasks.

### Claim 13 (depends on 12)

The system of claim 12, wherein the one or more un-assignment rules are indicative of one or more conditions in which a respective task may be un-assigned.

### Claim 14 (depends on 10)

The system of claim 10, wherein performing the second auto-assignment of the plurality of tasks comprises retrieving a plurality of current schedules associated with the plurality of agents and identifying at least one work block within the plurality of schedules to perform the one or more tasks.

### Claim 15 (depends on 10)

The system of claim 10, wherein performing the second auto-assignment of the plurality of tasks comprises identifying at least one agent of the plurality of agents that is located within a proximity with respect to a location in which the one or more tasks is to be performed.

### Claim 16 (depends on 15)

The system of claim 15, wherein the operations comprise retrieving a second location of the at least one agent via a global position system device.

### Claim 17

A method, comprising:
receiving, via a processor, one or more tasks to be performed;
determining, via the processor, a plurality of ordering rules associated with the one or more tasks;
identifying, via the processor, a first set of employees of a plurality of employees to perform the one or more tasks based on schedule data associated with the plurality of employees and the plurality of ordering rules;
identifying, via the processor, one employee of the first set of employees to perform the one or more tasks based on a current schedule for the one employee and the plurality of ordering rules;
identifying, via the processor, one or more scheduled tasks to remove from the current schedule based on one or more un-assignment rules;
generating, via the processor, an adjusted current schedule to include the one or more tasks and remove the one or more scheduled tasks from the current schedule; and
sending, via the processor, a notification indicative of an adjusted current schedule to a computing device associated with the one employee.

### Claim 18 (depends on 17)

The method of claim 17, comprising retrieving, via the processor, data indicative of the current schedule for the one employee from one or more databases.

### Claim 19 (depends on 18)

The method of claim 18, wherein the data comprises information related to one or more skills, a location, a current schedule, a preferred language, or any combination thereof for each respective employee of the plurality of employees.

### Claim 20 (depends on 17)

The method of claim 17, wherein the plurality of ordering rules comprises a priority rating for each of the one or more tasks.
