IP Library Granted Patent US 8,533,014
Granted Patent B1
US 8,533,014 · App. 12/774,202 · Granted Sep 10, 2013

System and method providing levelness of a production schedule

View Patent ↗
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 8,533,014
App. No.
12/774,202
Granted
Sep 10, 2013
Kind
B1
Abstract

A system and method is disclosed for providing levelness of a production schedule. The system includes a computer configured to access demand data of one or more items to be processed within a sequence of tasks, access the demand data of the one or more items, calculate one or more time intervals for each of the one or more items, and calculate a weighted average for each of the one or more items. The computer is further configured to calculate a time ratio according to the sequence of tasks by calculating the average of the calculated time intervals and the calculated weighted averages and calculating a minimum ratio of an adjusted time interval for each of the one or more items and the calculated weighted averages. The computer is still further configured to generate a production schedule based on a sequence of tasks having a predetermined calculated time ratio.

Claims (67)

1. A system providing levelness of a production schedule, comprising:

a database that stores demand data of one or more items to be processed within a sequence of tasks; and

a computer coupled with the database and configured to:

access the demand data of the one or more items;

calculate one or more time intervals for each of the one or more items;

calculate a weighted average for each of the one or more items;

calculate a time ratio according to the sequence of tasks by:

calculating the average of the calculated time intervals and the calculated weighted averages; and

calculating a minimum ratio of an adjusted time interval for each of the one or more items and the calculated weighted averages, upper bounded by unity;

generate a production schedule based on a sequence of tasks having a predetermined calculated time ratio; and

store the generated production schedule in the database.

2. The system of claim 1 , wherein the computer is further configured to:

determine a total number of tasks within the sequence of tasks and a total number of tasks for each of the one or more items based on the accessed demand data of the one or more items.

3. The system of claim 2 , wherein the one or more time intervals is determined by calculating the ratio of the total number of tasks within the sequence of tasks and the total number of tasks for each of the one or more items.

4. The system of claim 1 , wherein the computer is further configured to:

determine a number of subsequences of tasks within the sequence of tasks for each of the one or more items which have at least [T A ] tasks, where [T A ] is the largest whole number smaller than or equal to the time interval of the item.

5. The system of claim 4 , wherein the computer is further configured to:

for each of the subsequence of tasks within the sequence of tasks calculate a weight of each of the one or more items based on:

1+[|T A −X|]

wherein T A is representative of the time interval for each of the one or more items and X is representative of the number of tasks within the subsequence of tasks.

6. The system of claim 5 , wherein the computer is further configured to:

calculate a weighted average for each of the one or more items in accordance with the determined number of tasks within the subsequence of tasks and the calculated weight of each of the one or more items.

7. The system of claim 1 , wherein the computer is further configured to determine a new order of tasks within the sequence of tasks.

8. A computer-implemented method of providing levelness of a production schedule, comprising:

accessing, by a computer, demand data of one or more items to be processed within a sequence of tasks;

calculating, by the computer, one or more time intervals for each of the one or more items;

calculating, by the computer, a weighted average for each of the one or more items;

calculating, by the computer, a time ratio according to the sequence of tasks by:

calculating the average of the calculated time intervals and the calculated weighted averages; and

calculating a minimum ratio of an adjusted time interval for each of the one or more items and the calculated weighted averages, upper bounded by unity;

generating, by the computer, a production schedule based on a sequence of tasks having a predetermined calculated time ratio; and

storing, by the computer, the generated production schedule in the database.

9. The method of claim 8 , further comprising:

determining a total number of tasks within the sequence of tasks and a total number of tasks for each of the one or more items based on the accessed demand data of the one or more items.

10. The method of claim 9 , wherein the one or more time intervals is determined by calculating the ratio of the total number of tasks within the sequence of tasks and the total number of tasks for each of the one or more items.

11. The method of claim 8 , further comprising:

determining a number of subsequences of tasks within the sequence of tasks for each of the one or more items which have at least [T A ] tasks, where [T A ] is the largest whole number smaller than or equal to the time interval of the item.

12. The method of claim 11 , further comprising:

for each of the subsequences of tasks within the sequence of tasks calculating a weight of each of the one or more items based on:

1+[|T A −X|]

wherein T A is representative of the time interval for each of the one or more items and X is representative of the number of tasks within the subsequence of tasks.

13. The method of claim 12 , further comprising:

calculating a weighted average for each of the one or more items in accordance with the determined number of tasks within the subsequence of tasks and the calculated weight of each of the one or more items.

14. The method of claim 8 , further comprising:

determining a new order of tasks within the sequence of tasks.

15. A computer-readable medium embodied with software providing levelness of a production schedule, the software when executed using one or more computers is configured to:

