# US 2024/0354696 A1 · System and Method of Managing Complexity in Scheduling

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

- Number: US 2024/0354696 A1
- Document ID: US20240354696A1
- Status: Published application
- Kind: A1
- Application number: 18/517,755
- Filed: 2023-11-22
- Published: 2024-10-24
- Earliest claimed: 2023-04-24
- Assignees: Blue Yonder Group, Inc.
- Applicants: Blue Yonder Group, Inc.
- Inventors: Timothy Reed Hayes
- Web page: https://patentgrep.com/patent/US20240354696A1

## CPC

- G05B 19/41865: {characterised by job scheduling, process planning, material flow}
- G06Q 10/0631: Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q 10/06312: {Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling}
- G06Q 10/06313: {Resource planning in a project environment}
- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G05B 2219/32365: For resource planning
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)
- 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 and method are disclosed for layered scheduling. The method includes partitioning a scheduling problem into ordered subsets based on a prioritization scheme, applying a scheduling algorithm to optimize a first subset of the ordered subsets and freeze a corresponding schedule, determining whether there are any remaining subsets that have not been optimized, in response to determining that there are remaining subsets that have not been optimized, loading a next subset ordered according to the prioritization scheme, optimizing the loaded subset without disturbing the frozen schedule, and in response to determining that there are no remaining subsets to optimize, running a final pass of the scheduling algorithm to improve the global schedule metrics. The method further includes where the prioritization scheme is based on a relative priority of tasks to be performed, a value of finished goods that are to be produced or requirements regarding a use of resources.

## Claims

### Claim 1

A system, comprising:
a computer, comprising a processor and a memory, the computer configured to:
partition a scheduling problem into ordered subsets based on a prioritization scheme;
apply a scheduling algorithm to optimize a first subset of the ordered subsets and freeze a corresponding schedule;
determine whether there are any remaining subsets that have not been optimized;
in response to the determining that there are any remaining subsets that have not been optimized, load a next subset ordered according to the prioritization scheme;
optimize the loaded subset without disturbing the frozen schedule; and
in response to determining that there are no remaining subsets to optimize, run a final pass of the scheduling algorithm to improve one or more global schedule metrics.

### Claim 2 (depends on 1)

The system of claim 1, wherein the prioritization scheme is based on a relative priority of one or more tasks to be performed, a value of finished goods that are to be produced or one or more requirements regarding a use of resources.

### Claim 3 (depends on 1)

The system of claim 1, wherein each subset of the ordered subsets corresponds to a demand.

### Claim 4 (depends on 1)

The system of claim 1, wherein the one or more global schedule metrics comprise one or more of: a time performance, a setup cost and a resource utilization.

### Claim 5 (depends on 1)

The system of claim 1, wherein the prioritization scheme is based on a customer or an order associated with one or more in-process goods.

### Claim 6 (depends on 1)

The system of claim 1, wherein the scheduling algorithm further comprises one or more objective functions, the one or more objective functions comprising one or more of:
minimizing a cost of one or more resources, minimizing a lateness of one or more tasks, minimizing one or more setup costs and minimizing unused resource capacity.

### Claim 7 (depends on 6)

The system of claim 6, wherein the computer is further configured to:
define a tradeoff between at least two of the one or more objective functions.

### Claim 8

A computer-implemented method, comprising:
partitioning, by a computer comprising a processor and a memory, a scheduling problem into ordered subsets based on a prioritization scheme;
applying, by the computer, a scheduling algorithm to optimize a first subset of the ordered subsets and freeze a corresponding schedule;
determining, by the computer, whether there are any remaining subsets that have not been optimized;
in response to the determining that there are any remaining subsets that have not been optimized, loading, by the computer, a next subset ordered according to the prioritization scheme;
optimizing, by the computer, the loaded subset without disturbing the frozen schedule; and
in response to determining that there are no remaining subsets to optimize, running, by the computer, a final pass of the scheduling algorithm to improve one or more global schedule metrics.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein the prioritization scheme is based on a relative priority of one or more tasks to be performed, a value of finished goods that are to be produced or one or more requirements regarding a use of resources.

### Claim 10 (depends on 8)

The computer-implemented method of claim 8, wherein each subset of the ordered subsets corresponds to a demand.

### Claim 11 (depends on 8)

The computer-implemented method of claim 8, wherein the one or more global schedule metrics comprise one or more of: a time performance, a setup cost and a resource utilization.

### Claim 12 (depends on 8)

The computer-implemented method of claim 8, wherein the prioritization scheme is based on a customer or an order associated with one or more in-process goods.

### Claim 13 (depends on 8)

The computer-implemented method of claim 8, wherein the scheduling algorithm further comprises one or more objective functions, the one or more objective functions comprising one or more of:
minimizing a cost of one or more resources, minimizing a lateness of one or more tasks, minimizing one or more setup costs and minimizing unused resource capacity.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13, further comprising:
defining, by the computer, a tradeoff between at least two of the one or more objective functions.

### Claim 15

A non-transitory computer-readable medium embodied with software, the software when executed is configured to:
partition, by a computer comprising a processor and a memory, a scheduling problem into ordered subsets based on a prioritization scheme;
apply a scheduling algorithm to optimize a first subset of the ordered subsets and freeze a corresponding schedule;
determine whether there are any remaining subsets that have not been optimized;
in response to the determining that there are any remaining subsets that have not been optimized, load a next subset ordered according to the prioritization scheme;
optimize the loaded subset without disturbing the frozen schedule; and
in response to determining that there are no remaining subsets to optimize, run a final pass of the scheduling algorithm to improve one or more global schedule metrics.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the prioritization scheme is based on a relative priority of one or more tasks to be performed, a value of finished goods that are to be produced or one or more requirements regarding a use of resources.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein each subset of the ordered subsets corresponds to a demand.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the one or more global schedule metrics comprise one or more of: a time performance, a setup cost and a resource utilization.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the prioritization scheme is based on a customer or an order associated with one or more in-process goods.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the scheduling algorithm further comprises one or more objective functions, the one or more objective functions comprising one or more of:
minimizing a cost of one or more resources, minimizing a lateness of one or more tasks, minimizing one or more setup costs and minimizing unused resource capacity.
