IP Library Patent Application 18158763
Patent Application
App. No. 18/158,763

SYSTEMS AND METHODS FOR GENERATING MULTIPLE SCHEDULES FOR COMPUTATIONAL EFFICIENCY

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
18/158,763
Abstract

A method, including: generating a plurality of initial schedules for an agglomerate network, including a first number of schedules, and determining a threshold number of schedules, including: evaluating the plurality of initial schedules to select a first schedule, identifying a first place number of the first schedule, if the first place number is greater than or equal to a first threshold number, the first threshold number being within two of the threshold number: increasing the threshold number of schedules to a second threshold number, greater than the first threshold number, and generating a second plurality of schedules equal to the second threshold number, evaluating the second plurality of schedules to select a second schedule, identifying a second place number of the second schedule, and if the second place number is ‘1’ or ‘2’, decreasing the threshold number of schedules to a third threshold number, less than the first threshold number.

Claims (57)

1 . An apparatus, comprising:

a schedule generation circuit structured to generate a plurality of initial schedules for an agglomerate network, the plurality of initial schedules comprising a first number of schedules; and

a threshold number determining circuit structured to determine a threshold number of schedules, comprising:

a first schedule evaluation circuit comprising:

a first evaluation circuit structured to evaluate the plurality of initial schedules to select a first schedule for the agglomerate network, among the plurality of initial schedules, that meets desired criteria; and

a first threshold determining circuit structured to:

identify a first place number, among the first number of schedules, of the selected first schedule; and

if the first place number is greater than or equal to a first threshold number of the generated schedules, the first threshold number being within two of the threshold number:

 increase the threshold number of schedules to a second threshold number of generated schedules, greater than the first threshold number; and

 instruct the schedule generation circuit to generate a second plurality of schedules equal to the second threshold number of schedules; and

a second schedule evaluation circuit comprising:

a second evaluation circuit structured to evaluate the second plurality of schedules to select a second schedule for the agglomerate network, among the second plurality of schedules, that meets the desired criteria; and

a second threshold determining circuit structured to:

identify a second place number, among the second plurality of schedules, of the selected second schedule; and

if the second place number is ‘1’ or ‘2’, decrease the threshold number of schedules to a third threshold number of schedules, less than the first threshold number.

2 . The apparatus of claim 1 , wherein the schedule generation circuit is further structured to propagate the plurality of initial schedules in the agglomerate network.

3 . The apparatus of claim 2 , wherein the schedule generation circuit is further structured to propagate the second plurality of schedules in the agglomerate network.

4 . The apparatus of claim 1 , wherein:

the selected first schedule is determined to be a best schedule among the plurality of initial schedules based on a best fit to the desired criteria; and

the selected second schedule is determined to be a best schedule among the second plurality of schedules based on a best fit to the desired criteria.

5 . The apparatus of claim 1 , wherein at least one of a number or a type of schedule generated by the schedule generation circuit is fixed or is dynamically or algorithmically determined.

6 . The apparatus of claim 1 , wherein the schedule generation circuit is further structured to generate a variety of different schedules.

7 . The apparatus of claim 1 , wherein the schedule generation circuit is further structured to generate a top number of schedules.

8 . The apparatus of claim 1 , wherein the first number of schedules is determined based on previous selections of schedules.

9 . The apparatus of claim 1 , wherein the schedule generation circuit is further structured to rank each of:

the plurality of initial schedules; and

the second plurality of schedules.

10 . A method comprising:

generating first round schedule data corresponding to a first plurality of schedules;

propagating the first round schedule data through a plurality of agglomerate network circuits;

determining a selected schedule of the first round schedule data; and

generating, based at least in part on the selected schedule of the first round schedule data, second round schedule data corresponding to a second plurality of schedules.

11 . The method of claim 10 , wherein at least one of the plurality of agglomerate network circuits is a connector circuit.

12 . The method of claim 10 further comprising:

propagating the second round schedule data through the plurality of agglomerate network circuits.

13 . A method, comprising:

generating a plurality of initial schedules for an agglomerate network, the plurality of initial schedules comprising a first number of schedules; and

determining a threshold number of schedules, comprising:

evaluating the plurality of initial schedules to select a first schedule for the agglomerate network, among the plurality of initial schedules, that meets desired criteria;

identifying a first place number, among the first number of schedules, of the selected first schedule;

if the first place number is greater than or equal to a first threshold number of the generated schedules, the first threshold number being within two of the threshold number:

increasing the threshold number of schedules to a second threshold number of generated schedules, greater than the first threshold number; and

generating a second plurality of schedules equal to the second threshold number of schedules;

evaluating the second plurality of schedules to select a second schedule for the agglomerate network, among the second plurality of schedules, that meets the desired criteria;

identifying a second place number, among the second plurality of schedules, of the selected second schedule; and

if the second place number is ‘1’ or ‘2’, decreasing the threshold number of schedules to a third threshold number of schedules, less than the first threshold number.

14 . The method of claim 13 , further comprising propagating the plurality of initial schedules in the agglomerate network.

15 . The method of claim 14 , further comprising propagating the second plurality of schedules in the agglomerate network.

16 . The method of claim 13 , wherein:

the selected first schedule is determined to be a best schedule among the plurality of initial schedules based on a best fit to the desired criteria; and

the selected second schedule is determined to be a best schedule among the second plurality of schedules based on a best fit to the desired criteria.

17 . The method of claim 13 , wherein:

the selected first schedule is determined to be a best schedule among the plurality of initial schedules based on a best fit to the desired criteria; and

the selected second schedule is determined to be a best schedule among the second plurality of schedules based on a best fit to the desired criteria.

18 . The method of claim 13 , wherein at least one of a number or a type of generated schedule is fixed or is dynamically or algorithmically determined.

19 . The method of claim 13 , further comprising generating a variety of different schedules.

20 . The method of claim 13 , further comprising generating a top number of schedules.

Assignments (5)
RELEASE (REEL 066552 / FRAME 0029) Recorded Apr 9, 2024
From: NOMURA CORPORATE FUNDING AMERICAS, LLC
To: UKG INC.; KRONOS TECHNOLOGY SYSTEMS LIMITED PARTNERSHIP
Reel/Frame 067055/0917 →
SECURITY AGREEMENT (FIRST LIEN) Recorded Feb 12, 2024
From: KRONOS TECHNOLOGY SYSTEMS LIMITED PARTNERSHIP; UKG INC.
To: NOMURA CORPORATE FUNDING AMERICAS, LLC, AS COLLATERAL AGENT
Reel/Frame 066551/0941 →
SECURITY AGREEMENT (NOTES) Recorded Feb 12, 2024
From: KRONOS TECHNOLOGY SYSTEMS LIMITED PARTNERSHIP; UKG INC.
To: COMPUTERSHARE TRUST COMPANY, NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 066551/0962 →
SECURITY AGREEMENT (SECOND LIEN) Recorded Feb 12, 2024
From: KRONOS TECHNOLOGY SYSTEMS LIMITED PARTNERSHIP; UKG INC.
To: NOMURA CORPORATE FUNDING AMERICAS, LLC, AS COLLATERAL AGENT
Reel/Frame 066552/0029 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 28, 2023
From: WAYNE, DAVID HENRY; MURAS, BRIAN ROBERT; BRIGGS, KEITH ALAN; KROWITZ, ALEXANDER L.
To: UKG INC.
Reel/Frame 064424/0208 →