# US 2025/0165885 A1 · Adjusted Schedule Generation Based on Machine-Inferred Constraints

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

- Number: US 2025/0165885 A1
- Document ID: US20250165885A1
- Status: Published application
- Kind: A1
- Application number: 18/515,195
- Filed: 2023-11-20
- Published: 2025-05-22
- Earliest claimed: 2023-11-20
- Assignees: Zebra Technologies Corporation
- Applicants: Zebra Technologies Corporation
- Inventors: Niwedita Dubey; Hareesh Babu Annu; Sriram Krishnan
- Web page: https://patentgrep.com/patent/US20250165885A1

## CPC

- G06Q 10/063116: {Schedule adjustment 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 method includes: generating, for a target identifier, a plurality of shift candidates, each shift candidate defining values for a set of attributes; generating a metric corresponding to each shift candidate; obtaining a score associated with the target identifier, the score corresponding to a first attribute of the set of attributes; determining a metric adjustment for each shift candidate based on (i) the obtained score for the target identifier, and (ii) a value of the first attribute defined by the shift candidate; selecting a shift candidate for the target identifier, based on the metrics and the metric adjustments; and deploying a schedule containing the selected shift candidate.

## Claims

### Claim 1

A method, comprising:
generating, for a target identifier, a plurality of shift candidates, each shift candidate defining values for a set of attributes;
generating a metric corresponding to each shift candidate;
obtaining a score associated with the target identifier, the score corresponding to a first attribute of the set of attributes;
determining a metric adjustment for each shift candidate based on (i) the obtained score for the target identifier, and (ii) a value of the first attribute defined by the shift candidate;
selecting a shift candidate for the target identifier, based on the metrics and the metric adjustments; and
deploying a schedule containing the selected shift candidate.

### Claim 2 (depends on 1)

The method of claim 1, wherein obtaining the score includes:
detecting a plurality of events corresponding to previous shifts associated with the target identifier in a previous schedule;
determining a label for each of the events;
generating a classification model based on (i) the labels and (ii) values for the first attribute from the previous shifts; and
executing the classification model to determine the score.

### Claim 3 (depends on 2)

The method of claim 2, wherein the plurality of events includes a first set of events initiated by the target identifier, and a second set of events initiated by an administrator identifier; and
wherein generating the classification model includes:
generating a first classification model from the first set of events, and a second classification model from the second set of events.

### Claim 4 (depends on 3)

The method of claim 3, wherein obtaining the score comprises obtaining a first score via execution of the first classification model, and obtaining a second score via execution of the second classification model; and
wherein determining the metric adjustment is based on (i) the first score, (ii) the second score, (iii) respective weights corresponding to the first and second scores, and (iv) the value of the first attribute.

### Claim 5 (depends on 2)

The method of claim 2, wherein each event corresponding to a previous shift is selected from the group consisting of:
a modification of at least one attribute of the previous shift;
a request for assignment of the previous shift to or from the target identifier;
an assignment of the previous shift to or from the target identifier; and
timestamps associated with the previous shift and the target identifier.

### Claim 6 (depends on 2)

The method of claim 2, wherein determining a label for each of the events includes:
comparing the event to a labelling criterion corresponding to the event;
assigning a first label when the event satisfies the labelling criterion; and
assigning a second label when the event does not satisfy the labelling criterion.

### Claim 7 (depends on 1)

The method of claim 1, further comprising, prior to deploying the schedule:
generating a secondary schedule by selecting a shift candidate for the target identifier based on the metrics;
comparing an efficiency of the schedule with an efficiency of the secondary schedule; and
determining that the efficiency of the schedule exceeds the efficiency of the secondary schedule.

### Claim 8

A computing device, comprising:
a communications interface; and
a processor configured to:
generate, for a target identifier, a plurality of shift candidates, each shift candidate defining values for a set of attributes;
generate a metric corresponding to each shift candidate;
obtain a score associated with the target identifier, the score corresponding to a first attribute of the set of attributes;
determine a metric adjustment for each shift candidate based on (i) the obtained score for the target identifier, and (ii) a value of the first attribute defined by the shift candidate;
select a shift candidate for the target identifier, based on the metrics and the metric adjustments; and
control the communications interface to deploy a schedule containing the selected shift candidate.

### Claim 9 (depends on 8)

The computing device of claim 8, wherein the processor is configured to obtain the score by:
detecting a plurality of events corresponding to previous shifts associated with the target identifier in a previous schedule;
determining a label for each of the events;
generating a classification model based on (i) the labels and (ii) values for the first attribute from the previous shifts; and
executing the classification model to determine the score.

### Claim 10 (depends on 9)

The computing device of claim 9, wherein the plurality of events includes a first set of events initiated by the target identifier, and a second set of events initiated by an administrator identifier; and
wherein the processor is configured to generate the classification model by:
generating a first classification model from the first set of events, and a second classification model from the second set of events.

### Claim 11 (depends on 10)

The computing device of claim 10, wherein the processor is configured to obtain the score by obtaining a first score via execution of the first classification model, and obtaining a second score via execution of the second classification model; and
wherein the processor is configured to determine the metric adjustment based on (i) the first score, (ii) the second score, (iii) respective weights corresponding to the first and second scores, and (iv) the value of the first attribute.

### Claim 12 (depends on 9)

The computing device of claim 9, wherein each event corresponding to a previous shift is selected from the group consisting of:
a modification of at least one attribute of the previous shift;
a request for assignment of the previous shift to or from the target identifier;
an assignment of the previous shift to or from the target identifier; and
timestamps associated with the previous shift and the target identifier.

### Claim 13 (depends on 9)

The computing device of claim 9, wherein the processor is configured to determine a label for each of the events by:
comparing the event to a labelling criterion corresponding to the event;
assigning a first label when the event satisfies the labelling criterion; and
assigning a second label when the event does not satisfy the labelling criterion.

### Claim 14 (depends on 8)

The computing device of claim 8, wherein the processor is further configured to, prior to deploying the schedule:
generate a secondary schedule by selecting a shift candidate for the target identifier based on the metrics;
compare an efficiency of the schedule with an efficiency of the secondary schedule; and
determine that the efficiency of the schedule exceeds the efficiency of the secondary schedule.
