IP Library Granted Patent US 10,311,391
Granted Patent B2
US 10,311,391 · App. 14/951,841 · Granted Jun 4, 2019

Optimizing inventory in accordance with a constrained network

Inventor: Adeel Najmi (Plano, TX)
Assignee: JDA Software Group, Inc.
G06Q10/06315G06Q10/087Y10S707/949
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 10,311,391
App. No.
14/951,841
Granted
Jun 4, 2019
Kind
B2
Abstract

In one embodiment, optimizing inventory includes accessing service level band sets. Each service level band set is associated with a policy group, and includes service level bands. Each service level band of a service level band set has a service level priority with respect to any other service level bands of the same service level band set. An inventory band set is determined for each service level band set. Each inventory band set includes inventory bands, where each inventory band satisfies a corresponding service level band assuming an unconstrained network. Each inventory band of an inventory band set has an inventory priority with respect to any other inventory bands of the same inventory band set. A feasible supply chain plan that satisfies the inventory band sets is generated in order of the inventory priorities until a constrained network is depleted.

Claims (35)

1. A system, comprising:

a database that stores two or more service level band sets, each service level band set being associated with a policy group, each service level band set comprising two or more service level bands, each service level band of a service level band set having a service level priority with respect to any other service level bands of the same service level band set; and

a computer system coupled to the database and configured to:

access the two or more service level band sets stored in the database;

access two or more supply chain entities stored in the database, the two or more supply chain entities comprising at least one starting entity and at least one ending entity, wherein the at least one starting entity receives items directly from one or more suppliers and supplies items to the at least one ending entity, and the at least one ending entity supplies items directly to at least one customer;

determine an inventory band set for each service level band set, each inventory band set comprising two or more inventory bands, each inventory band satisfying a corresponding service level band assuming an unconstrained network, each inventory band of an inventory band set having an inventory priority with respect to any other inventory bands of the inventory band set;

restrict a network of the two or more supply chain entities with a feasibility constraint that constrains the two or more supply chain entities; and

generate a feasible supply chain plan that satisfies the inventory band sets in order of the inventory priorities until a constrained network is depleted.

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

select a current inventory band of each inventory band set in accordance with the inventory priority of the current inventory band;

generate a current supply chain plan that satisfies the current inventory band and any previously selected inventory band; and

identify the feasible supply chain plan in accordance with the determination.

3. The system of claim 2 , wherein the computer system is further configured to select an inventory band having the highest inventory priority of the inventory bands not previously selected from an inventory band set as the current inventory band by selecting the current inventory band of each inventory band set in accordance with the inventory priority of the current inventory band.

4. The system of claim 2 , wherein the computer system is further configured to identify the feasible supply chain plan in accordance with the determination by adding a satisfaction of the current inventory band to a constraint set constraining the constrained network for a next inventory band.

5. The system of claim 2 , wherein the computer system is further configured to identify the current supply chain plan as the feasible supply chain plan when the current supply chain plan minimizes violation of the current inventory band and the previously selected inventory band to identify the feasible supply chain plan in accordance with the determination.

6. The system of claim 1 , wherein the computer system is further configured to establish an expected service level for the policy group in accordance with the feasible supply chain plan.

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

define the policy group; and

assign a service level band set to the policy group.

8. A computer-implemented method, comprising:

accessing at least one prioritized service level band associated with a policy group and assigned to at least one of two or more supply chain entities of a supply chain network, the two or more entities comprising at least one starting entity and at least one ending entity, wherein the at least one starting entity receives items directly from one or more suppliers and supplies items to the at least one ending entities, and the at least one ending entity supplies items directly to at least one customer;

assessing at least one feasibility constraint that constrains the two or more supply chain entities by restricting a network of the two or more supply chain entities;

calculating two or more prioritized inventory bands corresponding with the at least one prioritized service level band; and

generating a feasible supply chain plan that satisfies the prioritized inventory bands in order of priority until a constrained network is depleted.

9. The computer-implemented method of claim 8 , wherein the feasibility constraint comprises a capacity constraint that restricts inventory on hand of the two or more supply chain entities.

10. The computer-implemented method of claim 8 , wherein the feasibility constraint comprises a constraint restricting the ability to store items at one of the two or more supply chain entities.

11. The computer-implemented method of claim 8 , wherein the feasibility constraint comprises a constraint that restricts the ability to provide items to one of the two or more supply chain entities.

12. A non-transitory computer-readable medium embodied with software, the software when executed using one or more computers is configured to:

access at least one prioritized service level band associated with a policy group and assigned to at least one of two or more supply chain entities of a supply chain network, the two or more entities comprising at least one starting entity and at least one ending entity, wherein the at least one starting entity receives items directly from one or more suppliers and supplies items to the at least one ending entities, and the at least one ending entity supplies items directly to at least one customer;

assess at least one feasibility constraint that constrains the two or more supply chain entities by restricting a network of the two or more supply chain entities;

calculate two or more prioritized inventory bands corresponding with the at least one prioritized service level band; and

generate a feasible supply chain plan that satisfies the prioritized inventory bands in order of priority until a constrained network is depleted.

13. The computer-readable storage medium of claim 12 , wherein the feasibility constraint comprises a capacity constraint that restricts inventory on hand of the two or more supply chain entities.

14. The computer-readable storage medium of claim 12 , wherein the feasibility constraint comprises a constraint restricting the ability to store items at one of the two or more supply chain entities.

15. The computer-readable storage medium of claim 12 , wherein the feasibility constraint comprises a constraint that restricts the ability to provide items to one of the two or more supply chain entities.

Assignments (6)
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 10, 2020
From: JDA SOFTWARE GROUP, INC.
To: BLUE YONDER GROUP, INC.
Reel/Frame 052373/0227 →
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 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 21, 2015
From: NAJMI, ADEEL
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 037342/0138 →
Continuity (3)
Continuation 12758303 · Apr 12, 2010
Continuation 10894248 · Jul 19, 2004
Related Publication 20160078385A1 · Mar 17, 2016