# US 2024/0256335 A1 · Systems and methods for estimation of workflow execution time

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

- Number: US 2024/0256335 A1
- Document ID: US20240256335A1
- Status: Published application
- Kind: A1
- Application number: 18/102,235
- Filed: 2023-01-27
- Published: 2024-08-01
- Earliest claimed: 2023-01-27
- Assignees: The Toronto-Dominion Bank
- Applicants: The Toronto-Dominion Bank
- Inventors: Sanjay NAGARAJA
- Web page: https://patentgrep.com/patent/US20240256335A1

## CPC

- G06Q 10/0633: Workflow analysis
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/4887: {involving deadlines, e.g. rate based, periodic}
- G06F 11/3419: {by assessing time}
- G06Q 10/06312: {Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling}
- B01F 21/30: {Workflow diagrams or layout of plants, e.g. flow charts; Details of workflow diagrams or layout of plants, e.g. controlling means}
- G05B 2219/31449: Monitor workflow, to optimize business, industrial processes
- G06Q 10/103: {Workflow collaboration or project management}
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- B01F: MIXING, e.g. DISSOLVING, EMULSIFYING OR DISPERSING (mixing paints B44D3/06)
- 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)

## Abstract

Computer-implemented systems and methods for estimating workflow execution time of a plurality of jobs executed on one or more servers. The system includes a monitoring computer that identifies the plurality of jobs and determines a depth and rank to assign to each job and thereby identify the workflow each job belongs to, along with the sequencing of the job within the workflow.

## Claims

### Claim 1

A system for estimating workflow execution time, the system comprising:
one or more servers, each of the servers comprising a server processor configured to execute one or more of a plurality of jobs;
a monitoring computer, the monitoring computer comprising a processor operatively coupled to a memory and a display, the processor configured to:
identify the plurality of jobs;
label the plurality of jobs according to a depth and a rank, wherein for each job, a respective depth identifies a workflow to which the job belongs, and a respective rank identifies sequencing of the job within the workflow to which the job belongs; and
display each of the plurality of jobs in a corresponding plurality of rows on the display, wherein the plurality of jobs is assigned to rows based on their depth and rank.

### Claim 2 (depends on 1)

The system of claim 1, wherein each job is labelled with a respective level, wherein the level provides an indication of a relative order within the respective rank of the job, and wherein the plurality of jobs is further assigned to rows based on their level.

### Claim 3 (depends on 1)

They system of claim 1, wherein a child job has a dependency on a respective parent job, and the child job has a link to the respective parent job, wherein the link comprises a visual indicator of the dependency.

### Claim 4 (depends on 1)

The system of claim 1, wherein the rank is denoted by an integer number.

### Claim 5 (depends on 4)

The system of claim 4, wherein a job of the plurality of jobs with a respective rank that has a lower number than a second job of the plurality of jobs with a respective rank that has a higher number is executed before the second job of the plurality of jobs.

### Claim 6 (depends on 2)

The system of claim 2, wherein the level determines that in a portion of the plurality of jobs, for each job having a same respective rank and having a same prior job but are not interdependent, are to be executed in parallel.

### Claim 7 (depends on 1)

The system of claim 1, wherein the depth is denoted by an integer number.

### Claim 8 (depends on 7)

The system of claim 7 wherein a second workflow with a respective depth that has a higher number than a first workflow with a respective depth that has a lower number is a sub-workflow of the first workflow.

### Claim 9 (depends on 1)

The system of claim 1, wherein each job of the plurality of jobs has a job start time, a job end time, and a job duration.

### Claim 10

A method for estimating workflow execution time, the method comprising:
labelling a plurality of jobs according to a depth and a rank, wherein for each job, a respective depth identifies a workflow to which the job belongs, and a respective rank identifies sequencing of the job within the workflow to which the job belongs; and
displaying each of the plurality of jobs in a corresponding plurality of rows on a display, wherein the plurality of jobs is assigned to rows based on their depth and rank.

### Claim 11 (depends on 10)

The method of claim 10, further comprising, for each job, labelling a respective level of the job, wherein the level provides an indication of a relative order within the respective rank of the job, and wherein the plurality of jobs are further assigned to rows based on their level.

### Claim 12 (depends on 10)

The method of claim 10, further comprising:
determining a dependency of a child job on a parent job; and
linking the child job to the parent job, wherein the linking comprises displaying a visual indicator of the dependency.

### Claim 13 (depends on 10)

The method of claim 10, wherein the rank is denoted by an integer number.

### Claim 14 (depends on 13)

The method of claim 13, wherein a job of the plurality of jobs with a respective rank that has a lower number than a second job of the plurality of jobs with a respective rank that has a higher number is executed before the second job of the plurality of jobs.

### Claim 15 (depends on 11)

The method of claim 11, wherein the level determines that a portion of the plurality of jobs, each job having a same respective rank and that are linked to a same prior job, but are not interdependent are to be executed in parallel.

### Claim 16 (depends on 10)

The method of claim 10, wherein the depth is denoted by an integer number.

### Claim 17 (depends on 16)

The method of claim 16, wherein a second workflow with a respective depth that has a higher number than a first workflow with a respective depth that has a lower number is a sub-workflow of the first workflow.

### Claim 18 (depends on 10)

The method of claim 10, further comprising:
providing a job start time, a job end time, and a job duration for each of the plurality of jobs.

### Claim 19

A non-transitory computer readable medium storing computer executable instructions which, when executed by at least one computer processor, cause the at least one computer processor to carry out a method for estimating workflow execution time, the method comprising:
labelling a plurality of jobs according to a depth and a rank, wherein for each job, a respective depth identifies the workflow to which the job belongs, and a respective rank identifies sequencing of the job within the workflow to which the job belongs; and
displaying each of the plurality of jobs in a corresponding plurality of rows on a display, wherein the plurality of jobs is assigned to rows based on their depth and rank.