access demand data of one or more items to be processed within a sequence of tasks;

calculate one or more time intervals for each of the one or more items;

calculate a weighted average for each of the one or more items;

calculate a time ratio according to the sequence of tasks by:

calculating the average of the calculated time intervals and the calculated weighted averages; and

calculating a minimum ratio of an adjusted time interval for each of the one or more items and the calculated weighted averages, upper bounded by unity;

generate a production schedule based on a sequence of tasks having a predetermined calculated time ratio; and

store the generated production schedule in the database.

16. The computer-readable medium of claim 15 , wherein the software is further configured to:

determine a total number of tasks within the sequence of tasks and a total number of tasks for each of the one or more items based on the accessed demand data of the one or more items.

17. The computer-readable medium of claim 16 , wherein the one or more time intervals is determined by calculating the ratio of the total number of tasks within the sequence of tasks and the total number of tasks for each of the one or more items.

18. The computer-readable medium of claim 15 , wherein the software is further configured to:

determine a number of subsequences of tasks within the sequence of tasks for each of the one or more items which have at least [T A ] tasks, where [T A ] is the largest whole number smaller than or equal to the time interval of the item.

19. The computer-readable medium of claim 18 , wherein the software is further configured to:

for each of the subsequence of tasks within the sequence of tasks calculate a weight of each of the one or more items based on:

1+[|T A −X|]

wherein T A is representative of the time interval for each of the one or more items and X is representative of the number of tasks within the subsequence of tasks.

20. The computer-readable medium of claim 19 , wherein the software is further configured to:

calculate a weighted average for each of the one or more items in accordance with the determined number of tasks within the subsequence of tasks and the calculated weight of each of the one or more items.

21. The computer-readable medium of claim 15 , wherein the software is further configured to:

determine a new order of tasks within the sequence of tasks.

Assignments (14)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053383/0117) Recorded Nov 3, 2021
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: BLUE YONDER GROUP, INC.
Reel/Frame 058794/0776 →
RELEASE OF SECURITY INTEREST Recorded Sep 16, 2021
From: JPMORGAN CHASE BANK, N.A.
To: BLUE YONDER GROUP, INC.; BLUE YONDER, INC.; JDA SOFTWARE SERVICES, INC.; I2 TECHNOLOGIES INTERNATIONAL SERVICES, LLC; MANUGISTICS SERVICES, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; REDPRAIRIE COLLABORATIVE FLOWCASTING GROUP, LLC; JDA SOFTWARE RUSSIA HOLDINGS, INC.; REDPRAIRIE SERVICES CORPORATION; BY BOND FINANCE, INC.; BY NETHERLANDS HOLDING, INC.; BY BENELUX HOLDING, INC.
Reel/Frame 057724/0593 →
SECURITY AGREEMENT Recorded Aug 3, 2020
From: BLUE YONDER GROUP, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 053383/0117 →
CHANGE OF NAME Recorded Apr 13, 2020
From: JDA SOFTWARE GROUP, INC.
To: BLUE YONDER GROUP, INC.
Reel/Frame 052386/0186 →
RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0809 Recorded Oct 12, 2016
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 040337/0356 →
SECURITY AGREEMENT Recorded Oct 12, 2016
From: RP CROWN PARENT, LLC; RP CROWN HOLDING LLC; JDA SOFTWARE GROUP, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 040326/0449 →
RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0697 Recorded Oct 12, 2016
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 040337/0053 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jan 2, 2013
From: JDA SOFTWARE GROUP, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 029556/0697 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jan 2, 2013
From: JDA SOFTWARE GROUP, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 029556/0809 →
RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL Recorded Dec 21, 2012
From: WELLS FARGO CAPITAL FINANCE, LLC
To: JDA TECHNOLOGIES US, INC.
Reel/Frame 029529/0812 →
CHANGE OF NAME Recorded Oct 19, 2011
From: I2 TECHNOLOGIES US, INC
To: JDA TECHNOLOGIES US, INC
Reel/Frame 027087/0886 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 19, 2011
From: JDA TECHNOLOGIES US, INC
To: JDA SOFTWARE GROUP, INC
Reel/Frame 027087/0771 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 19, 2011
From: HAYES, TIMOTHY REED; REHMAN, AAMER; RAAR, DALE JAY; BIER, JONATHAN; BARTON, GEORGE EDWARD, JR.
To: I2 TECHNOLOGIES US, INC
Reel/Frame 027086/0841 →
PATENT SECURITY AGREEMENT Recorded Apr 4, 2011
From: JDA TECHNOLOGIES US, INC.
To: WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT
Reel/Frame 026072/0353 →