IP Library Patent Application 15230282
Patent Application
App. No. 15/230,282

System and Method of Scenario Versioning

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.
15/230,282
Filed
Aug 5, 2016
Art Unit
2165
USPC
707/758
Abstract

A system and method is disclosed for scenario management. The system includes a database configured to store data describing a plurality of scenarios, each scenario comprising one or more fields and data describing the supply chain network comprising a plurality of network components, each network component configured to supply one or more items to satisfy demand. The system further includes a server coupled with the database; the server accesses the data describing the plurality of scenarios and accesses the data describing the supply chain network. The server further traverses the one or more fields of the plurality of scenarios until a value is determined and stores the determined value in the database for each of the one or more fields of the plurality of scenarios.

Claims (31)

1 . A supply chain planning system, comprising:

a computer coupled with the database and comprising one or more processors and one or more memory units to execute instructions to:

receive scenario data comprising a scenario tree, the scenario tree comprising two or more scenarios, each scenario comprising one or more fields;

store a value of the scenario data in a base scenario of the two or more scenarios for each of the one or more fields;

determine if the scenario data of a child scenario comprises a value in the field and when there is not a value in the field, traverse the scenario tree along a parent scenario recursively, until a value in the field is determined; and

store the value of the child scenario in the field only when the value is different than the determined value in a corresponding field of a respective parent scenario.

2 . The system of claim 1 , wherein the two or more scenarios are in a hierarchy of scenarios.

3 . The system of claim 2 , wherein the base scenario comprises a value for each of the one or more fields.

4 . The system of claim 2 , further comprising storing a value in the one or more fields of each of the two or more scenarios only when the value is different than the value in the one or more fields of the parent scenario.

5 . The system of claim 1 , wherein the scenario tree comprises two or more nodes representing the scenario of the supply chain network.

6 . The system of claim 1 , further comprising a supply chain network comprising two or more supply chain entities, each supply chain entity supplies one or more items to satisfy demand.

7 . A computer-implemented method, comprising:

receiving scenario data comprising a scenario tree, the scenario tree comprising two or more scenarios, each scenario comprising one or more fields;

storing a value of the scenario data in a base scenario of the two or more scenarios for each of the one or more fields;

determining if the scenario data of a child scenario comprises a value in the field and when there is not a value in the field, traverse the scenario tree along a parent scenario recursively, until a value in the field is determined; and

storing the value of the child scenario in the field only when the value is different than the determined value in a corresponding field of a respective parent scenario.

8 . The computer-implemented method of claim 7 , wherein the two or more scenarios are in a hierarchy of scenarios.

9 . The computer-implemented method of claim 8 , wherein the base scenario comprises a value for each of the one or more fields.

10 . The computer-implemented method of claim 8 , further comprising storing a value in the one or more fields of each of the two or more scenarios only when the value is different than the value in the one or more fields of the parent scenario.

11 . The computer-implemented method of claim 7 , wherein the scenario tree comprises two or more nodes representing the scenario of the supply chain network.

12 . The computer-implemented method of claim 7 , further comprising a supply chain network comprising two or more supply chain entities, each supply chain entity supplying one or more items to satisfy demand.

13 . A non-transitory computer-readable storage medium embodied with software, the software when executed using one or more computers:

receive scenario data comprising a scenario tree, the scenario tree comprising two or more scenarios, each scenario comprising one or more fields;

store a value of the scenario data in a base scenario of the two or more scenarios for each of the one or more fields;

determine if the scenario data of a child scenario comprises a value in the field and when there is not a value in the field, traverse the scenario tree along a parent scenario recursively, until a value in the field is determined; and

store the value of the child scenario in the field only when the value is different than the determined value in a corresponding field of a respective parent scenario.

14 . The non-transitory computer-readable storage medium of claim 13 , wherein the two or more scenarios are in a hierarchy of scenarios.

15 . The non-transitory computer-readable storage medium of claim 14 , wherein the base scenario comprises a value for each of the one or more fields.

16 . The non-transitory computer-readable storage medium of claim 14 , wherein the software further stores a value in the one or more fields of each of the two or more scenarios only when the value is different than the value in the one or more fields of the parent scenario.

17 . The non-transitory computer-readable storage medium of claim 13 , wherein the scenario tree comprises two or more nodes representing the scenario of the supply chain network.

18 . The non-transitory computer-readable storage medium of claim 13 , further comprising a supply chain network comprising two or more supply chain entities, each supply chain entity supplies one or more items to satisfy demand.

Assignments (8)
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 052385/0450 →
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 →
CHANGE OF NAME Recorded Aug 11, 2016
From: I2 TECHNOLOGIES US, INC.
To: JDA TECHNOLOGIES US, INC.
Reel/Frame 039648/0814 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 11, 2016
From: JDA TECHNOLOGIES US, INC.
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 039405/0598 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2016
From: MOORKANAT, JAYAN; MOHANTY, DEB KALYAN; GOTLURU, BHANU; CHENNIMALAI, GAYATHRI; SINGAL, NITIN
To: I2 TECHNOLOGIES US, INC
Reel/Frame 039398/0694 →